Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2000-03-29
2004-08-17
Duong, Frank (Department: 2739)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S238100, C370S395200
Reexamination Certificate
active
06778535
ABSTRACT:
TECHNICAL FIELD
This invention relates to a technique for routing calls in a data communications network that employs the Private Network-to-Network Interface protocol.
BACKGROUND ART
Routing is the network process by which a call or other connection request proceeds (connects) from an origin to a destination. Concerns about routing lie at the heart of the architecture, design, and operation of any network. Current and future networks are rapidly evolving to carry a multitude of voice/ISDN services and packet data services over time division multiplexing (TDM), asynchronous transfer mode (ATM), and Internet protocol (IP). The long awaited data revolution is occurring, with the extremely rapid growth of data services such as frame relay, IP multimedia, and B-ISDN ATM services. Different routing methods have evolved for services supported by the TDM, ATM, and IP protocols. These protocols will continue to exist simultaneously and thus the need will continue to interwork in most networks. In other words, there has not been nor will there probably ever be a universal homogeneous network solution.
Among the various routing techniques used for ATM networks is the Private Network-Network Interface (PNNI) strategy adopted by the ATM Forum. The PNNI routing strategy provides interoperability among different vendor equipment and scaling to very large networks. Scaling is provided by a hierarchical peer group structure that allows the details of topology of a peer group to be flexibly hidden or revealed at various levels within the hierarchical structure. Peer group leaders represent the switches within a peer group for purposes of routing protocol exchanges at the next higher level. Border switches handle inter-level interactions at call setup. PNNI routing involves two components: a) a topology distribution protocol, and b) the path selection and crankback procedures. The topology distribution protocol floods information within a peer group. The peer group leader abstracts the information from within the peer group and floods the aggregated reachable address information. As the peer group leader learns information at the next higher level, it floods it to the lower level in the hierarchy, as appropriate. In this fashion, all switches learn the network reach and topology.
Traditionally, providers of telecommunications services have offered different grades or classes of service (COS) based on customer demand. To meet quality objectives for such different grades of service, telecommunications providers, such as AT&T, have employed Class-of-Service routing techniques in traditional circuit switched networks. U.S. Pat. No. 5,392,344, issued in the name of Gerald R. Ash et al., on Feb. 21, 1995, and assigned to AT&T (incorporated by reference herein) describes and claims such a Class-of-Service routing technique. Unfortunately, Class-of-Service routing does not exist with present day PNNI networks. Thus, there is a need for a PNNI Class-Of-Service routing technique.
BRIEF SUMMARY OF THE INVENTION
Briefly, the present method provides Class-of Service routing for a call or other connection request from an origin node to a destination node in a multi-link network employing the PNNI protocol. In accordance with a preferred embodiment, the method commences by determining the class-of-service and then searching for a shortest path between the origin and the destination. Upon finding such a path, a check is then made whether each link in the path has available bandwidth and available depth (i.e., bandwidth capacity not reserved for other services) for the class of service associated with the connection request. If each link has sufficient available bandwidth, then the call is routed from the origin to the destination via the shortest path. Otherwise, if any of the links in the path lack available bandwidth and depth for the class of service associated with the call, then a message, typically in the form of a crankback message, is sent back to the origin node, prompting the origin node to repeat the process of selecting a shortest path, and checking each link within that path for available bandwidth.
REFERENCES:
patent: 5392344 (1995-02-01), Ash et al.
patent: 6256309 (2001-07-01), Daley et al.
patent: 6304549 (2001-10-01), Srinivasan et al.
patent: 6363319 (2002-03-01), Hsu
patent: 6496480 (2002-12-01), Ash et al.
patent: 6542469 (2003-04-01), Kelley et al.
patent: 6600724 (2003-07-01), Cheng
patent: 0 883 307 (1998-12-01), None
patent: 1 037 495 (2000-09-01), None
patent: 0 883 307 (2000-12-01), None
patent: 1 037 495 (2003-01-01), None
Iwata, Atsushi; Izmailov, Rauf; Suzuki, Horoshi; Sengupta, Bhaskar; “PNNI Routing Algorithms for Multimedia ATM Internet” NEC Res & Develop. vol. 38, No. 1, Jan. 1997.
Ash Gerald; Chen, Jiayu; Fishman, Saul D:; Maunder, Anurag S. “Routing Evolution in Multi-Service Integrated Voice/Data Networks” ITC 161 P. Key and D. Smith (Editors), 1999 Elsevier Science B.V.
Ash Gerald Richard
Chen Jiayu
Fishman Saul Daniel
Maunder Anurag S.
Abelson Ronald
AT&T Corp.
Duong Frank
LandOfFree
PNNI-based multi-link shortest path Class-of Service routing... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with PNNI-based multi-link shortest path Class-of Service routing..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and PNNI-based multi-link shortest path Class-of Service routing... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3272265