Abstract: A method is intended for computing online channel loss rate and collision loss rate of at least one communication link established between nodes (N1, N2) of a network (WN) using a random access MAC protocol. This method comprises the steps of i) dividing time in probing windows and transmitting a chosen number S of probe packets during each probing window from a transmitter node (N1) to a receiver node (N2) linked therebetween, ii) measuring a packet loss rate from probe packets lost on this communication link during a probing window, iii) scanning each probing window with smaller sliding windows, each having a size Wk smaller than S, to identify the sliding window during which only channel losses occur, and then for computing a channel loss rate on this communication link from this identified sliding window, and iv) computing a collision loss rate on this communication link by subtracting the computed channel loss rate from the measured packet loss rate.

Abstract: A method is intended for computing online a feasible rates region in a network using a random access MAC protocol and comprising nodes having links there between. This method comprises the steps of i) determining, for each link, a primary extreme point corresponding to a maximum output rate when this link transmits alone at a maximum input rate, and ii) determining secondary extreme points by combining these primary extreme points with a chosen interference model, these primary and secondary extreme points defining a boundary of a feasible rates region.

Abstract: A method is intended for computing online channel loss rate and collision loss rate of at least one communication link established between nodes (N1, N2) of a network (WN) using a random access MAC protocol. This method comprises the steps of i) dividing time in probing windows and transmitting a chosen number S of probe packets during each probing window from a transmitter node (N1) to a receiver node (N2) linked therebetween, ii) measuring a packet loss rate from probe packets lost on this communication link during a probing window, iii) scanning each probing window with smaller sliding windows, each having a size Wk smaller than S, to identify the sliding window during which only channel losses occur, and then for computing a channel loss rate on this communication link from this identified sliding window, and iv) computing a collision loss rate on this communication link by subtracting the computed channel loss rate from the measured packet loss rate.

Abstract: A method is intended for computing online channel loss rate and collision loss rate of at least one communication link established between nodes of a network using a random access MAC protocol. This method comprises the steps of i) dividing time in probing windows and transmitting a chosen number S of probe packets during each probing window from a transmitter node to a receiver node linked therebetween, ii) measuring a packet loss rate from probe packets lost on this communication link during a probing window, iii) scanning each probing window with smaller sliding windows, each having a size Wk smaller than S, to identify the sliding window during which only channel losses occur, and then for computing a channel loss rate on this communication link from this identified sliding window, and iv) computing a collision loss rate on this communication link by subtracting the computed channel loss rate from the measured packet loss rate.

Abstract: A method and apparatus for route aware network link acceleration provides a managed communication channel for accelerated and reliable network communication between a client and other network devices as needed. The communication channel may comprise one or more segments having increased speed, reliability, security, or other improved characteristics as compared to traditional communication links. Network traffic may be routed through one or more of the segments based on various criteria to improve communication of the traffic. In one embodiment, the segments may be arranged in a daisy chain configuration and be provided by one or more chaining nodes.

Abstract: A method and apparatus for route aware network link acceleration provides a managed communication channel for accelerated and reliable network communication between a client and other network devices as needed. The communication channel may comprise one or more segments having increased speed, reliability, security, or other improved characteristics as compared to traditional communication links. Network traffic may be routed through one or more of the segments based on various criteria to improve communication of the traffic. In one embodiment, the segments may be arranged in a daisy chain configuration and be provided by one or more chaining nodes.

Abstract: A method and system for extracting and building end-to-end route information in a multi-area Internet protocol (IP) autonomous system (AS) is disclosed. The method and system enable a user, such as a network administrator, to explicitly identify a full set of paths (links and routers) that a given IP packet would potentially traverse from its entry point in the source area of the AS where it originates until its exit point in its intended destination area.

Abstract: A method is intended for computing online channel loss rate and collision loss rate of at least one communication link established between nodes of a network using a random access MAC protocol. This method comprises the steps of i) dividing time in probing windows and transmitting a chosen number S of probe packets during each probing window from a transmitter node to a receiver node linked therebetween, ii) measuring a packet loss rate from probe packets lost on this communication link during a probing window, iii) scanning each probing window with smaller sliding windows, each having a size Wk smaller than S, to identify the sliding window during which only channel losses occur, and then for computing a channel loss rate on this communication link from this identified sliding window, and iv) computing a collision loss rate on this communication link by subtracting the computed channel loss rate from the measured packet loss rate.

