Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A Universal Virtual Private Network (VPN) apparatus, and method and system for using universal VPNs. The Universal VPNs include a first Internet Protocol (IP) switch connected to a second IP switch by a public telecommunications medium. Each IP switch has an interswitch port and access ports to which hosts are directly connected. A virtual private line services (VPLS) packet received by the first IP switch from a source host directly connected to an access port of the first IP switch is routed by the first IP switch to destination hosts of a universal VPN attached to access ports of the first and second IP switches via respective transmission paths that use a VPLS transmission protocol throughout each respective transmission path. The VPLS packet includes a header appended to an IP frame including a packet payload including a first message, the header including a VPN label identifying the universal VPN.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: Method for processing content of an Internet Protocol (IP) packet and method for processing a full broadcast IP packet. Processing content of an IP packet includes: extracting IP source and destination addresses and payload from the IP packet; and generating an IP frame encapsulating the IP source and destination addresses and the payload between a preamble field and an error checking field. Processing a full broadcast IP packet includes: receiving the full broadcast IP packet including an IP source address and a full broadcast IP destination address; ascertaining a closest matching IP address and a subnet thereof in a switching table of an IP switch; replacing the full broadcast IP destination address in the IP packet with a subnetted source address generated by applying the subnet mask to the IP source address; transmitting the IP packet to all IP addresses in the switching table within the subnetted source address.

Abstract: Internet Protocol (IP) switch and method for switching an IP frame to an IP destination address. The IP switch includes access ports, interswitch ports, and a switching table. Each access port is connected to a corresponding host in a LAN. The interswitch ports are configured to be statically connected to routers within the Internet in connections that cannot be overwritten by dynamic learning. The switching table includes entries, each entry having an IP address, a port identifier, and a routing protocol internal metric indicative of confidence in the entry. The method for switching the IP frame includes: receiving the IP frame, reading the IP destination address from the IP frame, ascertaining a matching IP address in the switching table that matches the IP destination address, directing the IP frame to a specific port, transmitting the IP frame from the specific port to the IP destination address.

Abstract: Methods for modifying a switching table of an Internet Protocol (IP) switch. The methods include: receiving a dynamic host configuration protocol (DHCP) option 43 request from a host of a LAN at an access port of the IP switch; transmitting the request to a DHCP server; intercepting a DHCP response for the request from the DHCP server; extracting an IP address from the intercepted DHCP response; and adding the extracted IP address to a corresponding entry (specific to the access port) of a switching table of the IP switch. The methods include: receiving an IP frame at an access port of the IP switch; reading an IP source address from the IP frame; and in the switching table either: creating a new entry including the IP source address and its associated port identifier or changing an existing entry based on the IP source address and the access port.

Abstract: 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.

Abstract: A method and system for managing traffic between a first provider edge and a second provider edge in a network. The network includes logical paths between the first provider edge and the second provider edge. For each logical path, jitter, packet delay, and packet loss are identified. For each logical path, a path usage is calculated as a function of the identified jitter, packet delay, and packet loss. Most recent data received by the first provider edge is transmitted to the second provider edge via a selected logical path that has a highest path usage for which transmitting the received most recent data does not result in the selected logical path managing a higher percentage of network traffic than is dictated by the highest usage value for the selected logical path.

Abstract: 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.

Abstract: Method for processing content of an Internet Protocol (IP) packet and method for processing a full broadcast IP packet. Processing content of an IP packet includes: extracting IP source and destination addresses and payload from the IP packet; and generating an IP frame encapsulating the IP source and destination addresses and the payload between a preamble field and an error checking field. Processing a full broadcast IP packet includes: receiving the full broadcast IP packet including an IP source address and a full broadcast IP destination address; ascertaining a closest matching IP address and a subnet thereof in a switching table of an IP switch; replacing the full broadcast IP destination address in the IP packet with a subnetted source address generated by applying the subnet mask to the IP source address; transmitting the IP packet to all IP addresses in the switching table within the subnetted source address.

Abstract: Methods for modifying a switching table of an Internet Protocol (IP) switch. The methods include: receiving a dynamic host configuration protocol (DHCP) option 43 request from a host of a LAN at an access port of the IP switch; transmitting the request to a DHCP server; intercepting a DHCP response for the request from the DHCP server; extracting an IP address from the intercepted DHCP response; and adding the extracted IP address to a corresponding entry (specific to the access port) of a switching table of the IP switch. The methods include: receiving an IP frame at an access port of the IP switch; reading an IP source address from the IP frame; and in the switching table either: creating a new entry including the IP source address and its associated port identifier or changing an existing entry based on the IP source address and the access port.