IP Library Patent Application 16676783
Patent Application
App. No. 16/676,783

METHOD AND APPARATUS FOR DYNAMIC TRACK ALLOCATION IN A NETWORK

Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US None
App. No.
16/676,783
Abstract

A method for dynamic track allocation in a network comprising accessing a message to be routed to a target node; receiving from a path computation element (PCE), a track from the first node to the target node, wherein the track includes at least any intermediate nodes that provide a path from the first node to the target node, wherein the track comprises one or more allocated link resources to the first node, to any intermediate nodes, and to the target node; assigning a track identifier and an expiration time to the defined track; appending the assigned link resources, expiration time and track identifier to the message; and transmitting the message from the first node to the target node, wherein transmitting causes subsequent messages with the same assigned track identifier to be routed through the network along the same route and using the link resources configured by the message.

Claims (41)

1 . A computer implemented method for dynamic track allocation in a network comprising:

accessing, at a first network node, a first message to be routed to a destination network node;

receiving from a path computation element (PCE), a defined track from the first network node to the destination network node, wherein the track includes at least the first network node, the destination network node, and any intermediate network nodes that provide a path from the first network node to the destination network node, wherein the track comprises one or more allocated link resources to the first network node, one or more allocated link resources to any intermediate network nodes, and one or more allocated link resources to the destination network node;

assigning a track identifier to the defined track;

assigning an expiration time to the defined track;

appending the allocated link resources, expiration time, and track identifier to the first message; and

transmitting the first message from the first network node to the destination network node, wherein transmitting causes subsequent messages with the same assigned track identifier to be routed through the network along the same route and using the link resources configured by the first message.

2 . The method of claim 1 , wherein a link resource is a timeslot, channel offset, and next hop destination address on a network node.

3 . The method of claim 1 , wherein the one or more link resources are shared with one or more defined tracks.

4 . The method of claim 1 , wherein the first network node is a border router.

5 . The method of claim 1 , wherein the path computational element is not on a network node.

6 . The method of claim 1 , wherein the first network node comprises a path computation element.

7 . The method of claim 1 , wherein the first message is be assigned a track are queued until link resources are available.

8 . The method of claim 7 , wherein messages are stored in more than one priority queue.

9 . The method of claim 1 , wherein tracks are timed out according to an assigned expiration time and all track link assignments are retained by all nodes in the defined track until the track has expired.

10 . A system for dynamic track allocation in a network, comprising:

a plurality of nodes, wherein each node comprises:

a) at least one processor;

b) at least one input device; and

c) at least one storage device storing processor-executable instructions track information, and one or more message queues which, when executed by the at least one processor, perform a method including: accessing, at a first network node, a first message to be routed to a destination network node;

receiving from a path computation element (PCE), a defined track from the first network node to the destination network node, wherein the track includes at least the first network node, the destination network node, and any intermediate network nodes that provide a path from the first network node to the destination network node, wherein the track comprises one or more allocated link resources to the first network node, one or more allocated link resources to any intermediate network nodes, and one or more allocated link resources to the destination network node;

assigning a track identifier to the defined track;

assigning an expiration time to the defined track;

appending the allocated link resources, expiration time, and track identifier to the first message; and

transmitting the first message from the first network node to the destination network node, wherein transmitting causes subsequent messages with the same assigned track identifier to be routed through the network along the same route and using the link resources configured by the first message.

11 . The system of claim 10 , wherein a link resource is a timeslot, channel offset, and next hop destination address on a network node.

12 . The system of claim 10 , wherein the one or more link resources are shared with one or more defined tracks.

13 . The system of claim 10 , wherein the first network node is a border router.

14 . The system of claim 10 , wherein the path computational element is not on a network node.

15 . The system of claim 10 , wherein the first network node comprises a path computation element.

16 . The system of claim 10 , wherein the first message is be assigned a track are queued until link resources are available.

17 . The system of claim 16 , wherein messages are stored in more than one priority queue.

18 . The system of claim 10 , wherein tracks are timed out according to an assigned expiration time and all track link assignments are retained by all nodes in the defined track until the track has expired.

19 . A non-transitory computer readable medium for storing computer instructions that, when executed by at least one processor causes the at least one processor to perform a method for dynamic track allocation, comprising:

accessing, at a first network node, a first message to be routed to a destination network node;

receiving from a path computation element (PCE), a defined track from the first network node to the destination network node, wherein the track includes at least the first network node, the destination network node, and any intermediate network nodes that provide a path from the first network node to the destination network node, wherein the track comprises one or more allocated link resources to the first network node, one or more allocated link resources to any intermediate network nodes, and one or more allocated link resources to the destination network node;

assigning a track identifier to the defined track;

assigning an expiration time to the defined track;

appending the allocated link resources, expiration time, and track identifier to the first message; and

transmitting the first message from the first network node to the destination network node, wherein transmitting causes subsequent messages with the same assigned track identifier to be routed through the network along the same route and using the link resources configured by the first message.

20 . The non-transitory computer readable medium of claim 19 , wherein a link resource is a timeslot, channel offset, and next hop destination address on a network node, and wherein the one or more link resources are shared with one or more defined tracks.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 20, 2019
From: VEILLETTE, MICHEL
To: TRILLIANT NETWORKS, INC.
Reel/Frame 051067/0025 →