Multiplex communications – Pathfinding or routing – Through a circuit switch
Reexamination Certificate
2008-01-15
2008-01-15
Pham, Chi (Department: 2616)
Multiplex communications
Pathfinding or routing
Through a circuit switch
C370S389000, C370S412000
Reexamination Certificate
active
10270264
ABSTRACT:
Roughly described, a striping algorithm selects a route on which to transmit each next data segment, pseudorandomly from among a subset of eligible routes, the subset being chosen in dependence upon relative channel loading so far. Preferably each ingress node to a switching system chooses an outgoing route for each given next data segment, according to a pseudorandom algorithm, from among a respective given subset containing only those routes via which the amount of data sent from the ingress node during a respective prior time period is no greater than an average of the amount of data sent from the ingress node via any of its outgoing routes during the same prior time period.
REFERENCES:
patent: 5280470 (1994-01-01), Buhrke et al.
patent: 5367518 (1994-11-01), Newman
patent: 5455826 (1995-10-01), Ozveren et al.
patent: 5754120 (1998-05-01), Argentati
patent: 5859835 (1999-01-01), Varma et al.
patent: 5903735 (1999-05-01), Kidder et al.
patent: 5923644 (1999-07-01), McKeown et al.
patent: 5926459 (1999-07-01), Lyles et al.
patent: 5930234 (1999-07-01), Yoshida
patent: 5946297 (1999-08-01), Calvignac et al.
patent: 6038217 (2000-03-01), Lyles
patent: 6064650 (2000-05-01), Kappler et al.
patent: 6064651 (2000-05-01), Rogers et al.
patent: 6064677 (2000-05-01), Kappler et al.
patent: 6078585 (2000-06-01), Kakuma et al.
patent: 6101193 (2000-08-01), Ohba
patent: 6134217 (2000-10-01), Stiliadis et al.
patent: 6345040 (2002-02-01), Stephens et al.
patent: 6359861 (2002-03-01), Sui et al.
patent: 6388992 (2002-05-01), Aubert et al.
patent: 6426944 (2002-07-01), Moore
patent: 6683884 (2004-01-01), Howard
patent: 6810031 (2004-10-01), Hegde et al.
patent: 6810426 (2004-10-01), Mysore et al.
patent: 7023841 (2006-04-01), Dell et al.
patent: 7106699 (2006-09-01), Barri
patent: 7139271 (2006-11-01), Parruck et al.
patent: 2002/0012340 (2002-01-01), Kalkunte et al.
patent: 2002/0012341 (2002-01-01), Battle et al.
patent: 2002/0131413 (2002-09-01), Tsao et al.
patent: WO 00/64109 (2000-10-01), None
Adiseshu H. et al. ,“A Reliable and Scalable Striping Protocol”, In Proceedings of the ACM SIGCOMM '96 Conference, Stanford University, Aug. 1996.
C. Clos, “A Study of Non-Blocking Switching Networks”, Bell System Technical Journal, Mar. 1953, vol. 32, No. 3, pp. 406-424.
M. Shreedhar and G. Varghese, “Efficient Fair Queuing Using Deficit Round Robin,” in Proceedings of ACM SIGCOMM'95, pp. 231-242 (1995).
“A Reliable and Scalable Striping Protocol*” by Hari Adiseshu et al. Department of Computer Science, Washington University, St. Louis, MO 63130, USA, 11 pages.
Agarwal Gaurav
Mo Jeonghoon
Musacchio John T.
Walrand Jean
Agere Systems Inc.
Mendelsohn Steve
Pham Chi
Phan Tri H.
LandOfFree
Deficit-based striping algorithm does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Deficit-based striping algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deficit-based striping algorithm will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3944063