Multiplex communications – Data flow congestion prevention or control – Flow control of data transmission through a network
Reexamination Certificate
2003-09-16
2008-12-16
Ngo, Ricky (Department: 2616)
Multiplex communications
Data flow congestion prevention or control
Flow control of data transmission through a network
C370S252000, C370S392000, C709S241000
Reexamination Certificate
active
07466655
ABSTRACT:
An ant-based method for discovering a network path that satisfies a quality of service (QoS) requirement is disclosed. A “forward QoS ant,” which indicates a destination and a QoS requirement, is received at a particular router. The forward QoS ant is updated to indicate the particular router's identity. Given a metric “X,” such as delay, jitter, etc., it is determined whether a least-“X” path from the particular router to the destination satisfies the QoS requirement, and whether the forward QoS ant has visited any other routers in the least-“X” path. If the least-“X” path satisfies the QoS requirement and the forward QoS ant has not visited any other router in the least-“X” path, then the forward QoS ant is sent to the next router in the least-“X” path. Later, a “backward QoS ant,” which indicates the path taken by the forward QoS ant, is received at the particular router.
REFERENCES:
patent: 6084858 (2000-07-01), Matthews et al.
patent: 2003/0072269 (2003-04-01), Teruhi et al.
patent: 2003/0202468 (2003-10-01), Cain et al.
patent: 2003/0202479 (2003-10-01), Huang et al.
patent: 2003/0204616 (2003-10-01), Billhartz t al.
patent: 2005/0128944 (2005-06-01), Zhang et al.
Apostolopoulos, G., et al., “QoS Routing Mechanisms and OSPF Extensions”, Network Working Group, RFC 2676, Aug. 1999, 50 pages.
Moy, J., “OSPF Version 2”, Network Working Group, RFC 2178, Cascade Communications Corp., Jul. 1997, 197 pages.
Zhao, Felix Cho, “ANTD: An Adaptive, Deterministic Ant Routing Algorithm”, Cisco Systems, Document No. EDCS- 255496, Revision 0.1, dated Jul. 16, 2003, 38 pages.
Di Caro, Gianni, et al., “AntNet: Distributed Stigmergetic Control for Communications Networks”, AI Access Foundation and Morgan Kaufmann Publishers, Journal of Artificial Intelligence Research 9, 1998, 49 pages.
S. Murphy, et al., “OSPF with Digital Signature,” Jun. 1997, Network Working Group, Request for Comments: 2154, http://www.ietf.org/rfc/rfc2154.txt?number=2154, data retrieved Dec. 8, 2003, pp. 1-28.
David L. Mills, “Network Time Protocol (Version 3), Specification, Implementation and Analysis,” Mar. 1992, Network Working Group, Request for Comments: 1305, http://www.ietf.org/rfc/rfc1305.txt?number=1305, data retrieved Dec. 8, 2003, p. 1-107.
Y. Rekhter, et al., “A Border Gateway Protocol 4 (BGP-4),” Mar. 1995, Network Working Group, Request for Comments: 1771, http://www.ietf.org/rfc/rfc1771.txt?number=1771, data retrieved Jun. 5, 2003, pp. 1-54.
Gianni Di Caro, et al., “AntNet: Distributed Stigmergetic Control for Communications Networks,” Journal of Artifical Intelligence Research 9, submitted May 1998, published Dec. 1998, pp. 317-365.
Marco Dorigo, et al., “The Ant System: Optimization by a colony of cooperating agents,” IEEE Transactions on Systems, Man, and Cybernetics-Part B, vol. 26, No. 1, 1996, pp. 1-26.
Ruud Schoonderwoerd, et al., “Ant-Based load balancing in telecommunications networks,” pp. 1-26, May 21, 1996.
Felix Cho Zhao, Cisco Systems, Inc., “ANTD: An Adaptive, Deterministic Ant Routing Algorithm,” 2003, Document No. EDCS-255496, pp. 1-38.
Eric Bonabeau, et al., “Swarm Smarts,” Scientific American, Mar. 2000, pp. 72-79.
Dimitri Bertsekas, et al., “Data Networks,” Prentice Hall, 1992, pp. 365-369 and 393-400.
Andrew S. Tanenbaum, “Computer Networks,” Second Edition, Prentice Hall, 1996, pp. 345-365.
Malvin H. Kalos, et al., “Monte Carol Methods, vol. I: Basics,” 1986, pp. 1-3 and 129-140.
Richard Bellman, “Dynamic Programming,” Princeton University Press, Princeton, NJ, 1957, 362 pages.
C. Hedrick, “Routing Information Protocol,” Jun. 1998, Network Working Group, Request for Comments: 1058, http://www.ietf.org/rfc/rfc1058.txt?number=1058, data retrieved Jan. 14, 2004, pp. 1-31.
J. Moy, “OSPF Version 2,” Jul. 1991, Network Working Group, Request for Comments: 1247, http://www.ietf.org/rfc/rfc1247.txt?number=1247, data retrieved Jan. 14, 2004, pp. 1-76.
Bruce Davie, et al., “MPLS Technology and Applications,” Morgan Kaufamann Publishers, 2000, 301 pages.
E. Crawley, et al., “A Framework for QoS-based Routing in the Internet,” Aug. 1998, Network Working Group, Request for Comments: 2386, http://www.ietf.org/rfc/rfc2386.txt?number=2386, data retrieved Jan. 14, 2004, pp. 1-35.
G. Apostolopoulus, et al., “QoS Routing Mechanisms and OSPF Extensions,” Aug. 1999, Network Working Group, Request for Comments: 2676, http://www.ietf.org/rfc/rfc2676.txt?number=2676, data retrieved Jan. 14, 2004, pp. 1-47.
J. Moy, “OSPF Version 2,” Jul. 1997, Network Working Group, Request for Comments: 2178, http://www.ietf.org/rfc/rfc2178.txt?number=2178, data retrieved Dec. 8, 2003, pp. 1-197.
Shigang Chen, et al., “Distributed Quality of Service Routing in High-Speed Networks Based on Selective Routing,” IEEE, 1998, pp. 80-89.
Kang G. Shin, et al., “Distributed Route Selection for Establishing Real-Time Channels,” Aug. 30, 1999, pp. 1-29.
Hussein F. Salama, et al., “A Distributed Algorithm for Delay-Constrained Unicast Routing,” IEEE, 1997, 8 pages.
Shigang Chen, et al., “An Overview of Quality-of-Service Routing for the Next Generation High Speed Networks: Problems and Solutions,” pp. 1-19, 1998.
Cisco Technology Inc.
Hickman Palermo & Truong & Becker LLP
Ngo Ricky
Sinkantarakorn Pao
LandOfFree
Ant-based method for discovering a network path that... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Ant-based method for discovering a network path that..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ant-based method for discovering a network path that... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4048485