Abstract: The invention that addresses the problem of authentication of the transport packet stream (which constitutes a flow within a session), which has been admitted into a managed packet network. Authentication and the subsequent policing of the flows supporting an identified client's authorized service prevent a large class of denial of service attacks described below. Specifically, the invention addresses two different matters: 1) key distribution and management 2) various forms of using a shared key for the authentication of transport packets on the user-to-network-interface (UNI).

Abstract: The present invention is a methodology for providing packet aggregation based on transmission window size to achieve improved transport efficiency. One embodiment of the invention includes the steps of receiving an indication of a transmission window size for packets to be transmitted from a first location to a second location where the transmission window size provided by a flow control message. The transmission window size is utilized to determine a bundling factor for transmission of packets from said first location to said second location, the bundling factor being a lesser of a maximum bundling factor and the transmission window size. A transmission window size threshold represents a boundary for a size of a transmission window when transmission of existing frames may be delayed. The frames are bundled according to the bundling factor if the transmission window size is greater than the transmission window size threshold.

Abstract: The present invention is a methodology for controlled switchover of unicast and multicast data flows in packet based switching system. In some cases it is advantageous to purposefully support switchover of flows from one path to the other without causing loss of data. This is termed a “controlled” or “hitless” switchover. In accordance with the present invention switchover methodology, given that an ingress arbiter device is transmitting to both cores simultaneously, it is required that the flows to both switching cores be synchronized at an aggregator level and that an egress arbiter be given time to cease receiving packets from one Core then switch over to the other Core, and continue receiving packets.

Abstract: A terminal device is provided for communicating data signals with a central communication device via a first signal carrying line and a second signal carrying line. The first signal carrying line is arranged for transporting a first signal and the second signal carrying line is arranged for transporting a second signal, wherein the first and second signals have equal content. The first signal carrying line has a first propagation time and the second signal carrying line has a second propagation time, such that the first propagation time is shorter than the second propagation time. The terminal device includes a signal quality comparison element for determining a first signal quality of the first signal and a second signal quality of the second signal, for comparing the first and second signal qualities, and for accepting the one of the first and second signals that has a better quality.

Abstract: Apparatus for routing packets in a communication network comprises a plurality of per-connection queues, each queue established for receiving packets from a respective source and temporarily storing received packets before routing to a particular destination; a weighted fair-queuing scheduler for servicing packets from each of the plurality of per-connection queues at guaranteed pre-allocated rates; a sensing device for sensing a presence or absence of packets in queues, the absence of packets in queues indicating availability of excess bandwidth; and, a state dependent scheduler for redistributing excess bandwidth upon sensing of queues absent packets, the state dependent scheduler servicing those queues in accordance with a state variable corresponding to a performance property of the queues, wherein delay and isolation properties for routing packets of respective queues in weighted fair-queuing is preserved.