Multiplex communications – Data flow congestion prevention or control – Flow control of data transmission through a network
Reexamination Certificate
2008-06-03
2008-06-03
Lee, Andrew C. (Department: 2616)
Multiplex communications
Data flow congestion prevention or control
Flow control of data transmission through a network
C370S392000, C370S410000
Reexamination Certificate
active
07382731
ABSTRACT:
A method of updating probabilistic network routing information is disclosed. A “backward ant” data packet is received. The backward ant data packet contains information about the quality of a network route, at least a portion of which was selected based on a set of router-probability associations, and through which a “forward ant” data packet was transmitted. The set, which is associated with a particular destination router for which the forward ant data packet was destined, is updated based on the information.
REFERENCES:
patent: 5933425 (1999-08-01), Iwata
patent: 6377551 (2002-04-01), Luo et al.
patent: 6584093 (2003-06-01), Salama et al.
patent: 6594268 (2003-07-01), Aukia et al.
patent: 6744774 (2004-06-01), Sharma
patent: 6813272 (2004-11-01), An et al.
patent: 6944675 (2005-09-01), Fujita
patent: 7047316 (2006-05-01), Iwata et al.
patent: 2001/0034853 (2001-10-01), Takatama et al.
patent: 2003/0072269 (2003-04-01), Teruhi et al.
patent: 2003/0202468 (2003-10-01), Cain et al.
patent: 2003/0204616 (2003-10-01), Billhartz et al.
patent: 2004/0010617 (2004-01-01), Akahane et al.
patent: 2005/0025059 (2005-02-01), Rajan et al.
patent: 2005/0128944 (2005-06-01), Zhang et al.
patent: 2005/0246347 (2005-11-01), Kobayashi
Gianni Di Caro, et al., “AntNet: Distributed Stigmergetic Control for Communications Networks,” 1998, Journal of Artificial Intelligence Research, pp. 317-365.
C. Hedrick, “Routing Information Protocol,” Jun. 1998, Network Working Group, Request for Comments: 1058, http://www.ietf.org/rfc/rfc1058.txt?number=1058, printed Jun. 5, 2003, 1-31.
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, printed Jun. 5, 2003, pp. 1-54.
J. Moy, “OSPF Version 2,” Jul. 1991, Network Working Group, Request for Comments: 1247, http://www.ietf.org/rfc/rfc1247.txt?number=1247, printed Jun. 5, 2003, pp. 1-177.
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 , pp. 1-107.
Marco Dorigo, et al., “The Ant Systems: Optimization by a colony of cooperating agents,” IEEE Transactions on Systems, Man, and Cybernetics-Part B, vol. 26, No. 1, 1996, pp. 1-26.
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,” Prentic Hall, 1992, pp. 365-369 and 393-400.
Andrew S. Tanenbaum, “Computer Networks,” Second Edition, Prentice Hall, 1996, pp. 346-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.
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.
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”, Al Access Foundation and Morgan Kaufmann Publishers, Journal of Artificial Intelligence Research 9, 1998, 49 pages.
Moon Bruce
Zhao Fuyong
Cisco Technology Inc.
Hickman Palermo & Truong & Becker LLP
Lee Andrew C.
LandOfFree
Method and apparatus for updating probabilistic network... 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 updating probabilistic network..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for updating probabilistic network... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2797494