Abstract: The invention relates to determining mutual differences of transmission delays experienced by protocol data units transmitted in a communications network. This invention is based on a surprising discovery that the time difference between the receiving moments of protocol data units the temporal receiving order of which deviates from their temporal transmitting order represents the smallest possible difference between the transmission delays experienced by these protocol data units. In a method according to the invention it is determined, based on an order indicator associated with a protocol data unit received at an earlier point of time and an order indicator associated with a protocol data unit received at a later point of time, whether the mutual order of the protocol data units changed during transmission.

Abstract: In one embodiment, an apparatus comprises a network interface system having at least one input port configured for receiving frames and a logic system comprising at least one logic device. The logic system may be configured to perform the following functions: determining a source address and a destination address of a frame received at an ingress port; calculating a flow hash based at least upon the source address and the destination address; forming a congestion management (“CM”) tag that includes the flow hash; inserting the CM tag in the frame; and forwarding the frame to the destination address.

Abstract: A system and method for generating alarms based on traffic bursting. Marked packets are received. A determination is made whether the marked packet conforms with a bandwidth profile. The packet is remarked in response to determining the marked packet does not comply with a CIR threshold and an EIR threshold. An alarm is generated in response to remarking the packet.

Abstract: Method and system for a switch element is provided. The method includes (a) receiving a portion of a packet at a port of the switch element; (b) generating a tag based on an estimated packet size obtained from the portion of the packet; (c) sending the tag with the estimated packet size to a transmit segment of the port; (d) selecting a request from among a plurality of pending requests for processing the packet associated with the tag; (e) receiving an actual packet size for the packet in step (a); (f) determining if the actual packet size is different from the estimated packet size; and (g) adjusting an arbitration weight used for selecting the request in step (d), if the actual packet size is different from the estimated packet size.

Abstract: A broadband access node and method for controlling access by end users to services over communication channels. A resource admission control mechanism includes a first memory for storing information about a currently available transmission capacity on an uplink channel, a second memory for storing information about a currently available transmission capacity on a downlink subscriber line; and a third memory for storing information about a currently available maximum performance of the access node. A fourth memory stores service-related information regarding the capacity and performance service requirements of respective services. A processor calculates whether the service requirements of a requested service fulfill given conditions in relation to currently available uplink/downlink capacity and currently available performance capability of the access node. Requests that fulfill the given conditions are granted while requests that do not fulfill the conditions are rejected.

Abstract: Techniques are disclosed for synchronizing a database related to a first node in a network with multiple nodes. Each node includes a database different from a database on a different node. An inquiry control message is sent to each node in a candidate set of one or more nodes on the network, which are different from the first node. In response to the inquiry control message, the first node receives a first set of one or more messages from a particular node different from the first node. The first set indicates a portion from the database of the particular node. The portion is relevant for the first node. A particular portion of a first database for the first node is derived from the first set of messages. The particular portion is less than all of the first database. These techniques allow the first node to derive its full database from multiple adjacent nodes.

Abstract: An improved system for allocating bandwidth allows a network customer to dynamically modify bandwidth settings for their private networks. Applicable modified bandwidth settings may include port speed, committed access rate, and Ethernet flow. Port speed determines how much total data may pass through a node in a private network at one time, while committed access rate determines how much bandwidth the node will commit to a particular class of service. Ethernet flow governs the bandwidth allowed over a private line between two nodes. A bandwidth modification request is received by an input interface, which provides it to a processing server that schedules the modification request for committal. The processing server also changes customer billing information accordingly. Additionally, the user may specify a future time when the bandwidth modification request should be committed.

Abstract: A computer implemented method, apparatus, and computer usable program code to receive data from a source at a plurality of gateways for distribution using a selected priority. The data is transmitted from the plurality of gateways to a plurality of receivers using the selected priority. Every gateway in the plurality of gateways has an adaptive bandwidth control process and a respective set of parameters for controlling the adaptive bandwidth control process for sending the data at the selected priority. Transmission of the data from each gateway for the selected priority has a different impact on other traffic at different gateways in the plurality gateways for the selected priority when different values are set for the set of parameters for the different gateways.

Abstract: A dynamic bandwidth allocation (DBA) device and a method thereof are provided. In the DBA method, the band allocation periods according to class queues and allocable bands with respect to each class queue are calculated on the basis of the service level agreement information and stored according to the service types in separate tables. The bandwidth allocation amount is calculated with respect to class queues which have the allocation periods by concurrently checking all the tables at each frame. The upward bandwidth usage efficiency is improved by calculating the final bandwidth allocation information from the service with a high priority order on the basis of the total allocable bandwidth of the corresponding frame. The upward bandwidth allocation amount can be calculated at each frame by reducing the processing speed in calculating the bandwidth allocation amount of each class queue. Accordingly, it is possible to effectively use the network.

Abstract: A radio transmission apparatus performs communications with high transmission efficiency. In this apparatus, a modulator modulates data and outputs to a first spreader. A second modulator modulates data under a modulation scheme having a higher M-ary number than the first modulator and outputs the modulated data to a second spreader. The first spreader spreads the data and outputs the spread data to a frequency domain mapping section. The second spreader spreads the data and outputs the spread data to a time domain mapping section. A frequency domain mapping section maps chips with spread data on subcarriers in the frequency domain and outputs the data with chips mapped on subcarriers to an IFFT section. The time domain mapping section maps chips with spread data on subcarriers in the time domain and outputs the data with chips mapped on subcarriers to the IFFT section.

