Lucent Technologies Inc.

Alcatel-lucent USA Inc.

At+t Corp.

At&t Bell Laboratories

Alcatel Lucent

Agere Systems Inc.

Agere Systems Guardian Corp.

Bharat Tarachand Doshi

Subrahmanyam Dravida

Hong Jiang

Kiran Meghashyam Rege

Yung-Terng Wang

Walid Ahmed

Paramasiviah Harshavardhana

Ramesh Nagarajan

Kotikalapudi Sriram

Sanjiv Nanda

Yufei Wang

Steven S Katz

Arik Kashper

Pravin Kumar Johri

Muhammad A Qureshi

Enrique Hernandez-Valencia

Zbigniew M Dziong

P Harshavardhana

John H Baldwin

Peter David Magill

Pantelis Monogioudis

Kathleen S Meier-Hellstern

On-Ching Yue

George John Kustka

Thomas S Giuffrida

Curtis A Siller

Rajiv Kapoor

N Farber

Richard P Ejzak

Philip Andrew Treventi

Murali Krishnaswamy

Jon Anderson

James S Manchester

Helen Chu

Mahalakshmi Jairam

Richard Paul Ejzak

Arun N Netravali

Mooi Choo Chuah

Krishan Kumar Sabnani

Stefan Hunsche

Anil S Sawkar

Kazem Anaraky Sohraby

Christopher Flores

Anlu Yan

Behram H Bharucha

Behrokh Samadi

Muhammed Akber Qureshi

Norman Farber

Wassim A Matragi

Antonio Rodriguez-Moral

David S Einstein

Meenakshi Sharma

Narayan Raman

David Sugarmen

Stefano Baroni

Thomas S Guiffrida

Srinivasa Prasanna

Patamasiviah Harshavardhana

Notman Farber

A method for determining a restoration path for a new service in a mesh network involves selecting between candidate restoration paths corresponding to a primary path for the new service based on the shared-risk link groups (SRLGs) associated with links in the primary path. The method includes, for each of a plurality of candidate restoration paths associated with the primary path, (1) determining whether the primary path requires any additional restoration bandwidth to be reserved on any link of the restoration path based on whether, for each link of the restoration path, the primary path is SRLG-disjoint from each other primary path that is protected by that link, (2) generating a path cost for the restoration path, where the path cost is a function of whether any additional restoration bandwidth is required; and (3) selecting the restoration path for the new service based on the path cost.

Restoration path calculation considering shared-risk link groups in mesh networks

A method for representing, in a network data structure, a minimum amount of protection bandwidth required to be reserved on each link in a mesh network, to restore service upon failure of another node or link in the network. The method includes (1) receiving a request for a new service in the network, wherein the new service is represented by a service data structure having an identification of each link and transit node in a primary path for the new service, (2) determining, using the network and service data structures, whether the new service requires additional protection bandwidth to be reserved on any link in the network, and (3) updating the network data structure if any additional protection bandwidth is determined to be needed. In one implementation the network and service data structures are vectors and the steps of determining and updating involve vector operations between these structures.

Calculation, representation, and maintenance of sharing information in mesh networks

A method for determining primary and restoration paths for a new service in a mesh network involves (1) for each of a plurality of candidate primary/restoration path pairs for the new service, generating a path cost for each candidate pair, where the path cost for each restoration path is a function of the sum of the cost of links within the restoration path, and (2) selecting the primary and restoration paths for the new service from the plurality of candidate path pairs based on the path cost. If no sharing is possible, for low utilization links, the cost of links is a function of the administrative weight of the link, whereas for high utilization links, the link cost is a function of the inverse of the available capacity on the link. If sharing is possible, the cost is a function of the inverse of a sharing degree for the link.

Primary/restoration path calculation in mesh networks based on multiple-cost criteria

A technique for improving optical cross-connections comprises placing a switch in front of a number of processing units. So configured, the units are no longer dedicated to a specific link or signal. When necessary, a unit is connected/disconnected to one or more optical links by the switch to carry out any number of processing functions, such as regeneration, Raman pumping, dispersion equalization/compensation or performance monitoring. Because the units are no longer dedicated to specific links the cost of the cross-connections and the network it is a part of can be reduced.

