International Business Machines Corporation

Lionel Denecheau

Denis Esteve

Ludovic Hazard

Stephen Sauer

Pascal Thubert

Patrick Sicsic

Frederic J Bauchot

Jean-Claude Dispensa

Christophe Fagiano

Jean Claude Dispensa

Jean-Pierre Marce

Christophe Jourdet

M Stephen Sauer

A method and system for managing traffic in a network. For each label switch path of at least two logical switch paths, logical paths are identified. Each label switch path begins at a first provider edge and ends at a second provider edge. Most recent data received from the first provider edge is transmitted to the second provider edge via a selected logical path. For each logical path, jitter, packet delay and packet loss are identified. For each logical path, calculating a path usage is calculated as a first function of the jitter, the packet delay, and the packet loss, wherein the path usage is a fraction denoting a highest percentage of total network traffic that each logical path can manage.

Load balancing traffic in a MPLS network

A method and system for managing traffic in a network. For each label switch path of at least two logical switch paths, logical paths are identified. Each label switch path begins at a first provider edge and ends at a second provider edge. Most recent data received from the first provider edge is transmitted to the second provider edge via a selected logical path.

A method and system for managing traffic in a network. Label switch paths are identified. Each label switch path begins at a first provider edge and ends at a second provider edge. For each label switch path, logical paths are identified. Most recent data received from the first provider edge is transmitted to the second provider edge via a selected logical path.

A method and computer system for dynamic error dampening in a node of a network system. Data traffic of the node is implemented in accordance with an Open Systems Interconnection (OSI) network management model that includes a Layer 1 physical link, a Layer 2 link including a data link in which primitive point-to-point data communication with neighboring nodes is enabled upon the Layer 1 physical link, and a Layer 3 link which is a network link operating on top of the Layer 2 link. Implementation of an error dampening process at the node includes deactivating the Layer 3 link of the node while monitoring data traffic over the Layer 2 link of the node. Deactivating the Layer 3 link of the node includes preventing the Layer 3 Link of the node from receiving incoming data traffic for routing to other nodes in the network system.

Dynamic error dampening in a network system

A system and associated method for dynamic error dampening in a node in a network system. The node collects statistics of data traffic transferred through the node. The node has a link error MIB storing Error ratio and Reliability of interface of the node. When the Error ratio is too high, the node starts running a Layer 2 protocol for monitoring data traffic and calculates Penalty of the node. When Penalty is higher than predefined Suppress Threshold, the node deactivates Layer 3 link while the Layer 2 protocol still monitors the interface. Once the Penalty becomes lower than Reuse Threshold, the node reactivates the Layer 3 link that had been previously deactivated. When Penalty becomes zero (0), the node clears the Error ratio and stops the Layer 2 protocol for monitoring the data traffic.

Best-path evaluation based on reliability of network interface layers

There is provided a method and system for inserting a second node into a virtual ring, wherein the virtual ring comprises at least a first node, wherein the first node comprises a virtual ring manager for the virtual ring and wherein the first node is linked with a database.

System and method of inserting a node into a virtual ring

A method for implementing adaptive load sharing to balance network traffic. The method begins by identifying all paths in a network between a first provider edge and a second provider edge. Next determining jitter, packet delay, and packet loss for each identified path in the network. Then utilizing the jitter, packet delay, and packet loss values, calculating a usage value for each path in the network. The usage value corresponds to the percentage of all network traffic which a specific path in the network may manage. When data is received by the first provider edge, the provider edge selects the appropriate path for the data. The appropriate path being the path with the largest usage value which is currently not managing a percentage of the network traffic that is equal to its usage value.

System and method for implementing adaptive load sharing to balance network traffic

In a network having nodes, N nodes are members of a virtual communications ring for multicast communication among the N Nodes, each of the N Nodes being associated with only an upstream and a downstream one of the other N nodes. One of the N nodes manages changes in ring membership, including requesting the others of the N nodes to participate in measuring distances to a N+1th, node responsive to receiving an insertion request message. The manager node inserts the N+1th node in the communications ring responsive to receiving replies, which includes inserting the N+1th node in a selected location between two selected ones of the N Nodes, such that the N nodes and the N+1th node are enabled to multicast messages around the ring. Due to the selected location of the N+1th node, communication distances for multicasted messages tend to be shorter than such distances that would otherwise occur.

