Fujitsu Corporation

Edward Alton Harbin

Snigdho Chandra Bardalai

Li Mo

Nimer Yaseen

Kyl Wayne Scott

Abed Mohd Jaber

Shantnu Sharma

Bharathi B Devi

George E Bucklin

Nikhil Kanodia

Edward T Sullivan

Sanjay Gera

Francois G Moore

David W Wynn

David W Terwilliger

Daniel Louis Miller

Albert V Smith, Jr

Michael Joseph Mezeul

Ladan S Pickering

Kai Chung Ko

A method for multicasting data packets is provided. The method includes preparing multiple point to point connections between a root node and multiple destination nodes to establish point to multipoint connections. The method also includes receiving, at an intermediate node which is operatively connected to the root node and a plurality of the destination nodes, a data packet from the root node. In addition, the method includes determining whether the received data packet is a multicast data packet and generating a plurality of the data packets by copying the received data packet if the received data packet is a multicast data packet. Furthermore, the method includes forwarding the copied data packets to a plurality of the destination nodes.

Method and system for multicasting data packets in an MPLS network

Routing around intra-network element (intra-NE) disconnectivity is described. The routing is performed on one or more network element (NEs) of a channelized network. The routing involves performing a shortest-path-search (SPS) to determine a shortest non-disconnected path from a single path-ingress edge to a single path-egress edge. The SPS includes classifying a set of endpoints of each NE in the channelized network as an equivalence class of endpoints, classifying a set of paths-so-far between each NE in the channelized network as an equivalence class of paths-so-far, grouping each equivalence class of paths-so-far by the equivalence class of endpoints that includes a terminal endpoint of the path-so-far that is furthest from the single path-ingress edge, and exploring separately each equivalence class of edges that are incident to each NE when determining the shortest non-disconnected path from the single path-ingress edge to the single path-egress edge.

Routing around intra-network element disconnectivity

A method perfomed by an ingress card includes receiving a packet with a destination identifier, and determining an aggregated link associated with the destination identifier that includes multiple egress ports. The method further includes determining a destination port from the egress ports of the aggregated link, and communicating the packet to the destination port.

Forwarding packets to aggregated links using distributed ingress card processing

According to one embodiment of the invention, a method for multicasting data packets is provided. The method includes determining that a data packet is to be multicast from an intermediate node to a plurality of destination nodes in a branch of a point-to-multipoint MPLS connection tree. The intermediate node has a plurality of connection interfaces. The method also includes establishing only one MPLS tunnel in response to the determination. The only one MPLS tunnel is for carrying the data packet to be multicast and established between a node and the intermediate node. The method also includes connecting each destination node to the intermediate node through a particular one of the connection interfaces. The method also includes receiving the data packet from the node at the intermediate node through the only one MPLS tunnel. The method also includes forwarding the data packet to the plurality of destination nodes through the connection interfaces identified in a multicast table.

A method and system for providing an internal topology of a node within a network includes determining asymmetric connections between traffic bearing components in a network node. An intranode connectivity is determined between the traffic bearing components based on the asymmetric connections. A model of the node indicative of the intranode connectivity is distributed to a disparate node in a network with a node. The model is used at a disparate node in determining a routing path through the network.

Method and system for modeling and advertising asymmetric topology of a node in a transport network

A transport network includes a flexible topology for internally defining transport elements. The transport elements each include a port group having a plurality of geographically distributed ports from the transport network. Point-to-multipoint connectivity is defined between the ports in a port group. An identifier represents the port group as a single element to internal and/or external elements for protocol exchanges.

Transport network and method

A method and system for routing an externally generated message in a network includes receiving at an ingress port of a network a message from an external network. The message includes Internet protocol (IP) source and destination addresses and message data. The IP source and destination addresses are translated to internal addresses that are non-forwardable in the external network. The message data is routed in the network based on the internal addresses.

Growing community of inventors

Dallas, TX, United States of America

Edward Alton Harbin