Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2007-06-26
2007-06-26
Phan, Man U. (Department: 2616)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S229000, C370S395430, C370S428000
Reexamination Certificate
active
09955296
ABSTRACT:
Apparatus and method use pre-order queuing and scheduling. Reordering of the transmission sequence of packets that could be sent out in one round is allowed according to the quantum consumption status of the flow within the round. Per-packet time complexity is maintained independent from an increase in flow number and packets of variable-length are processed.
REFERENCES:
patent: 4475192 (1984-10-01), Fernow et al.
patent: 5042032 (1991-08-01), Dighe et al.
patent: 5859835 (1999-01-01), Varma et al.
patent: 6047000 (2000-04-01), Tsang et al.
patent: 6134217 (2000-10-01), Stiliadis et al.
patent: 6359861 (2002-03-01), Sui et al.
patent: 6430156 (2002-08-01), Park et al.
patent: 6438134 (2002-08-01), Chow et al.
patent: 6470016 (2002-10-01), Kalkunte et al.
patent: 6532213 (2003-03-01), Chiussi et al.
patent: 6532501 (2003-03-01), McCracken
patent: 6560230 (2003-05-01), Li et al.
patent: 6577596 (2003-06-01), Olsson et al.
patent: 6594701 (2003-07-01), Forin
patent: 6654374 (2003-11-01), Fawaz et al.
patent: 6674721 (2004-01-01), Dittia et al.
patent: 6714517 (2004-03-01), Fawaz et al.
patent: 6765915 (2004-07-01), Metzger et al.
patent: 6785232 (2004-08-01), Kotser et al.
patent: 6888806 (2005-05-01), Miller et al.
patent: 6891835 (2005-05-01), Kalkunte et al.
patent: 6920109 (2005-07-01), Yazaki et al.
patent: 6940861 (2005-09-01), Liu et al.
patent: 2001/0043564 (2001-11-01), Bloch et al.
patent: 2002/0012348 (2002-01-01), Mizuhara et al.
patent: 2002/0071387 (2002-06-01), Horiguchi et al.
patent: 2002/0075875 (2002-06-01), Dravida et al.
patent: 2003/0133406 (2003-07-01), Fawaz et al.
patent: 2003/0189947 (2003-10-01), Beshai
patent: 2004/0228274 (2004-11-01), Yazaki et al.
patent: 2005/0163049 (2005-07-01), Yazaki et al.
A. K. Parekh et al., “A generalized processor sharing approach to flow control in integrated services networks: the single-node case,”IEEE/ACM Trans. Networking,pp. 344-357, Jun. 1993.
J. C. R. Bennett et al., “WF2Q: Worst-case fair weighted fair queueing,”Proc. IEEE INFOCOM '96, pp. 120-128, San Francisco, CA, Mar. 1996.
S. J. Golestani, “A self-clocked fair queueing scheme for broadband applications,”Proc. INFOCOM '94, pp. 636-646, Jun. 1994.
L. Zhang, “Virtual Clock: A new traffic control algorithm for packet-switched networks,”ACM Trans. on Computer Systems,vol. 9, No. 2, pp. 101-124, May 1991.
M. Shreedhar et al., “Efficient fair queueing using deficit round-robin,”IEEE/ACM Trans. Networking,vol. 4, No. 3, pp. 375-385, Jun. 1996.
D. Stiliadis et al., “Efficient fair queueing algorithms for packet-switched networks,”IEEE/ACM Trans. Networking,vol. 6, No. 2, pp. 175-185, Apr. 1998.
S. Suri, et al. “Leap forward virtual clock: a new fair queueing scheme with guaranteed delays and throughput fairness,”Proc. INFOCOM '97,pp. 557-565, Apr. 1997.
D. Stiliadis et al., “Latency-rate servers: a general model for analysis of traffic scheduling algorithms,”IEEE/ACM Trans. Networking,vol. 6, No. 5, pp. 611-624, Oct. 1998.
N. Matsufuru et al. “Efficient fair queueing for ATM networks using uniform round robin,”Proc. INFOCOM '99,pp. 389-397, Mar. 1999.
M. Katevenis et al., “Weighted round-robin cell multiplexing in a general-purpose ATM switch chip,”IEEE Journal on Selected Areas in Communication,vol. 9, No. 8, pp. 1265-1279, Oct. 1991.
H. M. Chaskar et al., “Fair scheduling with tunable latency: A Round Robin approach,”IEEE Globecom '99,pp. 1328-1333, Dec. 1999.
J. C. R. Bennett et al., “High speed, scalable, and accurate implementation of packet fair queueing algorithms in ATM networks,”Proc. ICNP '97,pp. 7-14, Oct. 1997.
V. Nageshwara Rao et al., “Concurrent accesss of priority queues,”Trans. on Computers,vol. 37, No. 12, pp. 1657-1665, Dec. 1988.
J. L. Rexford et al., “Hardware-efficient fair queueing architectures for high-speed networks,”Proc. INFOCOM'96, pp. 638-646, Mar. 1996.
Huang Hai-Yang
Lin Ying-Dar
Tsai Chun-Yi
Tsao Shih-Chiang
Finnegan Henderson Farabow Garrett & Dunner L.L.P.
Industrial Technology Research Institute
Phan Man U.
LandOfFree
Method and apparatus for scheduling for packet-switched... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for scheduling for packet-switched..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for scheduling for packet-switched... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3814756