Granted Patent B2

US 7,764,665 · App. 10/162,454 · Granted Jul 27, 2010

Abstract

Claims (34)

1. A method for delivering real time data across a network comprising the steps of:

determining a packet flow schedule for at least one data packet to reach at least one node in a path across said network; and

reserving bandwidth for use by said at least one packet in said path according to said packet flow schedule wherein said packet flow schedule is calculated to implement controlled delays in transmission of said at least one data packet between said at least one node, wherein a packet is intentionally delayed before begin transmitted in order to arrive at a destination at a preferred time, wherein each of said at least one node is associated with a dedicated transmit function schedule interval and a dedicated receive function schedule interval, wherein said reserving bandwidth further comprises utilizing historical data to maximize immediate use of a switch by rerouting packets through other switches in anticipation of an upcoming busy period as indicated by said historical data;

determining an optimal path for said at least one data packet to travel in said network, wherein said determining an optimal path comprises:

computing a fastest schedule through a network of switches; and

accounting for delays in said switches and in nodes between said switches; and

skewing receive appointment windows by an amount to accommodate a delay encountered along said path such that a delayed packet does not miss an assigned appointment and be declared unscheduled.

2. The method according to claim 1 further comprising the step of guaranteeing bandwidth for real-time transmission of said at least one data packet that are transmitted and delivered according to said schedule by guaranteeing time during which an application can place said at least one data packet into a transmission path.

3. The method according to claim 2 further comprising the step of allocating guaranteed bandwidth to multiple applications or multiple process threads.

4. The method according to claim 1 further comprising the step of:

communicating said packet flow schedule to said at least one node.

5. The method according to claim 1 wherein said packet flow schedules are maintained independently at each of said at least one node.

6. The method according to claim 1 further comprising the step of:

coordinating said schedules between a plurality of nodes.

7. The method according to claim 6 wherein each node is coordinated with a next node along said path to an endpoint receiver for an associated packet flow.

8. The method according to claim 6 wherein an endpoint transmitter coordinates its transmissions with all nodes along said path to an endpoint receiver.

9. The method according to claim 1 wherein said path across said network comprises an optimal path between an endpoint transmitter and an endpoint receiver.

10. The method according to claim 1 further comprising the step of:

incorporating said packet flow schedule in said at least one data packet.

11. The method according to claim 1 wherein unscheduled data is communicated through said network along with said at least one data packet that is transferred according to said packet flow schedule.

12. The method according to claim 1 wherein an endpoint transmitter coordinates its transmissions with all nodes along said path to an endpoint receiver; and

wherein said path across said network comprises an optimal path between said endpoint transmitter and said endpoint receiver.

13. A method for delivering real time data across a network comprising the steps of:

determining a packet flow schedule for at least one data packet to reach at least one node in a path across said network, wherein each of said at least one node is associated with a dedicated transmit function schedule interval and a dedicated receive function schedule interval;

reserving bandwidth for use by said at least one packet in said path according to said packet flow schedule wherein said packet flow schedule is calculated to implement controlled delays in transmission of said at least one data packet between said at least one node, wherein a packet is intentionally delayed before begin transmitted in order to arrive at a destination at a preferred time, wherein said reserving bandwidth further comprises utilizing historical data to maximize immediate use of a switch by rerouting packets through other switches in anticipation of an upcoming busy period as indicated by said historical data;

guaranteeing bandwidth for real-time transmission of said at least one data packet that are transmitted and delivered according to said schedule by guaranteeing time during which an application can place said at least one data packet into a transmission path;

allocating guaranteed bandwidth to multiple applications or multiple process threads;

determining an optimal path for said at least one data packet to travel in said network by computing a fastest schedule through a network of switches and accounting for delays in said switches and in nodes between said switches;

incorporating said packet flow schedule in said at least one data packet;

communicating said packet flow schedule to said at least one node;

independently maintaining said packet flow schedules at each of said at least one node;

coordinating said schedules between a plurality of nodes by coordinating each node with a next node along said path to an endpoint receiver for an associated packet flow; and

skewing receive appointment windows by an amount to accommodate a delay encountered along said path such that a delayed packet does not miss an assigned appointment and be declared unscheduled.

14. The method of claim 13 wherein said controlled delays account for said delays in said switches and in nodes between said switches.

Assignments (17)