Methods and devices for providing optical, serviced-enabled cross-connections

An architecture for quality-of-service (QoS) management creates a logical circuit-switched network within a packet network to support QoS-sensitive demands levied on the network. This QoS-managed network can serve to interwork, e.g., a PSTN with VoIP networks. The architecture can include a connection resource manager (CRM), which oversees bandwidth availability and demand admission/rejection on dynamically provisioned virtual trunk groups (VTGs) within the packet network, and a transport bandwidth controller (TBC). The VTGs serve to transport QoS-sensitive demands across the packet network. The TBC serves the CRM by providing an interface to routers and/or OAM systems of the packet network to size VTGs to meet QoS requirements. Media switches located at the packet network borders serve to mux/demux the demands into/from VTGs. CRMs and TBCs can be implemented as centralized, distributed, or hierarchical, and flat and aggregated variants of the architecture are supported. VTGs can be implemented using MPLS LSPs, VPNs, or source-based routing.

Network quality of service management

A simplified data link protocol which may be implemented in a very high-speed transmission system, e.g., SONET, processes a datagram received from an IP facility according to QoS considerations and scrambles a datagram before it is again scrambled by a transmission system, e.g., a SONET transmitter, to ensure that the pattern of a user's data does not match the transmission scrambling pattern. The data link protocol scrambler also employs a novel synchronization scheme. We also use a pointer system which identifies the location of a datagram in a frame to eliminate flags and the need to process user data to ensure that it does not contain and a boundary flag.

Simplified data link protocol processor

A new protocol layer is provided as part of a protocol stack associated with a packet-based multiaccess mobile communications system. The protocol layer is preferably located above a medium access control (MAC) protocol layer and a physical protocol layer of the system and below a transport/network protocol layer. Such a subnetwork protocol layer provides, inter alia, the communications system with various mobility management functions, for example, tracking mobile user stations throughout the system, mobile station access to the system, and connection/call continuity within the system. The subnetwork protocol layer of the invention also performs packet routing functions associated with the system. Routing can be accomplished in many ways, for example, via source routing, connectionless routing, or tunneling. Further, the new protocol layer of the invention is preferably located above a data link layer with respect to the protocol stack associated with communications between network nodes.

Subnetwork layer for a multimedia mobile network

An extension to a connection setup protocol for establishment of a restoration path for a service in a mesh network involves, at a transit node along the restoration path, the steps of (1) receiving a service data structure having an identification of each link and transit node in a primary path for the service, and (2) determining whether to reserve additional protection bandwidth on an outgoing link incident to the transit node using the service data structure, wherein the outgoing link is part of the restoration path. In one or more embodiments, the service data structure includes identification of the service, identification of the outgoing link, and bandwidth of the service. In some cases, the extension involves reserving the additional protection bandwidth on the outgoing link, if the transit node determines that the protection bandwidth is required, based upon knowledge of the protection bandwidth already reserved on the outgoing link.

Connection set-up extension for restoration path establishment in mesh networks

Multiple requests to set up and/or tear down connections in a node of a communication network (or multiple failure notifications) are bundled together for transmission within the network. In an 'inter-nodal' embodiment, multiple connection requests/failure notifications are bundled together as a single message for transmission between pairs of nodes in the network. In an 'intra-nodal' embodiment, multiple connection requests/failure notifications received at one component of a node in the network are bundled together as a single group for forwarding to another component within the same node for implementation. In either case, the bundling of multiple connection requests/failure notifications can reduce the total amount of time required to communicate and implement the desired connection requests/restoration processing. This reduction in time can be critical to the ability of a network to satisfy requirements associated with restoration processing following a network fault.

Bundling messages in communication networks

