Abstract: Methods and apparatus for managing subscriber profiles are described herein. In one embodiment, the method includes receiving, from a requester, a request to determine an operation to be performed on a data packet. The method also includes determining profile identifiers associated with the requester, wherein the profile identifiers include, a first-level profile identifier associated with a lower-level profile identifier that defines the operation. The method also includes determining, based on the profile identifiers, that the operation should be performed on the data packet and transmitting an indication of the operation to the requestor, wherein the requestor performs the operation on the data packet.

Abstract: A method and apparatus for monitoring link diversity between two communication networks are disclosed. Physical diversity of communication links are important to guarantee service availability and reliability. Diversity monitoring can be achieved by using routing information of the communication links.

Abstract: This invention provides a tool for reliability evaluation and performance analysis of an IP backbone network by using the network packet loss ratio as the main measurement. A queuing model and algorithm is presented for calculating packet loss at congested interfaces or links. A reliability model is presented for considering network hardware component failures such as router failures, ATM switch failures, and physical link failures. Based on the measurement and models presented, a network reliability and performance (NetRAP) apparatus calculates IP network reliability and performance measurements. The NetRAP apparatus uses the network topology, a traffic matrix, and the reliability parameters of a network as inputs and calculates the network packet loss ratio and sigma score, and provides a list of heavily congested links under non-failure or different single failure conditions.

Abstract: When n mobile stations performing communications using a shared channel and m mobile stations performing communications using a dedicated channel are used in a mixed manner, necessary radio resources to satisfy the transmission data rate aimed by a mobile station performing communications using a shared channel are calculated, the quality of the shared channel is guaranteed, and call admission control of a dedicated channel is performed. An HS terminal allocation power calculation unit calculates necessary transmission power to satisfy the target transmission data rate by n mobile stations based on the radio channel quality and the target transmission data rate of the n mobile stations using a shared channel.

Abstract: A method is performed to optimize metrics associated with links of a network that is routed utilizing a shortest-path-first (SPF) routing method. The method includes identifying at least one failure scenario applicable to the network and identifying at least one bandwidth level scenario applicable to point-to-point demands routed through the network. A metric is automatically calculated for each of a plurality of links of a network, such that routings of demands through the network are optimized for the at least one failure scenario, and for the at least one bandwidth level.

Abstract: A network device includes a port, a buffer, a flow control module, and a service differentiation module. The port is configured to send and receive a packet, wherein the port is connected to a network entity. The buffer is configured to store the packet. The flow control module is configured to control the transmission of the packet within the network device. The service differentiation module is coupled with the buffer and the flow control module. The service differentiation module is configured to regulate storage of the packet in the buffer and to regulate the transmission of the packet from the network device to the network entity. The service differentiation module is also configured to determine excess bandwidth available within the network device and to allocate the excess bandwidth to transmit the packet to the network entity.

Abstract: A method for managing a call admission controller in a multi-hop wireless backhaul network is illustrated. The method provides a call access control mechanism in a multi-hop wireless backhaul network system by calculating at least one service quality parameter in the network and determining if service data transmitted from relay nodes is allowed to enter a gateway of the network according to the at least one service quality parameter. In exemplary embodiments of present invention, the service quality parameter includes a throughput, an average delay of packets, a number of remote devices, a packet loss rate, a number of the relay nodes, and an amount of service data of a specific class traffic in the network. A topology of the network may be a ring, a chain, or a tree topology, and a ripple protocol is utilized as media access control protocol in the network.

Abstract: The present invention is directed to using measurement packets to compute network performance. Embodiments that send, receive and both send and receive measurement packets are described. Some embodiments are described that compute statistics based at least partly on measurement traffic. Some embodiments are described that communicate computed statistics within measurement traffic. Some embodiments are described that rank and select paths based at least partly on computed statistics.

Abstract: Disclosed is an apparatus and method for granting guaranteed bandwidth between one or more data transmission priority requesting sources and one or more resources upon request. Data sources that do not request an assigned bandwidth are served on a “best efforts” basis. The system allows additional bandwidth to priority requesting sources when it is determined that the resource and/or the communication path to the resource is under-utilized. The system further allows the granted bandwidth to be shared by more than one source in a multiprocessor system.

