Abstract: The invention provides a distributed back-up mechanism and a two-step method for facilitating fast control plane recovery in a switched network. In a preferred embodiment, a Label Information Database (LID) maintained at a control node of a GMPLS network is mirrored to an upstream node using the Label Distribution Protocol (LDP). After a control plane interruption resulting in the LDP restart, the control node, using the mirrored information at the upstream node, conducts first a fast coarse LID recovery wherein only the idle labels are identified, to enable the restarted LDP session to process new connection setup. A detailed LDP state information recovery performs in the background in parallel to the normal LDP operations, e.g. using on-demand LDP queries.

Abstract: A method of initializing, provisioning, and managing a cable modem and a customer premise equipment device includes, prior to receiving the configuration file for the cable modem, providing an equipment identification message containing a description of the customer premise equipment device connected to the cable modem. In the case where the cable modem has yet to be provisioned, the configuration file received from the network server is a particular access-limiting configuration file that is selected from a group of access-limiting configuration files. The selection of the particular access-limiting configuration file is based on the description of the customer premise equipment device in the equipment identification message. This allows different devices to have different network restrictions or different walled gardens.

Abstract: Various systems and methods that allow multiple aggregation protocol sessions to be established in a daisy chain network are disclosed. One method involves sending a first aggregation protocol packet and a first session identifier associated therewith to a first network device via a first interface and sending a second aggregation protocol packet and a second session identifier associated therewith to a second network device via the first interface.

Abstract: A monitoring system gathers both site-to-site measurements, and agent-to-agent measurements, wherein one or more agents are distributed in one or more sites in a distributed network environment. Site-to-site measurements between two sites, such as site one and site two, are obtained by testing between any agent at site one and any agent at site two. A measurement rate between sites and between agents is determined that allows for the detection of events, such as user perceivable events, without overwhelming the set of agents that form the distributed measurement system. With, for example, a scheduling mechanism used to schedule measurement tests of finite duration, as opposed to continuous streams of measurement packets, for each pair of agents, the test can be used as an indication as to whether the measurement system is overwhelmed.

Abstract: In a particular embodiment, the disclosure is directed to a method of making a digital subscriber line (DSL) connection to a remote network. The method includes detecting the presence of a powered-on network capable device that is connected to a DSL modem; establishing a network connection over a DSL line to the remote network after detecting the presence of the powered on network capable device; terminating the network connection over the DSL line after detecting an absence of network capable devices connected to the DSL modem; and releasing network resources supported by the remote network after the network connection is terminated.

Abstract: A testing method for a network device includes the steps of communicating with the network device through a network protocol by a testing host; and transmitting at least one first network protocol packet to the network device so as to enable a command line interface (CLI) of the network device through a first testing command by the testing host.

Abstract: The present invention relates to multicast communication systems and in particular to the implementation of a random access uplink channel, which can be used, e.g., for transmission of acknowledgement messages for received data. In order to prevent frequent collisions on said channel, the transmission of acknowledgement messages is spread at least over time or, additionally, with regard to another distinguishing channel property, e.g. a RACH sub-channel or RACH-signature.

Abstract: Systems and methods that provide fault tolerant transmission control protocol (TCP) offloading are provided. In one example, a method that provides fault tolerant TCP offloading is provided. The method may include one or more of the following steps: receiving TCP segment via a TCP offload engine (TOE); calculating a TCP sequence number; writing a receive sequence record based upon at least the calculated TCP sequence number to a TCP sequence update queue in a host; and updating a first host variable with a value from the written receive sequence record.

Abstract: The disclosed technology relates to a communication system and method in which multiple versions of a signal are processed to detect the signal. The communication system can include transmitters that communicate different versions of a signal to a receiver. The different versions are weighted versions of the signal and are communicated on different channels. The weight for a weighted signal is based on an inverse of an estimate of the phase shift of the particular channel to which the weighted signal will be communicated. The weights are also based on a unity gain such that each weighted signal has the same magnitude as the original signal. A receiver that receives the weighted signals processes the received signals to detect the original signal.

Abstract: For a survivable portion of a network, a backup port for a first router of the survivable network, to reach a destination node in the event of a single link failure, may be determined by (a) accepting a routing path graph having the destination node, wherein the routing path graph includes one or more links terminated by one or more primary ports of the first router, and (b) for each router of at least a part of the routing path graph, (1) assuming that a link terminated by a primary port of the current router is removed, defining (A) a first part of the routing path graph including the destination node, and (B) a second part of the routing path graph separated from the first part wherein the second part defines a sub-graph, and (2) determining the backup port for the first router by examining the sub-graph with respect to the first part of the routing path graph.