System, computer program product and method in a node for optimizing the topology of a virtual ring based upon a TCP/IP network

A node within a network comprising a transport layer protocol for multicasting datagrams on a virtual ring. Each node on the virtual ring is logically connected to two neighbour nodes through virtual connections. A virtual ring datagram is sent to a downstream neighbour node on the virtual ring and a token is received. The virtual ring is identified and the token is forwarded to the downstream neighbour node. If the received datagram is a virtual ring datagram, the virtual ring is identified and the node originator of the received virtual ring datagram is checked. If the received virtual ring datagram has not been locally originated, data in the virtual ring datagram is processed and the virtual ring datagram is forwarded to the downstream neighbour node on the virtual ring. If the received virtual ring datagram has been locally originated, the virtual ring datagram is removed from the virtual ring.

System and method for communicating on a virtual ring in an internet protocol network

In a network having nodes, N nodes are members of a virtual communications ring for multicast communication among the N nodes, each of the N nodes being associated with only an upstream and a downstream one of the other N nodes. One of the N nodes manages changes in ring membership, including requesting the others of the N nodes to participate in measuring distances to a N+1th, node responsive to receiving an insertion request message. The manager node inserts the N+1th node in the communications ring responsive to receiving replies, which includes inserting the N+1th node in a selected location between two selected ones of the N nodes, such that the N nodes and the N+1th node are enabled to multicast messages around the ring. Due to the selected location of the N+1th node, communication distances for muticasted messages tend to be shorter than such distances that would otherwise occur.

System and method for optimizing the topology of a virtual ring based upon a TCP/IP network

A method of bandwidth management enabling to insure a guaranteed bandwidth to each station of transmission network comprising a plurality of stations () forming a logical ring wherein a token frame is circulating from station to station, each station being allowed to transmit a credit (c) of data bytes upon reception of the token frame wherein the credit is increased in proportion to a variable TRTT standing for Token Round Trip Time which is the time taken for the token frame to circulate around the logical ring since the preceding reception of the token frame by the station. The credit is increased in proportion of a variable CIR standing for Committed Information Rate which is the guaranteed transmission rate that the station can use to transmit data wherein the value of CIR is determined by a class of bandwidth which has been previously selected by the station upon the preceding reception of the token frame by the station.

Method of allocating bandwidth on request to the stations of a local area network

A method of bandwidth management for ensuring a guaranteed bandwidth to each station of a transmission network () comprising a plurality of stations (), forming a logical ring wherein one of the stations is the ring manager and wherein a token frame is circulating along the logical ring from station to station, each station being allowed to transmit data to other stations over the transmission network when it receives the token frame while holding the token during the time the station is transmitting data. A credit of data bytes allowed to be transmitted is allocated to each station upon reception of the token frame when an Utilization Rate based upon the number of data bytes sent by all stations since the preceding reception of the token frame is greater than a predetermined threshold.

Method of bandwidth management between the stations of a local area network

A method of bandwidth management over a transmission network comprising a plurality of stations forming a logical ring that circulates a token from station to station. Each station is allowed to transmit data to other stations over the transmission network when it receives the token. The station is allowed to transmit C bytes, where C is a credit. The credit increases in proportion to the time spent since the preceding reception of the token by the station.

Method of allocating bandwidth to the stations of a local area network

A collision-free protocol for transmitting frames between stations connected over a shared transmission medium such as an IEEE 802.3 Ethernet LAN. A logical ring is formed and a token is circulated among the connected stations part of the logical ring (not all connected stations are required to be part of the logical ring). Transmitting from any one station, part of the logical ring, is permitted only while holding the token, therefore preventing collisions. A collision-free protocol, over a standard Ethernet infrastructure, becomes feasible, yet remains compatible with the standard collision protocol, thus improving performances.

Growing community of inventors

La Colle sur Loup, France

Lionel Denecheau