Abstract: A method of bandwidth allocation for delivery of stored digital content from at least one server device to at least one client device by way of a network is disclosed. The method begins by prescribing a control variable which represents a target flow rate from the server device to each client device. Next, time-varying constraints on the flow rate of the content are determined. A cost function of the control variable for each client is determined. The cost function corresponds to a maximized value of the control variable. Finally, bandwidth is prescribed to each client based upon the value of the control variable maximized by the cost function. In this respect, the method achieves optimal allocation of bandwidth between the server and the respective clients.

Abstract: A management system accepts a connection request from a client computer to a server computer, acquires connection settings information, calculates a network bandwidth required for processing for connection from the client computer to the server computer, stores the connection request into a connection request processing queue, determines whether the processing for the connection from the client computer to the server computer can be performed or not, and notifies the client computer of a server identification number. The client computer issues a connection request to the server computer based on the received server identification number, and starts communication therewith. In spite of concentration of connection requests from a large number of client computers to server computers, the connection requests can be processed while controlling the communication data volume generated in a network at a point where the server computers are aggregated, so as to avoid occurrence of congestion.

Abstract: A method for implementing adaptive load sharing to balance network traffic. The method begins by identifying all paths in a network between a first provider edge and a second provider edge. Next determining jitter, packet delay, and packet loss for each identified path in the network. Then utilizing the jitter, packet delay, and packet loss values, calculating a usage value for each path in the network. The usage value corresponds to the percentage of all network traffic which a specific path in the network may manage. When data is received by the first provider edge, the provider edge selects the appropriate path for the data. The appropriate path being the path with the largest usage value which is currently not managing a percentage of the network traffic that is equal to its usage value.

Abstract: A method and apparatus for analyzing traffic arriving at and/or departing from a traffic aggregate defined as a given IP-related protocol, a given port associated with a given protocol, an IP address or subset of IP addresses, or by other traffic aggregation, during a given time interval, to determine whether there is a significant increase or decrease in traffic aggregate's traffic volume as compared to the traffic aggregate's expected traffic volume are disclosed. In one embodiment, the present method defines a traffic share ratio threshold associated with a given protocol or a given protocol port or a given IP address or a given subset of IP addresses or other traffic aggregation using said collected volumetric traffic data. The present method also defines a current traffic share, a baseline traffic share and a traffic share ratio to be evaluated for the said traffic aggregate.

Abstract: A buffer management method based on a bitmap table includes: dividing the bitmap table into a plurality of areas each containing at least one bit; determining and recording an idleness status of each of the areas in accordance with an unoccupied status of the bit in the area; and performing a management on a buffer address pointer in accordance with the recorded idleness status of each of the areas. The entire inventive procedure of allocating a buffer address pointer is fixed and easily controllable, and the RAM consumed for management on each buffer element including at least a 1-bit buffer space is approximately 1 bit, with a relatively fewer resources being consumed. The invention can enable that it takes two clock cycles on average to complete one procedure of allocating a buffer address pointer, and thus the efficiency in allocating and reclaiming a buffer address pointer is high, and the controllability during buffer management is improved.

Abstract: An ATM network traffic shaper is implemented in hardware. The traffic shaper shapes transmit data on one or more virtual circuits (VCs) according to the specified quality of service (QoS) parameters. Thus, the traffic shaper provides for the delivery of associated data cells in accordance with the specified QoS parameters. The traffic shaper is scalable in that the number of supported VCs can be increased with a relatively small increase in the size of the device and associated logic gates. The traffic shaper supports constant bit rate (CBR), variable bit rate (VBR), and unknown bit rate (UBR) service types and generates cell transmit requests with zero cell delay variation (CDVT). The traffic shaper also provides very high resolution in terms of bit rate specification. Varying shaping resolutions are achieved by varying a shaping interval time (SIT) generated by a SIT counter.

