Multiplex communications – Data flow congestion prevention or control – Control of data admission to the network
Reexamination Certificate
2006-01-24
2006-01-24
Pezzlo, John (Department: 2662)
Multiplex communications
Data flow congestion prevention or control
Control of data admission to the network
C370S412000
Reexamination Certificate
active
06990070
ABSTRACT:
A method and apparatus are provided for adjusting the volume of data communicated between a transmitter and a receiver on a network, in a time interval. The method involves producing a desired volume value in response to a volume value specified by the receiver and a difference between a target departure volume and an estimate of arrival volume of data at a queue through which data passes from the transmitter to the receiver, and communicating the desired volume value to the transmitter in response to an acknowledgement signal produced by the receiver.
REFERENCES:
patent: 4769815 (1988-09-01), Hinch et al.
patent: 5541919 (1996-07-01), Yong et al.
patent: 5546389 (1996-08-01), Wippenbeck et al.
patent: 5737313 (1998-04-01), Kolarov et al.
patent: 5748901 (1998-05-01), Afek et al.
patent: 5781772 (1998-07-01), Wilkinson, III et al.
patent: 5805585 (1998-09-01), Javitt et al.
patent: 6011795 (2000-01-01), Varghese et al.
patent: 6018524 (2000-01-01), Turner et al.
patent: 6067574 (2000-05-01), Tzeng
patent: 6108307 (2000-08-01), McConnell et al.
patent: 6119235 (2000-09-01), Vaid et al.
patent: 6212184 (2001-04-01), Venkatachary et al.
patent: 6215769 (2001-04-01), Ghani et al.
patent: 6219713 (2001-04-01), Ruutu et al.
patent: 6223172 (2001-04-01), Hunter et al.
patent: 6252851 (2001-06-01), Siu et al.
patent: 6266706 (2001-07-01), Brodnik et al.
patent: 6324165 (2001-11-01), Fan et al.
patent: 6333917 (2001-12-01), Lyon et al.
patent: 6424626 (2002-07-01), Kidambi et al.
patent: 6463068 (2002-10-01), Lin et al.
patent: 6490251 (2002-12-01), Yin et al.
patent: 6526055 (2003-02-01), Perlman et al.
patent: 6529477 (2003-03-01), Toporek et al.
patent: 6549517 (2003-04-01), Aweya et al.
patent: 6560610 (2003-05-01), Eatherton et al.
patent: 6614789 (2003-09-01), Yazdani et al.
patent: 6671258 (2003-12-01), Bonneau
Kalampoukas, Lampros; Varma, Anujan; Ramakrishnan, K.K.; “Explicit Window Adaptation: A Method to Enhance TCP Performance”, UCSC-97-21, pp. 1-28, Aug. 1997.
Satyavolu, Ramakrishna; Duvedi, Ketan; Kalyanaraman, Shivkumar; “Explicit Rate Control of TCP Applications”, ATM Forum Document Number: ATM Forum/98-0152R1, pp. 1-20, Feb. 1998.
Ziegler, T.; Clausen, H.D.; Congestion Avoidance with BUC (Buffer Utilization Control) Gateways and RFCN (Reverse Feedback Congestion Notification).
Elz, R.; “A Compact Representation of IPv6 Addresses”, Network Working Group, University of Melbourne, pp. 1-6, Apr. 1, 1996.
Jacobson, Van, Karels Michael J.; “Congestion Avoidance and Control”, Proc. ACM SIGCOMM'88, pp. 314-329, Nov., 1988.
Jacobson, Van; “Modified TCP Congestion Avoidance Algorithm”, end2end-interest mailing list, Apr. 30, 1990.
Floyd, Sally; Jacobson, Van; “Random Early Detection Gateways for Congestion Avoidance”, IEEE/ACM Trans. Networking, vol. 1, No. 4, pp. 297-413, Aug. 1993.
Fall, Kevin; Floyd, Sally; “Simulation-based Comparisons of Tahoe, Reno, and SACK TCP”, Computer Commun. Rev. Jul. 1996.
Mathis, M.; Mahdavi, J.; Floyd, S.; Romanow, A.; “TCP Selective Acknowledgement Options”, IETF RFC 2018, pp. 1-12, Oct. 1996.
Mathis, Matthew; Mahdavi, Jamshid; “Forward Acknowledgement: Refining TCP Congestion Control”, Proc. ACM SIGCOMM'96, Aug. 1996.
Demers, Alan; Keshav, Srinivasan; Shenker, Scott; “Analysis and Simulation of a Fair Queueing Algorithm”, Internetworking: Research and Experience, vol. 1, pp. 1-12, 1989.
Braden, B.; Clark, D.; Crowcroft, J.; Davie, B.; Deering, S.; Estrin, D.; Floyd, S.; Jacobson, V.; Minshall, G.; Partiridge, C.; Peterson, L.; Ramakrishnan, K.; Shenker, S.; Wroclawski, J.; Zhang, L.; “Recommendations on Queue Management and Congestion Avoidance in the Internet”, IETF RFC 2309, pp. 1-17, Apr. 1998.
Partridge, C.; “ACK Spacing for High Delay-Bandwidth Paths with Insufficient Buffering”, IETF Internet Draft, pp. 1-4, Sep. 1998.
Rijsinghani, A.; “Computation of the Internet Checksum via Incremental Update”, IETF RFC 1624, pp. 1-6, May 1994.
Floyd, Sally; Jacobson, Van; “Link-Sharing and Resource Management Models for Packet Networks”, IEEE/ACM Trans. Networking, vol. 3, No. 4, pp. 365-386, Aug. 1995.
“Traffic Management Specification Version 4.0”, The ATM Forum, Apr. 1996.
Ott, Teunis J.; Lakshman, T.V.; Wong, Larry H.; “SRED: Stabilized RED”, INFOCOMM '99, Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies Proceedings, IEEE, Jun. 1999, vol. 3, pp. 1346-1355.
Feng, Wu-Chang; Kandlur, Dilip D.; Saha, Debanjan; Shin, Kang G.; “Blue: A New Class of Active Queue Management Algorithms”, U. Michigan CSE-TR-387-99, Apr. 1999.
Feng, Wu-Chang; Kandlur, Dilip D.; Shah, Debanjan; Shin, Kang G.; “Techniques for Eliminating Packet Loss in Congested TCP/IP Networks”, U. Michigan CSE-TR-349-97, Nov. 1997.
Srinivasan, V.; Varghese, G.; “Faster IP Lookups using Controlled Prefix Expansion”, ACM Transactions on Computer Systems, pp. 1-10, Jun. 1998.
Eatherton, William N.; “ASIC Based IPV4 Lookups”, Washington University, Applied Research Laboratory, pp. 1-22, Jun. 23, 1998.
Eatherton, William N.; “Hardware-Based Internet Protocol Prefix Lookups”, Thesis, Washington University, pp. 1-100, May 1999.
Srinivasan, V.; Varghese, G.; “Fast Address Lookups Using Controlled Prefix Expansion”, ACM Transactions on Computer Systems, vol. 17, No. 1, pp. 1-40, Feb. 1999.
Filippi, E.; Innocenti, V.; Vercellone, V.; “Address Lookup Solutions for Gigabit Switch/Router”, Globecom '98, Sydney, Australia, Nov. 1998.
Degermark, Mikael; Brodnik, Andrej; Carlsson, Svante; Pink, Stephen; “Small Forwarding Tables for Fast Routing Lookups”, Proc. of ACM SIGCOMM, pp. 3-14, Sep. 1997.
Doeringer, Willibald; Karjoth, Gunter; Nassehi, Medhi; “Routing on Longest-Matching Prefixes”, IEEE/ACM Trans. On Networking, vol. 4, No. 1, pp. 86-97, Feb. 1996.
Tzeng, Henry Hong-Yi; Przygienda, Tony; “On Fast Address-Lookup Algorithms”; pp. 1067-1082, IEEE Journal On Selected Areas In Communications, vol. 17, No. 6, Jun. 1999.
Tzeng, Henry Hong-Yi; “Longest Prefix Search Using Compressed Trees”, Globecom '98, Sydney, Australia, Nov. 1998.
Kumar, Vijay P.; Lakshman, T.V.; Stiliadis, Dimitrios; Beyond Best Effort: Router Architectures for the Differentiated Services of Tomorrow's Internet, IEEE Communications Magazine, pp. 152-164, May 1998.
Gupta, Pankaj; Lin, Steven; McKeown, Nick; “Routing Lookups in Hardware at Memory Access Speeds”, IEEE INFOCOM, Apr. 1998.
Nilsson, Stefan; Karlsson, Gunnar; “Fast Address Lookup for Internet Routers”, IFIP Workshop on Broadband Communications, pp. 10-22, Apr. 1998.
Waldvogel, Marcel; Varghese, George; Turner, Jon; Plattner, Bernhard; “Scalable High Speed IP Routing Lookups”, Proc. Of ACM SIGCOM, Sep. 1997.
Lampson, B.; Srinivasan, V.; Varghese, G.; “IP Lookups Using Multiway and Multicolumn Search”, pp. 1-23, Aug. 1997.
Zitterbart, M.; Harbaum, T.; Meier, D.; Brokelmann, D.; “HeaRT: High Performance Routing Table Look Up”, IEEE Workshop Architecture & Implementation of High Performance Communications Subsystems, Thessaloniki, Greece, Jun. 1997.
Fuller, V.; Li, T.; Yu, J.; Varadhan, K.; “Classless Inter-Domain Routing (CIDR): an Address Assignment and Aggregation Strategy”, RFC 1519, Internet Engineering Task Force, Sep. 1993.
Pei, Tong Bi; Zukowksi, Charles; “Putting Routing Tables in Silicon”, IEEE Network Magazine, pp. 42-50, Jan. 1982.
Morrison, Donald R.; “Patricia—Practical Algorithm To Retrieve Information Coded in Alphanumeric”, Journal of the Association for Computing Machinery, pp. 514-534, vol. 15, No. 4, Oct. 1968.
Ghani, Nasir, “Enhanced TCP/IP ACK Pacing for High Speed Networks”, Proc. 16th Int'l Teletraffic Congress, Edin
Aweya James
Montuno Delfin Y.
Quellette Michel
Nortel Networks Limited
Odland David
LandOfFree
Method and apparatus for adjusting packet transmission... 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 adjusting packet transmission..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for adjusting packet transmission... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3593433