Abstract: A method and apparatus are provided for prioritizing message flows in a state machine execution environment. A state machine is disclosed that employs a flow graph that provides a flow control mechanism The flow control mechanism defines a plurality of states and one or more transitions between the plurality of states, wherein one or more tokens circulate within the flow graph and execute functions during the one or more transitions between the states The disclosed state machine parses one of the tokens to extract one or more predefined information elements; and assigns a priority to the token based on the extracted information elements and a state occupancy of the token, wherein the assigned priority controls an order in which the token is processed.

Abstract: A method and system of routing variable-length packet data across a wave division multiplex (WDM) communications network having a plurality of data communications channels comprises inverse-multiplexing each data packet into a respective frame. Each frame includes a label block containing label information of the frame, and two or more respective payload blocks having a predetermined length. The label block contains encoded routing information, a start time, and, possibly an end time, and is transmitted over a label channel of the communications network. The start time preferably indicates a delay between launching a first bit of the label clock and the first bit of the payload blocks. The end time may be a bit count indicative of the location of the last bit of the data packet within the frame. The data packet is divided into a plurality of data segments, each of which is transported across the network within a respective payload block.

Abstract: A field-programmable gate array (“FPGA”) or programmable logic device (“PLD”) includes relatively general-purpose PLD core circuitry and relatively specialized high-speed serial interface (“HSSI”) hard IP circuitry. To better support applications that include forward error correction (“FEC”), some tasks related to FEC (e.g., FIFO operations) are performed in the PLD core circuitry, while other FEC tasks (e.g., FEC calculations) are performed in the HSSI hard IP circuitry.

Abstract: An information communication method, which is executed on a transmitting side, is provided. The method comprises a first step of transmitting communication data to a receiving side; and a second step of retransmitting the communication data to the receiving side without waiting for an arrival of a negative acknowledgement signal of the communication data, which arrives from the receiving side, or an elapse of a predetermined acknowledgement wait time.

Abstract: Methods and products are disclosed for analyzing network traffic using an improved Markov Modulated Poisson Process Model with one bursty state and a plurality of idle states that include: establishing a time scale of operation for each state in the improved MMPP model; establishing a transition value for each state in dependence upon the time scale of operation for the state; measuring inter-arrival times between individual packets received in one or more network adapters; and determining a current state for the network traffic independence upon the measured inter-arrival time of a most recently received packet and the transition values.

Abstract: A system, method and computer program for ensuring a safe and efficient transmission of a datagram between two isolated points, the datagram being transmitted by a chain of couriers. Limited range communication means are used to pass the datagram from a courier to another, said limited range communication means being based on either a wired or wireless communication equipment. To take the best advantage of the plurality of routes available between two points, a plurality of instances of a same datagram are created. A given credit for the creation of instances is assigned to each datagram, once created. A datagram instance split operation is performed each time two couriers are within range. When a datagram instance is divided into several datagram instances, each datagram instance receives a portion of the credit of the original datagram instance and the total number of credits remains unchanged.

Abstract: The invention provides a leaky-bucket method for delivering packets from a first node (A) to a second node (B) in a packet switched network, comprising the steps of: receiving at the first node (A) of at least one transmission comprising buffered packets, and at least one transmission comprising real-time packets; transmitting the received packets to the second node (B) and increase a bucket counter for the bucket, which bucket has a leak rate that is equal to or larger than the byte transmitting ratio of the real-time packets.

Abstract: The traffic load density measuring system includes a transmitter connected to a communication network for transmitting a packet, and a receiver for receiving the packet, in which a packet for load density detection is transmitted and received to measure a traffic load density within a predetermined transmission interval. The transmitter changes a transmission interval of the packet for load density detection, and adds transmission information capable of specifying a transmission time, a transmission interval, and a transmission number of the packet for load density detection to the packet for load density detection to transmit said packet. The receiver receives the packet for load density detection, extracts the transmission information from the packet for load density detection being received, and measures the load density within the predetermined transmission interval based on the extracted transmission information, and a delay or a lost status of the packet for load density detection.

Abstract: For ensuring a low cost transport of signals in a radio network, in particular with a high density of radio access points, a method is proposed, where the signals are transported over wires between a base station and radio access points, comprising the steps of: determining the useful band of each wire (20); associating at least two wires (21); filtering the signal into sub-bands (22); transporting each sub-band over one or more wires of the associated wires (25); at the receiving end rebuilding the signal from the sub-bands (27). Further proposed are a radio head and a radio controller both adapted to the present method.

Abstract: A communication system for a plurality of devices performing communications through a network is provided. The communication system includes a transmitter/receiver, a reception status detector, and a recorder. The transmitter/receiver is included in each of the plurality of devices and configured to alternately transmit a data packet with ID information indicating time to another device and receive the data packet from the device periodically in the plurality of devices. The reception status detector is included in each of the plurality of devices and configured to detect whether the data packet is periodically received based on the ID information added to the data packet received from another device. The recorder is configured to record a result detected by the reception status detector in each of the plurality of devices.