Abstract: An apparatus and method for dynamic assignment of classes of traffic to a priority queue. Bandwidth consumption by one or more types of packet traffic received in the packet forwarding device is monitored to determine whether the bandwidth consumption exceeds a threshold. If the bandwidth consumption exceeds the threshold, assignment of at least one type of packet traffic of the one or more types of packet traffic is changed from a queue having a first priority to a queue having a second priority.

Abstract: A technique for estimating the upstream bandwidth for a modem is provided. Various-sized packets are sent on roundtrip journeys through the modem. The roundtrip times for the various-sized packets are compared to provide an estimate of the modem's upstream bandwidth. Alternatively, a block file may be transmitted through the modem to a TFTP server. The TFTP server reports the time needed to complete the file transfer. Based upon the block file transmission start time and the completion time, an upstream bandwidth estimate may be performed. Given the upstream bandwidth estimation, non-VoIP upstream data traffic may be limited accordingly to provide a desired QoS to VoIP calls being supported by the modem.

Abstract: Dynamic rate limiting of background traffic to alleviate congestion in the access network is enabled. ICMP echo round-trip times and ICMP losses to a nearby node outside the local area and just beyond the divergence in end-to-end paths are measured, allowing unambiguous discrimination of nearby from distant congestion points. Using round-trip time samples, either short-run delay or short-run variance in delay can be measured to estimate congestion. When combined with an appropriate control law, background traffic can be rapidly reduced to allow interactive traffic to traverse unhindered through the access network. The described system and methods can be implemented in the application-layer and without any additional support from the network.

Abstract: According to the invention, a content delivery network (CDN) for delivering content objects over the Internet is disclosed. The CDN includes a point of presence (POP), a content object request interface, and a routing function. At least one POP is coupled to a plurality of full-route networks. The content object request interface receives requests for content objects for delivery to a number of end users using a plurality of terminal networks. The routing function that routes content objects in at least two modes, where a first mode routes content objects based upon a first route path chosen based upon delivery efficiency, and a second mode routes at least some content objects using a second route path when at least of a portion of the first route path reaches a level of use. The first and second route paths egress to different full-route networks.

Abstract: A method for scheduling channel usage for an over-the-air (“wireless”) network downlink is described. Information associated with incoming traffic and outgoing traffic to a node as associated with user equipment is obtained. The user equipment is capable of establishing a communication link with the node. The information obtained is placed in respective queues, which are each associated with the user equipment. A count level of the queues is obtained. An interval rate for the incoming traffic is determined. A receive rate for the user equipment is obtained. An incoming average rate for the incoming traffic is determined. An outgoing average rate for the outgoing traffic is determined. A proportion value is generated responsive to the incoming average rate, the outgoing average rate, the receive rate, and the interval rate.

Abstract: A method for improving performance of networking applications which receive network data from a computer network and which are executable on any one of a plurality of data processing means. The proposed method comprises the steps of establishing a data transfer connection between a first data processing means of the plurality of data processing means and the computer network; sending data on the data transfer connection by means of a given networking application of a plurality of networking applications, the given networking application running on a second data processing means of the plurality of data processing means; determining a quality measure of the data transfer connection from the sent data; and moving the given networking application to the first data processing means if the quality measure meets a predefined criterion.

Abstract: In one illustrative scanning and decoding method, a signal strength level of an RF signal on an RF channel is measured for a plurality of RF channels of an RF band. The act of measuring a signal strength level is repeated at least one time to obtain at least one other signal strength level of the RF signal. Subsequently, an averaging function is completed with use of the signal strength level and the at least one other signal strength level for identifying an averaged signal strength level of the RF signal. At least one optimal RF signal is then identified based on the averaged signal strength levels of the RF signals on the RF channels. In between the repeated acts of measuring signal strength levels of the RF signals, and prior to identifying the averaged signal strength levels, control information is decoded on at least one of the RF channels and stored in memory.

Abstract: Methods and apparatus are provided for applying color based policing at a network node. Committed information rate (CIR) and peak information rate (PIR) buckets used to monitor transmission rates are augmented using CIR overflow and PIR overflow buckets. The CIR and PIR overflow buckets hold tokens provided to CIR and PIR buckets that exceed the associated burst limits. Based on the availability of tokens and the color associated with a received packet, an action can be applied to the packet that promotes the color associated with the packet.

