Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2007-03-27
2007-03-27
Nguyen, Chau (Department: 2616)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C709S241000
Reexamination Certificate
active
10186761
ABSTRACT:
A system for, and method of, configuring border gateway selection for transit traffic flows in a computer network. In one embodiment, the system includes: (1) a border gateway modeler that builds a model of cooperating border gateways, the model including capacities of the border gateways and (2) a traffic flow optimizer, associated with the border gateway modeler, that initially assigns traffic to the border gateways in accordance with a generalized assignment problem and subsequently reassigns the traffic to the border gateways based on cost until the capacities are respected.
REFERENCES:
patent: 2002/0141343 (2002-10-01), Bays
patent: 2006/0075136 (2006-04-01), Iwata
L. Gao & J. Rexford, “Stable Internet Routing Without Global Coordination” Proceedings of ACM Sigmetrics, Jun. 2000, pp. 307-317.
R. Govindan & A. Reddy, “An Analysis of Internet Inter-domain Topology and Route Stability” INFOCOM '97, Apr. 1997, pp. 850-857.
B. Fortz & M. Thorup, “Internet Traffic Engineering by Optimizing OSPF Weights” Proceedings of IEEE INFOCOM 2000, pp. 519-528.
Y. Rekhter & T. Li, “A Border Gateway Protocol 4” Internet-Draft (RFC1771), Feb. 1998, 57 pages.
J.W. Stewart III, “BGP4: Inter-Domain Routing in the Internet” Addison-Wesley, 1999, pp. 57-58.
C. Labovitz, G.R. Malan & F. Jahanian, “Internet Routing Instability” in Proceedings of ACM SIGCOMM, 1997, 20 pages.
J.H. Lin & J.S. Vitter, “Approximations with Minimum Packing Constraint Violation” Proceedings of the 24th Annual ACM Symposium on the Theory of Computation, Victoria, Canada, May 1992, pp. 771-782.
D.B. Shmoys & E. Tardos, “An Approximation Algorithm for the Generalized Assignment Problem” Mathematical Programming A, vol. 62, pp. 461-474, 1993.
J.K. Lenstra, D.B. Shmoys & E. Tardos, “Approximation Algorithms for Scheduling Unrelated Parallel Machines” Mathematical Programming A, vol. 46, pp. 259-271, 1990.
Bressoud Thomas C.
Rastogi Rajeev
Smith Mark A.
Lucent Technologies - Inc.
Nguyen Chau
Rose Kerri M.
LandOfFree
System and method for optimally configuring border gateway... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for optimally configuring border gateway..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for optimally configuring border gateway... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3773415