Abstract: Routing nodes in communications networks use policies and certain fields, called selection fields, in packet headers to make routing decisions. When routing over a trunk, a specific trunked link over which to forward a packet must be selected. Policies and selection fields can be used in a way that causes the packets in data streams to be distributed more evenly across the trunked links than is currently done.

Abstract: A node of a frame-based network has a group of outgoing links which are to be treated as an aggregated group of links. A frame distributor performs a distribution function on data frames which are intended for transmission on the group of links. The frame distributor determines if the data frame is an encapsulated data frame which forms part of a tunnelled traffic path across the network. If the data frame does form part of a tunnelled traffic path across the network, the frame distributor allocates the data frame to one of the group of links using at least part of an identifier from the header of the data frame. The identifier represents a service with which the data frame is associated, a customer or user of the data frame, or the tunnelled traffic path, which have greater variability than the backbone destination and source addresses.

Abstract: An Ethernet MAC OAMP Control sublayer is provided for supporting SDH/SONET OAMP standard functionality in Ethernet Networks. In accordance with one embodiment, an Ethernet MAC OAMP Control sublayer is provided for processing Ethernet MAC OAMP Control frames. The MAC OAMP Control sublayer provides support for a MAC OAMP Client to implement all of the SDH/SONET OAMP standard functionality. The MAC OAMP Control frame provides support for SDH/SONET OAMP on Ethernet networks. The Network Equipment can use the MAC OAMP Control frames to communicate with the downstream and upstream Network Equipment about various OAMP events, requests, performance parameters, communications channels, maintenance, and test functionality.

Abstract: A method of adjusting transmission timing, a method of continuously transmitting packets, and a mobile station are provided. The method of adjusting the transmission timing includes adjusting the transmission timing according to a transmission timing adjustment command when the transmission timing adjustment command is received from a receiving side; and creating a cyclic prefix (CP) in consideration of a part of a CP of a next symbol which overlaps with a previous symbol on a time axis on the basis of the adjusted transmission timing. Accordingly, it is possible to prevent deterioration in reception performance and minimize reception complexity even when packet transmission timing is adjusted at a transmitting side using an OFDMA or analogous radio access scheme.

Abstract: A method for authenticating a message in a time division multiple access network is provided. The method includes receiving a message from an active relaying component, inspecting a value in the message inserted by the active relaying component, and comparing the value with an expected value based on a transmission schedule.

Abstract: A method and apparatus for control channel transmission and reception is provided herein. In particular, the use of a partitioned and structured control channel is provided that leverages the benefits of common control while maintaining favorable aspects of dedicated control. During operation, control information is distributed over a number of partitions (201). Each Pi is encoded (607) with monotonically non-increasing reliability level. Control information for a given remote unit can be distributed on one or several partitions, from Pl to Pk, where Pk is encoded with the lowest reliability level that can be decodable by the remote unit at an acceptable error rate.

Abstract: A telecommunications system in a DiffServ aware Traffic Engineering (DS-TE) environment includes a plurality of source nodes from which LSPs arise. The system includes an MPLS network having DS-TE compliant routers and links with available bandwidth between the routers. The links having equal cost paths. Each router adding an LSP to a link as a function of available bandwidth. The plurality of source nodes in communication with the network. The MPLS network using a DS-TE bandwidth constraint model. The system includes a plurality of destination nodes in communication with the network which receives LSPs. A method for LSP path selection in a DiffServ aware Traffic Engineering environment.

Abstract: An object of the present invention is to provide a communications system etc., which can reduce the influence of interference from other systems which results from a difference in symbol length, in an area where a plurality of systems using different transmission methods are mixed. The present invention relates to a communications system in which a plurality of systems share the same frequency bandwidth so as to transmit information symbols. One of the plurality of systems 1 includes an identifying unit 109 configured to identify the symbol length of an information symbol transmitted in a different system 2; and an adjusting unit 102, 107 configured to adjust the symbol length of an information symbol to be transmitted, in accordance with an identified symbol length.

Abstract: Disclosed is a method and system based on MAC frames for enabling a QAP to seamlessly operate between granting polls for upstream and sidestream traffic while sending downstream frames. The inventive scheduling method uses a minimum set of mandatory TSPEC parameters to generate a schedule, which provides minimum performance requirement in wireless local area networks (WLANs).