Abstract: A channel merging method for a VOD system, said method comprises the steps of: in response to requests from a plurality of clients for a video program, establishing a root channel (S1) and at least one sub-channel (S11), said root channel (S1) being established according to a request from a client that makes the earliest request, each of said sub-channels (S11) being established in response to a request from a client that makes a later request; and monitoring variation of the number of the clients that are using each of said established channels, and maintaining the channel if the number of the clients using the monitored channel is not zero, and closing the channel if the number of the clients using the monitored channel becomes zero.

Abstract: A method and system for providing acknowledgment and/or data rate control (DRC) information with respect to data packets conveyed on a plurality of active forward link (FL) carriers. The number of reverse link (RL) carriers employed for the acknowledgment and/or DRC information may be less than the number of active FL carriers, and may be a single carrier, even when the signaling protocol is, in the limit, consistent with presently-supported standardized CDMA protocols. Code multiplexing techniques are employed inventively to convey information for up to fifteen FL carriers on a single, standard CDMA channel designed to provide such signaling for only a single FL carrier at a time.

Abstract: A method for dormant data session reactivation may include a packet control function (118) in a radio access network (104) receiving a first data packet (150) having a source IP address (152), where the first data packet has a destination IP address (152) addressed to reactivate a dormant mobile station (102) coupled to the radio access network. The packet control function may receive a plurality of subsequent data packets (160) having the source IP address, where each of the plurality of subsequent data packets has a subsequent destination IP address (162, 164, 166) and a corresponding time stamp (163, 165, 167). For each of the subsequent destination IP addresses that are substantially sequential, evaluating an absolute value of a slope (270) of the difference between the subsequent destination IP addresses that are substantially sequential over a difference in the corresponding time stamps.

Abstract: Method for admitting new voice calls to a VoIP network. Various points in the network are polled to generate a link utilization parameter. Parameters denoting threshold values of link utilization in the network are compared to the link utilization parameter. A first comparison is made between a first (current) link utilization parameter and first and second link utilization threshold parameters. Then, a second comparison is made between the current link utilization parameter and a second (previous) value of link utilization. A calculation of new calls allowed into the network is performed based on these comparisons and whether the current level of link utilization is rising or falling when compared to a previous level of link utilization.

Abstract: A method for selecting Quality of Service (QoS) policy, the method including: setting QoS policy processing information in a QPH; receiving, by a QoS Manager (QM), a QoS request from a CP, selecting a QPH to provide QoS policy for a traffic stream according to the processing information of each QPH in a home network, and providing QoS policy to the traffic stream according to the QoS policy of the selected QPH. Through the method and the system of the present invention, the problem that only the QoS policy of the QPH specified by the CP or the default QoS policy can be used as the QoS policy of the traffic stream when multiple QPHs exist in the home network is solved.

Abstract: According to the present invention, methods and apparatus are provided to improve the Transmission Control Protocol (TCP) for data such as delay sensitive or bursty data. A maximum send window and a minimum send window are set to correspond to maximum and minimum bandwidth parameters associated with a network. Round trip times are monitored to adjust maximum send windows and minimum send windows. A variable rate shaper is also used to pace packet introduction onto the network.

Abstract: A method of selective dormant data session reactivation in a radio access network includes calculating an activation rate threshold as a function of a first plurality of packets received over a first time interval, where the first plurality of packets are coupled to reactivate at least one dormant mobile station. The second plurality of packets received in a second time interval are buffered, where each of the second plurality of packets has a destination IP address to reactivate the at least one dormant mobile station. An arrival rate of the second plurality of packets in the second time interval is compared to the activation rate threshold.

Abstract: Presented is a device for processing packets of flows on a network link. The device includes a scheduling module for scheduling packets in a queue in accordance with a fair queuing with priority algorithm.

Abstract: A method for use in a network device that uses a proportional/integral/derivative (PID)-type algorithm to compute one or more flow control parameters intended to achieve a target rate for a data flow.