Abstract: A method is intended for computing online a feasible rates region in a network using a random access MAC protocol and comprising nodes having links there between. This method comprises the steps of i) determining, for each link, a primary extreme point corresponding to a maximum output rate when this link transmits alone at a maximum input rate, and ii) determining secondary extreme points by combining these primary extreme points with a chosen interference model, these primary and secondary extreme points defining a boundary of a feasible rates region.

Abstract: A method and apparatus for route aware network link acceleration provides a managed communication channel for accelerated and reliable network communication between a client and other network devices as needed. The communication channel may comprise one or more segments having increased speed, reliability, security, or other improved characteristics as compared to traditional communication links. Network traffic may be routed through one or more of the segments based on various criteria to improve communication of the traffic. In one embodiment, the segments may be arranged in a daisy chain configuration and be provided by one or more chaining nodes.

Abstract: A method and system for extracting and building end-to-end route information in a multi-area Internet protocol (IP) autonomous system (AS) is disclosed. The method and system enable a user, such as a network administrator, to explicitly identify a full set of paths (links and routers) that a given IP packet would potentially traverse from its entry point in the source area of the AS where it originates until its exit point in its intended destination area.

Abstract: A method and system for extracting and building end-to-end route information in a multi-area Internet protocol (IP) autonomous system (AS) is disclosed. The method and system enable a user, such as a network administrator, to explicitly identify a full set of paths (links and routers) that a given IP packet would potentially traverse from its entry point in the source area of the AS where it originates until its exit point in its intended destination area.

Abstract: A method and system for identifying the root-cause event that affected a path change in a multi-area Internet protocol (IP) autonomous system (AS) operated according to a link state routing protocol such as the Open Shortest Path First (OSPF) protocol is disclosed. The method and system may enable a user, such as a network administrator, to explicitly identify which routing protocol events are responsible for changes to paths that are being monitored.

Abstract: A network node for a scalable packet based network comprising ports for reception and transmission of data packets of network segments connected to the respective ports of the network node, a forwarding table which stores for each port of the network node addresses of nodes reachable through the respective port of the network node, a registering table which stores a list of node addresses registered with the network node wherein the network node forms a registrar node for these addresses, and a registrar table which stores information data on all network nodes which are registrar nodes of the network.

Abstract: A method and system for extracting and building end-to-end route information in a multi-area Internet protocol (IP) autonomous system (AS) operated according to a link state routing protocol such as the Open Shortest Path First (OSPF) protocol is disclosed. The method and system enables a user, such as a network administrator, to explicitly identify a full set of paths (links and routers) that a given IP packet would potentially traverse from its entry point in the area of the AS where it originates until its exit point in its intended destination or exit area.

Abstract: A method and system for monitoring traffic and path information in a packet communication network operated according to an IP routing protocol is disclosed. The method and system enables a user, such as a network administrator, to explicitly identify a full set of paths (i.e., links and routers) that the traffic of a specific customer or set of customers, such as service providers hosted at a hosting site, is using when traversing the network. The system allows the dynamic monitoring of the set of active links carrying traffic belonging to the specific customer or set of customers, and the proportion of that traffic that is carried by each active link. This allows, among other things, the identification of network links that are critical for ensuring a high level of service to key customers.

Abstract: A method and system for extracting and building end-to-end route information in a two-level, multi-area Internet protocol (IP) autonomous system (AS) operated according to a simple link state routing protocol such as the Integrated System to Integrated System (IS-IS) protocol is disclosed. The method and system enables a user, such as a network administrator, to explicitly identify a full set of paths (links and routers) that a given IP packet would potentially traverse from its entry point in the area of the AS where it originates until its exit point in its intended destination or exit area.

Abstract: A method and system for identifying the root-cause event that affected a path change in a multi-area Internet protocol (IP) autonomous system (AS) operated according to a link state routing protocol such as the Open Shortest Path First (OSPF) protocol is disclosed. The method and system may enable a user, such as a network administrator, to explicitly identify which routing protocol events are responsible for changes to paths that are being monitored.

Abstract: A method and system for extracting and building end-to-end route information in a multi-area Internet protocol (IP) autonomous system (AS) is disclosed. The method and system enable a user, such as a network administrator, to explicitly identify a full set of paths (links and routers) that a given IP packet would potentially traverse from its entry point in the source area of the AS where it originates until its exit point in its intended destination area.

Abstract: A method and system for extracting and building end-to-end route information in a multi-area Internet protocol (IP) autonomous system (AS) is disclosed. The method and system enable a user, such as a network administrator, to explicitly identify a full set of paths (links and routers) that a given IP packet would potentially traverse from its entry point in the source area of the AS where it originates until its exit point in its intended destination area.