Abstract: In a passive optical network, dynamic bandwidth allocation and queue management methods and algorithms, designed to avoid fragmentation loss, guarantee that a length of a grant issued by an OLT will match precisely the count of bytes to be transmitted by an ONU. The methods include determining an ONU uplink transmission egress order based on a three-stage test, and various embodiments of methods for ONU report threshold setting.

Abstract: A communications system includes a mobile unit that transmits content and a number of base transceiver stations that receive the content from the mobile unit. Each base transceiver station determines a value for a metric associated with communications between the mobile unit and the base transceiver station, generates a graded packet including the value and the content, and communicates the graded packet. The system also includes a router that receives the graded packets, combines different portions of the content from each of two or more of the graded packets to create an improved packet, and communicates the improved packet. The different portions from the graded packets collectively represent the entirety of the content such that the improved packet includes the entirety of the content.

Abstract: A network system capable of easily, if a communication abnormality occurs at an application level, troubleshooting a cause of the abnormality, includes a plurality of monitoring target computers, a network monitoring device and a plurality of network devices for relaying TCP communications, wherein each monitoring target computer sends, if the on-performing TCP communication comes into an abnormal status, a fault notifying message showing a content of this abnormal status to the network monitoring device, and the network monitoring device has a function of displaying the content of the received fault notifying message.

Abstract: Various embodiments are a method for negotiating datapath treatment for traffic sourced from a first communications network over an end-to-end path in respect of a path segment provided for the traffic in a second communications network, the path segment being requested for a first node of the second communications network and being targeted to a second node of the second communications node. The method comprises: for the first node, notifying that a datapath capability for the path segment is one for selection for the second node; communicating datapath capabilities associated with the first node; selecting, for the second node, a datapath capability from the datapath capabilities so communicated; communicating the datapath capability so selected for the second node back to the first node; and wherein the path segment is established using a signaling protocol of the second communications network. Various embodiments are also be implemented in a corresponding communications node.

Abstract: Techniques that may be utilized in a multiprocessor computing system are described. In one embodiment, one or more addresses (such as source and/or destination addresses) of a received packet are encoded to reduce the size of the addresses and the encoded one or more addresses are utilized to classifying the received packet.

Abstract: The present invention provides a method and system for controlling the data rate in packet based wireless communications. Then, using the probability of error, the invention calculates the throughput and drop probability for two or more data rates and selects the data rate with highest throughput. In one embodiment of the invention, the probability of error based on information passed back from the receiver regarding decoding errors. In another embodiment, the probability of error is based on acknowledgement packets returned by the receiver.

Abstract: An enumeration method providing the link rate and a pixel/audio clock rate is described.

Abstract: A concept for providing processes and apparatus for router resource management is described. One process for managing router congestion in a distributed communications system includes monitoring messaging traffic originating from a plurality of clients and determining when one or more of the plurality of clients deviates from an accepted congestion management protocol. The process also includes rank ordering those clients of the plurality according to the egregiousness of their deviation from the protocol to determine a worst offender and dropping packets from the worst offender of the plurality.

Abstract: When a lower layer address pair of a transferred lower layer frame is counted a predetermined number of times or more, a packet transfer apparatus (2) sends the lower layer address pair to a frame transfer apparatus (3). The frame transfer apparatus (3) counts the transfer frequency of the lower layer frame having the lower layer address pair.

Abstract: A central control station carries out allocations of transmission rights according to a rule that a value obtained by subtracting (i) a value of a broken line (11) from (ii) a value of a straight line (10) is always limited according to a certain constant value (TXOP bound) smaller than C·T delay, where the broken line (11) indicates a sum of transmission granting time periods allocated from a certain time point t0 by “an actual transmission right allocation”, the straight line (10) indicates a sum of transmission right granted time periods allocated according to “a reference transmission right allocation obtained by the average data rate or the like of a communication station”, and C·T delay is an average sum of transmission right granted time periods allocated to the tolerable transmission delay time according to the reference transmission right allocation.

Abstract: A control terminal such as a CMTS is initialized to receive packets of voice calls having parameters including a bit rate, a packetization interval, and a call identification. A plurality of queues is created to define a corresponding plurality of phases at a sub-multiple of the packetization interval. Voice calls are admitted to the control terminal. The voice calls are distributed among the queues in a predetermined order as the voice calls are admitted and the voice calls removed from the queues as the voice calls are terminated. USGs are periodically issued at the phases defined by the queues. The USGs include a call identification and a grant of bandwidth sufficient to transmit the packets.