Abstract: A system extends a bandwidth of bandlimited audio signals by analyzing bandlimited audio signals at a transmission cycle rate. The analyzer may obtain a bandlimited parameter at a transmission cycle rate. A mapping device or logic in the system obtains a wideband parameter based on the bandlimited parameter. An audio signal generator generates a highband and/or lowband audio signal based on the wideband parameter at the transmission cycle rate. In some systems, the bandlimited audio signal is analyzed at the transmission cycle rate. The highband and/or lowband audio signals and the combined wideband audio signal are generated at the transmission cycle rate.

Abstract: A call admission control technique allowing flexible and reliable call admissions at an ATM switch in the case of an ATM network including both QoS-specified and QoS-unspecified virtual connections is disclosed. In the case where a QoS (Quality of Service) specified connection request occurs, an estimated bandwidth is calculated which is to be assigned to an existing QoS-unspecified traffic on the link associated with the QoS-specified connection request. A call control processor of the ATM switch determines whether the QoS-specified connection request is accepted, depending on whether a requested bandwidth is smaller than an available bandwidth that is obtained by subtracting an assigned bandwidth and the estimated bandwidth from a full bandwidth of the link.

Abstract: A shaping apparatus comprising a plurality of buffer memories allocated for different flows, bandwidth control units associated with the buffer memories, and a read control unit, wherein each of the bandwidth control units issues a first frame output request based on a maximum allowed bandwidth and a second frame output request based on a minimum guaranteed bandwidth, and the read control unit selects a bandwidth control unit to be permitted for frame output execution out of bandwidth control units that are issuing the first or second frame output request, giving priority to the second frame output request.

Abstract: Disclosed are a method, upstream processing node, and computer readable medium for dynamically stabilizing a stream processing system. The method includes receiving at least one computing resource allocation target. The method further includes determining that an input data flow rate of at least one upstream processing element varies. The computing resource is dynamically allocated to the upstream processing element in response to the input rate of the upstream processing element varying. Data flow is dynamically controlled between the upstream processing element and at least one downstream processing element.

Abstract: The present invention is directed to methods and wireless communication devices that are configured to enhance communication capacity in a wireless network. In one aspect of the invention various scheduling processes and schedulers for the transmissions of data packets are disclosed. In another aspect of the invention, the selection of appropriate transmission rates to advertise by a common unit which provides wireless service to different types of wireless transmit receive units (WTRUs) is addressed.

Abstract: An InfiniBand™ network node includes a network interface, a system memory, a memory controller configured for controlling access to the system memory, and a processor. The network interface is configured for outputting data packets according to a prescribed flow control protocol that specifies flow control resources. The network interface also is configured for outputting a data flow interruption request to the memory controller based on a determined depletion of the flow control resources. The memory controller, in response to reception of the data flow interruption request, restricts access to the system memory. Hence, the processor, in response to detecting the restricted access to the system memory, reduces execution of a prescribed application resource based on the determined depletion of the flow control resources.

Abstract: Provided are apparatuses and methods in a digital broadcast transmission system for optimizing the buffering time of data streams prior to data consumption of playback. The optimal buffering time is calculated based on parameters from the server. The parameters may include the burst interval, buffering delay, the average size of data bursts, the amount of data in the buffer, the earliest timestamp and/or the latest timestamp.

Abstract: Prior to alteration of the communication route connecting the enterprise servers 51 to 53, ports a, b and c of the enterprise server 51 are each connected with port 1 of the storage system 7 through the communication route. When enterprise server 54 is connected with the storage system 7 in response to a new connection request, the communication port of the storage system 7 with which ports a, b and c are respectively connected through the communication route is altered to port 3. Due to this alteration, the enterprise server 544 can be connected through its port f via the communication route with the port 1 of the storage system 7, which was thus freed.

Abstract: A network troubleshooting framework is described. In an implementation, a method includes generating a first estimation of network performance by a simulator based on network settings obtained from a network, estimating the new performance under an alternative setting by providing the alternative setting to the network simulation and observing the simulation output, repeating the procedure for other alternative settings, and suggesting the alternative setting that improves network performance.