Units of traffic are routed between nodes in a network on corresponding sets of trunks, such that the traffic is balanced between disjoint paths. A restoration process for the traffic is implemented using service layer or transport layer switching. In a first embodiment, first and second nodes are connected by first and second sets of trunks, with each of the trunks in a given set of trunks supporting a designated portion of a given one of the units of traffic. The units of traffic are then routed such that a first half of a given one of the units of traffic is routed on a first one of the trunks in a given one of the sets of trunks, and a second half of the given unit is routed on a second one of the trunks in the given set of trunks. In other embodiments, the first and second nodes are connected by first and second sets of trunks so as to form a four-trunk ring, with each of the first and second sets of trunks including a primary trunk and a backup trunk. A given one of the units of traffic is then routed on either an upper or lower portion of the ring. The four trunk ring may be in the form of an IP/optical hybrid ring, in which case the restoration process is implemented using service layer switching, or a SONET/optical ring, in which case the restoration process is implemented using transport layer switching.

Methods and apparatus for protection against network failures

An addressing scheme for a packet-based multiaccess mobile communications system, which includes a plurality of mobile user stations and a plurality of network nodes, is provided. In such addressing scheme, each mobile station is assigned an address which is a combination (preferably, a concatenation) of a unique identifier of a network node with which the mobile station is currently associated and an identifier of the mobile station. The network node identifiers may be uniquely assigned by a network administrator, while the identifiers of the mobile stations may, for example, be set to a universal MAC address assigned to the station. The address may also include a port identifier which indicates the particular application flow associated with the accompanying packets. Similarly, each network node is assigned an address which is a combination (preferably, a concatenation) of its network node identifier and, preferably, an interface identifier. The address may also include a port identifier.

Addressing scheme for a multimedia mobile network

In an IP addressing aspect of the invention, a method for use in facilitating transfer of packets in an Internet Protocol (IP) based communications system, wherein the communications system includes a plurality of network nodes and a plurality of mobile user stations, comprises the steps of: (i) inserting an address option field in a packet header of a packet to be transferred in the communications system, the address option field including supplemental address related data for facilitating transfer of packets in the communications system; and processing the packet within at least one of a network node and a mobile user station in the communications system in accordance with the supplemental address related data in the address option field of the packet header. The address option field may comprise an address type field, an address length field and an address data field. Various address related data may be included in the address data field to facilitate transfer of packets in an IP-based communications system.

Address option for use in an internet protocol-based multimedia mobile network

Various methodologies and related apparatus associated with mobility management issues within a packet-based multiaccess mobile communications system, which includes a plurality of mobile user stations and a plurality of network nodes, are provided. Location management techniques include tracking and/or locating mobile stations within the system. The invention makes use of home and visiting location registers in which information such as mobile station addresses and/or host names associated with mobile stations are stored. Mobile access methodologies include a complete mobile access method and a direct mobile access method. The former allows a mobile station to preferably include a unique address in the packets being transmitted, while the latter allows the station to merely use the host name of the destination station. The invention also includes various in-call mobility management techniques, including handoffs, which make use of the concept of an anchor.

Mobility management for a multimedia mobile network

In a mobility management aspect of the invention, several unique mobility management control messages are defined for use in performing various mobility management functions in the communications system with respect to the mobile user stations and network nodes. These messages may comprise: (i) a Location Update Message (LUM); (ii) a Location Confirm Message (LCM); (iii) a Location Query Message (LQM); (vi) a Location Reply Message (LRM); (v) a Registration Message (RM); and (vi) a Registration Reply Message. One or more of these messages are used in the IP-based system to perform mobility management functions such as location management, mobile access and in-call mobility management.

Mobility management techniques for use in an internet protocol-based multimedia mobile network

An Internet Protocol (IP)-based network incorporates an application level switching server and a number of packet endpoints. A packet endpoint multiplexes application sessions destined for different packet endpoints into one multiplexed session that is terminated with the application level switching server. The latter extracts each application session (or packets associated therewith) and repackages, or switches, them into other multiplexed sessions such that at least two switched packets are transmitted to different packet endpoints. The multiplexed sessions utilize either RTP/UDP/IP or UDP/IP encapsulation.

Application-level switching server for internet protocol (IP) based networks

Growing community of inventors

Holmdel, NJ, United States of America

Bharat Tarachand Doshi