Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2007-11-13
2007-11-13
Duong, Frank (Department: 2616)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
Reexamination Certificate
active
10841009
ABSTRACT:
A system includes a plurality of computers interconnected by a network including one or more switching nodes. The computers transfer messages over virtual circuits established thereamong. A computer, as a source computer for one or more virtual circuit(s), schedules transmission of messages on a round-robin basis as among the virtual circuits for which it is source computer. Each switching node which forms part of a path for respective virtual circuits also forwards messages for virtual circuits in a round-robin manner, and, a computer, as a destination computer for one or more virtual circuit(s), schedules processing of received messages in a round-robin manner. Round-robin transmission, forwarding and processing at the destination provides a degree of fairness in message transmission as among the virtual circuits established over the network. In addition, messages are transmitted in one or more cells, with the round-robin transmission being on a cell basis, so as to reduce delays which may occur for short messages if a long messages were transmitted in full for one virtual circuit before beginning transmission of a short message for another virtual circuit. For each virtual circuit, the destination computer and each switching node along the path for the virtual circuit can generate a virtual circuit flow control message for transmission to the source computer to temporarily limit transmission over the virtual circuit if the amount of resources being taken up by messages for the virtual circuit exceeds predetermined thresholds, further providing fairness as among the virtual circuits. In addition, each switching node or computer can generate link flow control messages for transmission to neighboring devices in the network to temporarily limit transmission thereto if the amount of resources taken up by all virtual circuits exceeds predetermined thresholds, so as to reduce the likelihood of message loss.
REFERENCES:
patent: 4799219 (1989-01-01), Calvignac et al.
patent: 5517495 (1996-05-01), Lund et al.
patent: 5533020 (1996-07-01), Byrn et al.
patent: 5557607 (1996-09-01), Holden
patent: 5579312 (1996-11-01), Regache
patent: 5610921 (1997-03-01), Christensen
patent: 5625625 (1997-04-01), Oskouy et al.
patent: 5664116 (1997-09-01), Gaytan et al.
patent: 5712851 (1998-01-01), Nguyen et al.
patent: 5748629 (1998-05-01), Caldara et al.
patent: 5822612 (1998-10-01), Thomas et al.
patent: 5850395 (1998-12-01), Hauser et al.
patent: 5896511 (1999-04-01), Manning et al.
patent: 5935213 (1999-08-01), Rananand et al.
patent: 5995486 (1999-11-01), Iliadis
patent: 6094712 (2000-07-01), Follett et al.
patent: 6115748 (2000-09-01), Hauser et al.
patent: 6570850 (2003-05-01), Gutierrez et al.
patent: 0 717 532 (1996-06-01), None
patent: WO 96/17489 (1996-06-01), None
“Constant-Time Dynamic ATM Bandwidth Scheduling For Guaranteed and Best Effort Services With Overbooking,” by Dong Lin, 1997 IEEE, pp. 398-405.
Clayton Shawn A.
Follett David R.
Godiwala Nitin D.
Gutierrez Maria C.
Wells David S.
Duong Frank
Emulex Design & Manufacturing Corporation
Morrison & Foerster / LLP
LandOfFree
System and method for scheduling message transmission and... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for scheduling message transmission and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for scheduling message transmission and... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3832221