Abstract: A multilevel coupled policer is configured to police packets using at least two policing levels, including a first-level of class policers and a second-level aggregate policer. The multilevel coupled policer is configured to share bandwidth of the aggregate policer among packet traffic corresponding to the class policers based on the packet traffic. The multilevel coupled policer is configured to apply a particular class policer corresponding to a particular packet to identify a tentative policing action. The multilevel coupled policer is configured to apply the second-level aggregate policer to the particular packet based on the identified the tentative policing action and a result of a comparison operation of the number of tokens in one or more token buckets associated with the second-level aggregate policer and the length of the particular packet in order to determine a final policing action for marking and/or applying to the particular packet.

Abstract: Assigning slots to nodes in a mesh network. Slot numbers are assigned to nodes in a wireless mesh network using a depth-first search combined with information on 2-hop neighborhoods for each node. Assigning slots using 2-hop neighborhood information allows slots to be safely reused. The slot assignment process may take process in parallel using different wireless channels for different subtrees rooted to a controller. Slot assignment may be repeated when the mesh topology changes. Reporting using the slot numbers allows for information from child nodes to be aggregated or filtered at parent nodes.

Abstract: A line-rate, real-time-traffic detector classifies a network traffic flow as real-time when it determines the smoothness of the packet arrival rate of the network traffic flow is bounded by an empirically derived bound. In some embodiments, to improve performance, a tighter smoothness bound is applied to the smoothness calculations performed on a first set of packet arrival times, while a looser smoothness bound is applied to a second set of packet arrival times, the second set inclusive of and larger than the first.

Abstract: A digital signal demultiplexing apparatus that can demultiplex and a digital signal multiplexing apparatus that can multiplex signals of channels having arbitrary frequency intervals and bandwidths are provided. The digital signal demultiplexing apparatus performs discrete Fourier transform on an input signal, output samples existing within frequency bands of each channel from samples of the frequency domain, add samples such that the number of samples of each channel become a power of two, and performs, on the samples of each channel, discrete inverse Fourier transform of a length the same as the number of the samples.

Abstract: Determining mutual differences of transmission delays experienced by protocol data units transmitted in a communications network is based on a surprising discovery that the time difference between the receiving moments of protocol data units the temporal receiving order of which deviates from their temporal transmitting order represents the smallest possible difference between the transmission delays experienced by these protocol data units. In a method it is determined, based on an order indicator associated with a protocol data unit received at an earlier point of time and an order indicator associated with a protocol data unit received later, whether the mutual order of the protocol data units changed during transmission. If the mutual order has changed, the time difference between the receiving moments of the protocol data units is calculated, which time difference represents the smallest possible difference between the transmission delays experienced by these protocol data units.

Abstract: A network device includes a multi-port media access controller (MAC) device that comprises a plurality of MAC devices. Some of the MAC devices output respective data streams at different speeds. A plurality of speed translators translates the speeds of the respective data streams to be greater than or equal to a highest output speed of the plurality of MAC devices and generates parallel speed translated data streams. A multiplexer multiplexes the parallel speed translated data streams to generate a multiplexed data stream corresponding to one of the plurality of MAC devices with the highest output speed defined by the parallel speed translated data streams. A first serializer and deserializer receives the multiplexed data stream that is encoded at a physical coding sublayer and serially transmits the multiplexed data stream to a multi-port physical layer device.

Abstract: The present invention is generally directed towards a remote access architecture for providing peer-to-peer communications and remote access connectivity. In one embodiment, the remote access architecture of the present invention provides a method for establishing a direct connection between peer computing devices via a third computing device, such as a gateway.

Abstract: A proactive network analysis system is a single unit for diagnosing network problems, measuring network performance, and monitoring network status in a comprehensive manner. The system is a compilation of individual tools including a distributed network packet capture data stream collector; a traffic analyzer; a performance graphing unit; a syslog recorder analyzer and archiving unit; a system availability monitor; a device configuration archiving unit; and a throughput measurement tool. The system can further provide an access list generator, an access list analyzer, a router DNS name generator and a service level agreement measurement device.

Abstract: Methods and arrangements for providing load reference data in a CDMA wireless communication system with receiver diversity are presented. The method comprises measuring (210) of received total wideband power for more than one receiver branch. Probability distributions for a respective power quantity are estimated (212), related to selected state variables of an estimation algorithm, from quantities representing the measured powers using selected measurement functions of the selected state variables of the estimation algorithm. The selected state variables correspond to cell power quantities and the selected measurement functions correspond to the quantities representing the measured powers. A conditional probability distribution of noise floor measures for the respective branches are computed (214) based on the estimated probability distributions. The method ends with provision (216) of load reference data based on the computed conditional probability distributions of the noise floor measures.

Abstract: A detection and response system including a set of algorithms for detecting within a stream of normal computer traffic a subset of (should focus on network traffic eliciting a response) TCP or UDP packets with one IP Source Address (SA) value, one or a few Destination Address (DA) values, and a number exceeding a threshold of distinct Destination Port (DP) values. A lookup mechanism such as a Direct Table and Patricia search tree record and trace sets of packets with one SA and one DA as well as the set of DP values observed for the given SA, DA combination. The detection and response system reports the existence of such a subset and the header values including SA, DA, and multiple DPs of the subset. The detection and response system also includes various administrative responses to reports.