Multiplex communications – Data flow congestion prevention or control – Control of data admission to the network
Reexamination Certificate
2006-04-27
2010-10-19
Ahmed, Salman (Department: 2476)
Multiplex communications
Data flow congestion prevention or control
Control of data admission to the network
C370S230000
Reexamination Certificate
active
07817548
ABSTRACT:
The invention provides an arbitration method and an arbiter circuit by which equal arbitration of output cells can be achieved with a comparatively simple configuration even where a very great number of queues are involved. The arbiter circuit includes a plurality of queues for storing output cells, and a plurality of round robins for successively providing the right of outputting output cells to the queues. The round robins are arranged in a multi-stage tree link configuration, and the queues are distributed under those of the round robins which are in the lowest order stage. Each of the round robins in the lowest order stage has a rate information holding function of holding rate information representative of a rate of cells inputted thereto. Meanwhile, each of the round robins in the higher order stage or stages has a rate information holding function of holding rate information regarding those of the round robins which are subordinate to the round robin and a subordinate selection function of selecting one of the subordinate round robins based on the rate information of the subordinate round robins. A queue is added as a subordinate to the selected round robin in the lowest order stage when a connection is to be added newly.
REFERENCES:
patent: 5130983 (1992-07-01), Heffner, III
patent: 5265207 (1993-11-01), Zak et al.
patent: 5301333 (1994-04-01), Lee
patent: 6198723 (2001-03-01), Parruck et al.
patent: 6556571 (2003-04-01), Shahrier et al.
patent: 6556578 (2003-04-01), Silberschatz et al.
patent: 7046685 (2006-05-01), Matsuoka et al.
patent: 7065049 (2006-06-01), Ohno
patent: 7173931 (2007-02-01), Chao et al.
patent: 7688815 (2010-03-01), Bialkowski et al.
patent: 2002/0031138 (2002-03-01), Ohno
patent: 2002/0057680 (2002-05-01), Ofek et al.
patent: 2002/0061028 (2002-05-01), Chao et al.
patent: 2002/0075884 (2002-06-01), Wellen
patent: 2002/0110135 (2002-08-01), Oki et al.
patent: 2002/0176431 (2002-11-01), Golla et al.
patent: 2003/0021266 (2003-01-01), Oki et al.
patent: 2003/0223420 (2003-12-01), Ferolito
patent: 2004/0210688 (2004-10-01), Becker
patent: 2006/0047842 (2006-03-01), McElwain
patent: 2006/0165098 (2006-07-01), Varma
patent: 2006/0165111 (2006-07-01), Varma
patent: 2006/0193324 (2006-08-01), Ohno
patent: 2006/0204170 (2006-09-01), Igarashi et al.
patent: 2009/0160686 (2009-06-01), Wong et al.
patent: 2797989 (1998-07-01), None
patent: 10-224364 (1998-08-01), None
patent: 11-191774 (1999-07-01), None
patent: 2001-16206 (2001-01-01), None
Continuous routing in packet switches; MD Grammatikakis, E Fleury, M Kraetzl—1998.
Crossbar Arbitration in Interconnection Networks for Multiprocessors and Multicomputers; HC Chi—1994.
Artificial neural net applications in telecommunication systems; Journal Neural Computing & Applications; Publisher Springer London; ISSN 0941-0643 (Print) 1433-3058 (Online); Issue vol. 1, No. 2 / Jun. 1993.
Multi-tera-bit/s switch based on burst transfer and independent shared buffers; Beshai, M.; Munter, E.; Global Telecommunications Conference, 1995.
Manabu Yoshino, “Research into the Zone Guarantee-Type Packet Readout Circuit Structure Method”, Institute of Electronics, Information, and Communication Engineers, Technical Reports, Japan, Institute of Electronics, Information, and Communication Engineers, Ltd., Jun. 25, 1998, vol. 98, No. 147, pp. 7-12.
Ahmed Salman
Harrity & Harrity LLP
Juniper Networks, Inc.
LandOfFree
Traffic arbitration does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Traffic arbitration, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Traffic arbitration will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4196107