Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2011-03-08
2011-03-08
Ahmed, Salman (Department: 2476)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S252000, C370S352000, C370S392000, C370S410000, C709S238000, C709S240000, C709S242000
Reexamination Certificate
active
07903650
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: 5805072 (1998-09-01), Kakemizu
patent: 5933425 (1999-08-01), Iwata
patent: 6084858 (2000-07-01), Matthews et al.
patent: 6377551 (2002-04-01), Luo et al.
patent: 6427114 (2002-07-01), Olsson
patent: 6584093 (2003-06-01), Salama et al.
patent: 6594268 (2003-07-01), Aukia et al.
patent: 6631122 (2003-10-01), Arunachalam et al.
patent: 6738387 (2004-05-01), Lin et al.
patent: 6744774 (2004-06-01), Sharma
patent: 6768739 (2004-07-01), Kobayashi et al.
patent: 6813272 (2004-11-01), An et al.
patent: 6910024 (2005-06-01), Krishnamurthy et al.
patent: 6944675 (2005-09-01), Fujita
patent: 6973057 (2005-12-01), Forslow
patent: 7047316 (2006-05-01), Iwata et al.
patent: 7146430 (2006-12-01), Kobayashi
patent: 7158497 (2007-01-01), Li et al.
patent: 7257563 (2007-08-01), Shmulevich et al.
patent: 7350379 (2008-04-01), Ueda et al.
patent: 7369766 (2008-05-01), Bannister et al.
patent: 7382731 (2008-06-01), Zhao et al.
patent: 7406539 (2008-07-01), Baldonado et al.
patent: 7496680 (2009-02-01), Canright
patent: 7590224 (2009-09-01), Gorin et al.
patent: 2001/0034853 (2001-10-01), Takatama et al.
patent: 2003/0026268 (2003-02-01), Navas
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 et al.
patent: 2004/0010617 (2004-01-01), Akahane et al.
patent: 2004/0240414 (2004-12-01), Fan 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
Murphy, S., et al., “OSPF with Digital Signature,” Jun. 1997, Network Working Group, Request for Comments: 2154, http://www.ietf.org/rfc/rfc.2154.txt?number=2154, data retrieved Dec. 8, 2003, pp. 1-28.
Mills, David L., “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.
Dorigo, Marco, 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.
Zhao, Felix Cho, Cisco Systems, Inc., “ANTD: An Adaptive, Deterministic Ant Routing Algorithm,” 2003, Document No. EDCS-255496, pp. 1-38.
Bonabeau, Eric, et al., “Swarm Smarts,” Scientific American, Mar. 2000, pp. 72-79.
Bertsekas, Dimitri, et al., “Data Networks,” Prentic Hall, 1992, pp. 365-369 and 393-400.
Tanenbaum, Andrew S., “Computer Networks,” Second Edition, Prentice Hall, 1996, pp. 345-365.
Kalos, Malvin H., et al., “Monte Carol Methods, vol. I: Basics,” 1986, pp. 1-3 and 129-140.
Bellman, Richard, “Dynamic Programming,” Princeton University Press, Princeton, NJ, 1957, 362 pages.
Davie, Bruce, et al., “MPLS Technology and Applications,” Morgan Kaufamann Publishers, 2000, 301 pages.
Crawley, E., 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.
Apostolopoulus, G., 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.
Moy, J., “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.
Chen, Shigang, et al., “Distributed Quality of Service Routing in High-Speed Networks Based on Selective Routing,” IEEE, 1998, pp. 80-89.
Shin, Kang G., et al., “Distributed Route Selection for Establishing Real-Time Channels,” Aug. 30, 1999, pp. 1-29.
Salama, Hussein F., et al., “A Distributed Algorithm for Delay-Constrained Unicast Routing,” IEEE, 1997, 8 pages.
Caro, Gianni Di, et al., “AntNet: Distributed Stigmergetic Control for Communications Networks,” 1998, Journal of Artificial Intelligence Research, pp. 317-365.
Hedrick, C., “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, pp. 1-31.
Rekhter, Y., et al., “A Border Gateway Protocol 4 (BGP-4),” Mar. 1995, Network Working Group, Request for Comments: 1771, http://www.ietf.org/rfc/rfcl771.txt?number=1771, printed Jun. 5, 2003, pp. 1-54.
Moy, J., “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.
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.
Schoonderwoerd, Ruud, et al., “Ant-Based Load Balancing in Telecommunications Networks,” Adaptive Behavior, vol. 5, No. 2, ISSN: 1059-7123, Fall 1996, pp. 1-26.
Chen, Shigang, et al., “An Overview of Quality-of-Service Routing for the Next Generation High Speed Networks: Problems and Solutions,” this paper appears in Network, IEEE, Publication Date: Nov./Dec. 1998, vol. 12, Issue: 6, ISSN: 0890-8044, pp. 1-19.
Moon Bruce
Zhao Fuyong
Ahmed Salman
Cisco Technology Inc.
Haliyur Venkatesh
Hickman Palermo & Truong & Becker LLP
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-2697835