Abstract: A method to dynamically allocate credits for a particular port to port link based on measured link distance during the initial interswitch link configuration process. An apparatus implementing such method or a software upgrade to retrofit existing switches.

Abstract: Techniques to control data transmissions to efficiently utilize the available air-link resources. In accordance with a method for controlling a data transmission between a transmission source (e.g., a base station) and a receiving device (e.g., a remote terminal), a current transmission at a current data rate for a current transmission interval is received. An average throughput for the data transmission is then updated to reflect the current transmission at the current data rate. The updated average throughput is compared against a threshold throughput (which has been previously characterized) supported by the receiving device. If the average throughput exceeds the threshold throughput, the transmission source is signaled to (temporarily) stop the data transmission. Subsequently, after the average throughput has dropped below the threshold throughput, the transmission source can be signaled to resume the data transmission.

Abstract: A unified congestion notification mechanism can detect congestion at a recipient device either directly, such as via an explicit indicator, or indirectly, such as via dropped packets. Such congestion can then be indicated to the sending device either by leveraging an existing congestion notification mechanism, including by spoofing expected communications, or by creating a new congestion notification mechanism. Additionally, modifications to lossless protocols, such as TCP/IP can adapt them for use with streaming data while still implementing the unified congestion notification mechanism by eliminating retransmissions either as a result of the retransmission timeout or as a result of information conveyed as part of the acknowledgement packets.

Abstract: Managing addresses to be assigned to users of an IP network is described, in which it is detected that a packet has been addressed to a released address held in a queue for holding released addresses, and the held address to which the packet has been addressed is returned to the end of the queue.

Abstract: A method of accommodating legacy devices in which application memory is not able to operate fast enough to reliably receive data from a relay or other external device is disclosed. An application queue memory space is provided, either as a separate memory chip or as an area created and maintained by program code, to act as an intermediary between the slower application memory and the external device. This application queue memory space is preferably a transport stack.

Abstract: A method that measures ratio, relative to a peering network, of traffic burden of incoming traffic to traffic burden of outgoing traffic, where traffic burden takes into account traffic volume and distance that the traffic traverses through the network. A determination is made from this ratio as to whether an imbalance exists with the peering network. With the assistance of a simulation of changes in routing policy and their effects, an existing or impending imbalance is remedied by changing the routing policy relative to particular customers, for example from a “hot potato” routing policy to a “best exit” routing policy.

Abstract: JPEG-2000 data is formatted into RTP packets for transmission through the Internet. A priority field is provided in the format, and a value indicating the importance of a code stream included in a packet is stored therein. A type field indicates a payload type of a JPEG-2000 code stream. An mh_id field is provided as an identifier of a main header of the JPEG-2000 code stream and indicates a change in the main header. An mh_length field indicates the length of the main header and a fragment offset field stores the number of offset bytes from the start of an image of the packet.

Abstract: A system for and method of analyzing the performance of a packet-switched network, the network automatically generating a traffic log each time a packet enters or exits the network and each traffic log including at least the time the traffic log was created, the addresses of the packet sender and packet recipient, and the entry and exit network nodes. A server collects a plurality of traffic logs, parses the available information therein and generates a plurality of histograms, each histogram being based on information gleaned from the plurality of traffic logs. The histograms may be representative of packet traffic passing through a host connected to the network, packet traffic passing through a node in the network or the amount of data that travels over a link between two nodes of the network. To increase the delivery speed of the histogram data from the server to a client, the histograms are preferably stored as flat files to achieve direct and rapid access to stored data.

Abstract: The power budgeter controls the rate of data flow in a transceiver. The power budgeter monitors transceiver activity (data flow) during a predefined period, and limits transceiver data transmit and receive rates during times when the aggregate transceiver activity would otherwise exceed a predefined threshold. If total data flow during the monitored time period exceeds the threshold, data flow through the transceiver during the next (second) time period is limited. Data flow rates are limited in a transceiver by shutting off the transceiver (receiver and/or transmitter) for a specified portion of the second time period. In other types of transceivers, the transmitter and/or receiver may be forced into a low-power idle state or similar operating condition for a specified portion of the second predefined time period.