Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2005-10-03
2010-02-02
Yao, Kwang B (Department: 2473)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S238000
Reexamination Certificate
active
07656886
ABSTRACT:
A method and system for computing the maximum amount of admissible ingress and egress traffic of each edge router of the MPLS core network is presented. As long as the ingress and egress traffic amounts are below the admissible amount limit, traffic routes through any link in the network will never exceeds the link capacity. A calculation scheme and a load-distribution scheme make an Internet MPLS backbone network non-blocking. The output of the route computation algorithm includes a set of paths for any source-destination pair and the load distribution ratios among the paths. The routing algorithm and the associated distribution scheme will determine how to balance the loads that meet the distribution requirements specified by the ratios computed from the route algorithm. This greatly simplifies call admission control and allows hard QoS to be supported in a large scale and cross domains in the Internet.
REFERENCES:
patent: 6804199 (2004-10-01), Kelly et al.
patent: 2002/0143929 (2002-10-01), Maltz et al.
patent: 2003/0068975 (2003-04-01), Qiao et al.
patent: 2003/0072267 (2003-04-01), Lohtia et al.
patent: 2003/0072327 (2003-04-01), Fodor et al.
patent: 2003/0118024 (2003-06-01), Lee et al.
patent: 2003/0118027 (2003-06-01), Lee et al.
patent: 2003/0161268 (2003-08-01), Larsson et al.
patent: 2003/0174688 (2003-09-01), Ahmed et al.
patent: 2003/0185209 (2003-10-01), Lee
patent: 2003/0198235 (2003-10-01), Weldon et al.
patent: 2003/0202465 (2003-10-01), Cain
patent: 2003/0202468 (2003-10-01), Cain et al.
patent: 2003/0202469 (2003-10-01), Cain
patent: 2003/0202476 (2003-10-01), Billhartz et al.
patent: 2003/0204587 (2003-10-01), Billhartz
patent: 2003/0204616 (2003-10-01), Billhartz et al.
patent: 2003/0204619 (2003-10-01), Bays
patent: 2003/0204623 (2003-10-01), Cain
patent: 2003/0204625 (2003-10-01), Cain
patent: 2003/0229613 (2003-12-01), Zargham et al.
patent: 2004/0022203 (2004-02-01), Michelson et al.
patent: 2004/0022223 (2004-02-01), Billhartz
patent: 2004/0022224 (2004-02-01), Billhartz
patent: 2004/0029553 (2004-02-01), Cain
patent: 2004/0037294 (2004-02-01), Yamaguchi et al.
patent: 2004/0042404 (2004-03-01), Ravindran et al.
patent: 2004/0042473 (2004-03-01), Park et al.
patent: 2004/0057724 (2004-03-01), Oksanen et al.
patent: 2004/0067754 (2004-04-01), Gao et al.
patent: 2004/0071089 (2004-04-01), Bauer et al.
patent: 2004/0071468 (2004-04-01), Doh et al.
patent: 2004/0073701 (2004-04-01), Huang et al.
patent: 2004/0081197 (2004-04-01), Liu
patent: 2004/0114569 (2004-06-01), Naden et al.
patent: 2004/0136324 (2004-07-01), Steinberg et al.
patent: 2004/0143842 (2004-07-01), Joshi
patent: 2004/0184483 (2004-09-01), Okamura et al.
patent: 2004/0190526 (2004-09-01), Kumar et al.
patent: 2004/0192204 (2004-09-01), Periyalwar et al.
patent: 2004/0196787 (2004-10-01), Wang et al.
patent: 2004/0196860 (2004-10-01), Gao et al.
patent: 2004/0203820 (2004-10-01), Billhartz
patent: 2004/0213172 (2004-10-01), Myers et al.
patent: 2004/0213198 (2004-10-01), Mahmood et al.
patent: 2004/0213255 (2004-10-01), Brinkerhoff et al.
patent: 2004/0214576 (2004-10-01), Myers et al.
patent: 2004/0215817 (2004-10-01), Qing et al.
patent: 2004/0221154 (2004-11-01), Aggarwal
patent: 2004/0228304 (2004-11-01), Riedel et al.
patent: 2004/0228323 (2004-11-01), Acharya et al.
patent: 2004/0233850 (2004-11-01), Randriamasy et al.
patent: 2004/0233907 (2004-11-01), Hundscheidt
patent: 2004/0246900 (2004-12-01), Zhang et al.
patent: 2004/0246901 (2004-12-01), Zhang et al.
patent: 2004/0264372 (2004-12-01), Huang
patent: 2004/0264466 (2004-12-01), Huang
patent: 2005/0114541 (2005-05-01), Ghetie et al.
patent: 2007/0115814 (2007-05-01), Gerla et al.
Applegate et al., “Making Intra-Domain Routing Robust to Changing and Uncertain Traffic Demands: Understanding Fundamental Tradeoffs”, Proc. ACM 2003.
Blake et. al., “An Architecture for Differentiated Services,” RFC 2475, Dec. 1998.
Cetinkaya et al., “Egress Admission Control,” Proc. IEEE Infocom 2000, Mar. 2000.
Chu et al., “Maximizing EF-Class Traffic in DiffServ Networks,” to be published.
Duffield et al., “A Flexible Model for Resource Management in Virtual Private Networks,” in ACM Sigcomm, San Diego, California, USA, Aug. 1999.
Erlebach et al., “Optimal Bandwidth Reservation in Hose-Model VPNs with Multi-Path Routing”, IEEE Infocom 2004.
Giordano et. al.,“Advanced QoS provisioning in IP networks: The European Premium IP Projects,” IEEE Communication Magazine, Jan 2003.
Gupta et al., “Provisioning a Virtual Private Network: A Network Design Problem for Multicommodity Flow”, Proc. ACM 2001.
Ivars et al., “PBAC: Probe-Based Admission Control,” Proc. QoFIS 2001,2001, pp. 97-109.
J. Chu et al., “Fast Algorithms for Hose-Model VPNs Construction” to be published.
James R. Leu et al., “Label Aggregation Technique for LDP,” www.draft-leu-mpls-ldp-label-aggregation-00.txt, Internet draft, IETF, Jul. 2000.
Jian Chu et al., “Routing and Restoration in Networks with Hose-Model Traffic Patterns,” to be published.
Jüttner et al., “On Bandwidth Efficiency of the Hose Resource Management Model in Virtual Private Networks,” In IEEE Infocom, San Francisco, Apr. 2003.
Knightly et al., “Admission Control for Statistical QoS: Theory and Practice,” IEEE Network, vol. 13, No. 2, Mar. 1999, pp. 20-29.
Kumar et al. “Algorithms for Provisioning Virtual Private Networks in the Hose Model,” in ACM Sigcomm, Cambridge, Massachusetts, USA, Aug. 2001.
Rosen & Rekhter, BGP/MPLS VPNs, memo, Mar. 1999.
Zhang et al., “Decoupling QoS Control from Core Routers: A Novel Bandwidth Broker Architecture for Scalable Support of Guaranteed Services,” Proc. ACM Sigcomm, Aug./Sep. 2000.
Apostolopoulos et al., “QoS Routing Mechanism and OSPF Extensions,” RCF 2676, Network Working Group, Aug. 1999.
Fonz et al., “Internet Traffic Engineering by Optimizing OSPF Weights,” Proc. IEEE INFOCOM, Mar. 2000.
Kodialam et al., “A Simple Traffic Independent Scheme for Enabling Restoration Oblivious Routing of Resilient Connections,” IEEE INFOCOM, 2004.
Rosen et al., “Multiprotocol Label Switching Architecture,” RCF 3031, Network Working Group, Jan. 2001.
Chu Jian
Lea Chin-Tau
Bokhari Syed
Yao Kwang B
LandOfFree
Non-blocking internet backbone 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 Non-blocking internet backbone network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Non-blocking internet backbone network will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4214956