At&t Intellectual Property I, L.p.

At+t Corp.

Future Wei Technologies, Inc.

At&t Labs, Inc.

Guangzhi Li

Dongmei Wang

Robert Duncan Doverspike

Angela L Chiu

Charles Robert Kalmanek, Jr

Jennifer Yates

Dahai Xu

Monica Naukam Gerhardstein

John Lester Strand

Dah-Min David Hwang

Chris Dailey

Kadangode K Ramakrishnan

Xiang Liu

Albert Gordon Greenberg

Gagan Choudhury

Jeffrey Erman

Rakesh Sinha

Jiasi Chen

Yici Guo

Panagiotis Sebos

Jian Li

Aman M Shaikh

John Gregory Klincewicz

Moshe Segal

Promod Kumar Bhagat

David Frederick Lynch

Charles Robert Kalmanek Jr

David Matthews

Joel M Gottlieb

Joel M Gottleib

Charles Robert Kalman

Disclosed herein are systems, methods, and computer readable media for modifying IP backbone link weights such that multicast traffic and unicast traffic will not travel on a same path between nodes. The method comprises assigning link weights to nodes within an IP backbone such that multicast forwarding paths and unicast forwarding paths are failure disjoint, and delivering undelivered multicast packets using IP unicast encapsulation to the loopback address of next hop router on a multicast tree upon link/interface failure.

System and method for restoration in a multimedia IP network

Aspects of the subject disclosure may include, for example, a broadcast services platform includes a memory that stores operational instructions. A processor executes the operational instructions to: receive user data, the user data including a list of users and performance metric data corresponding to individual ones of the users; sort the list of the users in order of the performance metric data to generate a sorted list of the users; partition the sorted list of the users to generate a plurality of user groups; and generate network resource allocation data that allocates network resources to provide broadcast services to the users. Other embodiments are disclosed.

Broadcast services platform and methods for use therewith

A method for constructing an optical network includes connecting each of a plurality of nodes in an optical network to an optical switching central node via a set of optical superchannels, wherein each of the optical superchannels includes of a set of subchannels and has a bounded data rate, and wherein the optical switching central node is configured to perform wavelength selective optical switching among the superchannels on a subchannel basis without spectrum contention. Moreover, rearrangement (or 'permutation') of the subchannels of the superchannels connected to the n sites may be performed to minimize the total spectral bandwidth used by the superchannels.

Efficient network utilization using optically switched superchannels

The disclosure relates to technology for constructing an optical network. A central node is selected among a plurality of nodes in the optical network, and each of the nodes is connected to the central node via a set of superchannels, wherein each of the superchannels includes sub-carriers and has a same data rate. The network resources between the central node and each of the plurality of nodes are managed by dynamically allocating the sub-carrier bandwidths to support communication among the plurality of nodes via the superchannels, and wavelength selective switching is performed among the superchannels at the central node.

Method and apparatus for efficient network utilization using superchannels

A method and apparatus for providing a route recommendation are disclosed. For example, the method obtains network topology information, wherein the network topology information comprises a plurality of underlying subnetwork types for a network. The method creates a cost model for the network, and receives a request from a user for a connection to be supported by the network. The method provides the route recommendation for supporting the connection by applying the cost model.

Method and apparatus for providing a route recommendation

A method of providing routes through heterogeneous subsystems in an optical network is disclosed, which includes generating, using a processing device, a reachability matrix based on subnetwork information; and generating, using the processing device, a topology associated with the optical network using the reachability matrix. The method also includes determining, using the processing device, a shortest path through the optical network using the reachability matrix and a cost model graph; and displaying, using a graphical user interface, subsystems associated with the shortest path, regeneration locations associated with the shortest path, wavelengths associated with the shortest path, the topology, and the shortest path. Corresponding apparatus and computer-readable storage media are also disclosed.

Reachability matrices spanning multiple domains in an optical network

Method and apparatus for providing a control plane across multiple optical network domains is described. In one example, topology and resource discovery is employed in a transport network having a plurality of control domains. Topology information for each of the control domains is summarized to produce summarized topology information. The summarized topology information for each of the control domains is exchanged among the control domains. At each of the control domains, the summarized topology information of each of the control domains is combined to produce combined topology information. The combined topology information is passed among network elements within each of the control domains using an intra-domain routing protocol.

Method and apparatus for providing a control plane across multiple optical network domains

Certain exemplary embodiments provide a method comprising: in a network at a node located on a label switched path: selecting a backup path to respond to a failure; and for each link along the backup path, reserving a backup bandwidth, wherein the backup bandwidth is sufficient to reroute traffic around the failure.

Bandwidth management for MPLS fast rerouting

In a tool for use by network planners in designing metropolitan IP aggregation networks, several optimization methods are integrated into a tool. A k-means algorithm is used to choose access packet switch locations. A dual-k-means algorithm is used to choose the backbone switch locations. Each access packet switch is dual homed to two backbone packet switches using two diverse paths. The diverse path configuration is found using a maxflow-mincost algorithm on a modified fiber map topology. The link topology connecting the backbone packet switches to each other is designed using a heuristic that creates a skeleton network topology and then adds express links one by one, testing each link to assure reduced overall network cost. The resulting network topology is then improved upon by local search.

Metropolitan IP aggregation network design tool

Systems and methods are described that provide a distributed restoration signaling protocol for shared mesh restoration with standbys for transparent optical networks.

Standby restoration signaling for optical networks

Growing community of inventors

Kearny, NJ, United States of America

Guangzhi Li