Abstract: A system and method is provided for reducing the bandwidth of MPEG transport streams during transmission over a packet-switched network. The system and method identifies characteristics of a plurality of media fragments disposed within each of a plurality of packets of a transport stream, and aggregates the characteristics into a summary value for each of the packets. The summary value is correlated to a priority weighting identifiable by a network element. Each of the packets is marked with the priority weighting, so that the packets may be selectively dropped by a network element in accordance with their priority weightings to reduce the bandwidth of the transport stream.

Abstract: Apparatus are provided for managing hierarchically organized subscriber profiles. According to one embodiment, a router includes multiple virtual interfaces and a policy engine. The virtual interfaces define connections between the router and corresponding subscribers of a service provider. A first virtual interface is operable to receive packets from a first subscriber and to process the packets in accordance with a first-level profile identifier. The policy engine is coupled with the virtual interfaces and operable to de-reference subscriber profiles of the subscribers on behalf of the virtual interfaces based on a database of hierarchically organized profile identifiers.

Abstract: A scheduler associated with a base station of a wireless communication network dynamically compensates for uplink bandwidth that has been re-assigned (stolen) by a mobile station (MS) to transmit a control message. The scheduler allocates a preset amount of bandwidth to the MS for data transmission. The scheduler detects bandwidth stealing activity and evaluates when bandwidth stealing is justified on he part of the MS. The scheduler provides additional bandwidth to appropriately compensate for the stolen bandwidth when bandwidth stealing is justified, in order to maintain the quality of service of the data traffic connection.

Abstract: A topology database stores the number of RPR nodes which belong to an RPR network. A traffic rate measuring unit sends a variety of parameters for calculating a communication band available to a fairness controlled traffic packet to a fairness control unit. Upon detection of congestion, the fairness control unit calculates a communication band available for transmission of the fairness controlled traffic packet from the parameters sent from the traffic rate measuring unit, divides the communication band by the number of nodes to find an initial value for a fair rate.

Abstract: A pipeline scheduler provides a minimum bandwidth guarantee by transporting cells from an input port to an output port in a two-phased approach. Cells that conform to a minimum cell rate (MCR) are selected from queues at the input port and arranged into supercells for transport to the output port, followed by nonconforming cells, to guarantee fairness by using scheduling modules to build the supercells first for conforming cells, and then for nonconforming cells. Reservation vectors are used to permit the same time slot of the next frame to be reserved by a first queue, and the same time slot of the following time frame to be held for reservation by a second queue, to ensure equal time slot access by the first and second queues over successive time frames.

Abstract: An asynchronous speech data communication system, which is capable of making a hands-free phone conversation at a high speed without causing annoyance in a vehicle, and a communication method therefor are provided. A vehicle-mounted hands-free system includes a speech communication terminal having a speech data communication function, an access point for enabling communication using an asynchronous wireless LAN with other electronic devices, such as a PDA and a mobile audio, including the speech communication terminal, and a communication control section for limiting the packet size of data to be communicated of the other electronic devices when there is communication of speech data by the speech communication terminal.

Abstract: A communication technique enables the efficient transmission of data through a communication link having a large delay bandwidth product and/or a high bit error rate. The communication technique multiplexes data from one or more data sources through a plurality of communication connections to increase the overall throughput and to reduce the average data transfer delay of the communication link. Each communication connection has a set of communication connection parameters that may be uniquely configured so that each connection carries a particular type of data at a particular effective priority level. Each communication connection may be uniquely configured to have a particular sending buffer size, to deliver messages having a particular length to an underlying layer and to send the messages into the link at a particular rate to orchestrate the manner in which the communication connections send data through the link.

Abstract: A technique for delivering and enforcing network quality of service from a head-end to a plurality of outstations is disclosed. In one embodiment, the technique is realized by assigning a transmit duration for each one of the plurality of outstations by the head-end; and assigning a transmit frequency for each one of the plurality of outstations by the head-end; wherein bandwidth for each one of the plurality of outstations is adjusted dynamically at the head-end. In addition, a control message may be received from an outstation indicating extra capacity at the outstation where the extra capacity may be allocated for one or more of burst capacity and best effort traffic.

Abstract: The present invention is a method of doing business over a network that: receives a request for transmitting digital information after a start time and before an end time, determines the time required to transmit the digital information based on the number of packets in the information and the network speed, schedules a transmit time for the digital information, and accepts the digital information for transmission only if the time required to transmit is less than or equal to the difference between the transmit time and the end time. Pricing of the transmission can be determined by the priority of transmission, whether the information is transmitted the first time or rescheduled, and whether the user receives an acknowledgment.

Abstract: A method and apparatus for providing a distributed subscriber load distribution in networks are disclosed. For example, the method receives capacity data from a plurality of devices, and measures a peak period volume for each of a plurality of registered user equipment that is registered with one of the plurality of devices. The method determines whether a peak period volume of the one device reaches an on-set threshold of the one device, and selects one or more of the plurality of registered user equipment if the on-set threshold of the one device is reached, where a sum of the peak period volumes of the selected one or more plurality of registered user equipment is larger than or equal to a volume of traffic that is in excess of the on-set threshold, or in excess of an off-set threshold of the one device. The method sends a request for the selected one or more plurality of registered user equipment to be re-registered in accordance with the capacity data received from the plurality of devices.

Abstract: Methods and apparatus are provided for allocating resources in a distributed environment. The disclosed resource allocation techniques make resource allocation decisions when resources become available. A resource becomes available when the resource completes its previous work or becomes activated. Once it is determined that a resource has become available, the available resource is assigned to an appropriate request. The requests may be stored, for example, in a queue of requests. The available resource may be assigned to an appropriate request based on one or more predefined criteria, such as to service a request associated with a service class having the “greatest need.” The resources may be, for example, a plurality of call agents that are associated with a call center.

Abstract: Feature vectors for nodes in a network are computed based on a network metric. Clusters of the nodes are formed based on the feature vectors. A cluster head is selected for each cluster. Available bandwidths between the cluster head and nodes outside the cluster are determined. The available bandwidths between the cluster head and the nodes outside the cluster may be used as estimations of available bandwidths for the nodes in the cluster.

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 scheduling technique useful in a mesh network includes scheduling a selected amount of traffic in the mesh network using a linear program approach that minimizes a time for the selected amount of traffic to reach its intended destination. The linear program is subject to a plurality of constraints that insure that the selected amount of traffic will reach its intended destination within the minimized time. An example is disclosed that uses such a technique for a mesh network having a root node that is a base station for wireless communications and a plurality of child nodes that comprise subscriber stations. A disclosed example is useful for centralized scheduling in a Wimax mesh network.

Abstract: A method and apparatus for scheduling the data packets transmitted to a plurality of mobile terminals supporting multiple quality of service (QoS) grades in a multichannel wireless communication system includes a storage device for storing queues and data packets of the mobile stations, the queue and data packets of each of the mobile stations being arranged in an order of the quality of service grades; and a scheduler for allocating resources of multiple channels to the mobile stations based on different scheduling metrics separately applied to the multiple channels according to the quality of service grades, each of the scheduling metrics applied to a particular one of channels being used to select one of the mobile stations whose data packets are transmitted through the particular channel; wherein entire data packets of the mobile stations are transmitted through the multiple channels when the allocation of the channel resources has been completed sequentially for each of the multiple channels.

Abstract: Processes for the control of traffic and Quality of Service (QoS) over a switch fabric network comprised of application servers and virtual I/O servers. In the embodiment, an application server includes virtual device interfaces, a QoS module, and a network port controlled by a packet scheduler. When the QoS module receives a packet from a virtual device interface, the QoS module stores the packet in a queue. The QoS module removes the packet from the queue and transmits it to the packet scheduler, in accordance with a hierarchical token bucket that allocates bandwidth for the port among the virtual device interfaces in the application server. In the embodiment, the port is the root of the hierarchy for the hierarchical token bucket and the virtual device interfaces are the leaves. The packet scheduler uses round-round arbitration to transmit the packet it receives to the port.

Abstract: A network device includes multiple packet processing engines implemented in parallel with one another. A spraying component distributes incoming packets to the packet processing engines using a spraying technique that load balances the packet processing engines. In particular, the spraying component distributes the incoming packets based on queue lengths associated with the packet processing engines and based on a random component. In one implementation, the random component is a random selection from all the candidate processing engines. In another implementation, the random component is a weighted random selection in which the weights are inversely proportional to the queue lengths.

Abstract: VoIP traffic bandwidth through a router port is controlled so that it does not exceed a predetermined bandwidth to ensure a desired quality of service for all VoIP calls routed through the port. Information of a packet received by the port is extracted from a packet header. The information includes source and destination addresses and port numbers as well as the bandwidth used by the packet. If the packet is from an existing call, the packet is routed and the time the packet was received is updated. If the packet is from a new call, it is determined whether the port has sufficient bandwidth to route the new call. If the port has sufficient bandwidth, the packet is routed, bandwidth is allotted for subsequent packets from the new call, and the port information is updated to accept the subsequent packets. If the port does not have sufficient bandwidth, the packet is dropped.

Abstract: A flow classifier having a flow CAM having plural flow entries, a search key generator for generating a search key of a format which differs by a flow condition, and a table holding a flow search result corresponding to an address of respective flow entry of CAM, in which access is made to CAM by the search key of a variable format including at least one header information item extracted from a packet header and the flow search result is obtained from the table in accordance with the address of the flow entry coinciding with the search key outputted from CAM to thereby constitute high speed formation of flow classifying by a variety of flow conditions.

Abstract: Scheduling of packets is performed by a scheduler based on departure times. If wrap up of departure times is possible, departure times are transposed based on a zone associated with the last departure time. By using the zone to transpose in order to sort departure times, cycles of independent checks on each of the departure times are avoided.

Abstract: A quality of service for various classes of services for the transfer of electronic data packets is provided by establishing classes of packets for a customer and for assigning bandwidths to the classes for the customer. Accordingly, the amount of bandwidth for one type of service may vary from the bandwidth for another type of service over the same data connection. A device, such as an edge router of a network, may police the data packets being transferred by a customer to maintain the bandwidth being utilized by a given class of packets of the customer to within the assigned bandwidth for that class of the customer. The data packets may further be policed by core routers of the network may also to maintain the bandwidth being utilized by a given class of packets to within the assigned bandwidth for that class as specified by the service provider.

Abstract: A method for communication includes allocating target bandwidths to two or more packet sources and defining one or more of the packet sources as preferred sources. Quantum values defining maximum amounts of data to be sent during a single scheduling round are defined for the respective packet sources. Repetitive scheduling rounds are performed in order to determine a schedule for processing pending data packets produced by the packet sources. In each scheduling round, all pending packets that are produced by the preferred sources and are within the target bandwidths allocated to the preferred sources are scheduled. Pending packets produced by packet sources other than the preferred sources are scheduled in accordance with the quantum values, within the target bandwidths allocated to the packet sources other than the preferred sources. The pending packets are processed responsively to the schedule. The target bandwidths may comprise, for example, guaranteed bandwidths or excess bandwidths.

Abstract: An access control mechanism in a network connecting one or more sink devices to a server providing audio/visual data (A/V) in streams. As a sink device requests access, the server measures available bandwidth to the sink device. If the measurement of available bandwidth is completed before the sink device requests a stream of audio/visual data, the measured available bandwidth is used to set transmission parameters of the data stream in accordance with a Quality of Service (QoS) policy. If the measurement is not completed when the data stream is requested, the data stream is nonetheless transmitted. In this scenario, the data stream may be transmitted using parameters computed using a cached measurement of the available bandwidth to the sink device. If no cached measurement is available, the data stream is transmitted with a low priority until a measurement can be made. Once the measurement is available, the transmission parameters of the data stream are re-set.

Abstract: In a bus arbitration device that utilizes a resource use management device, upon detecting that a processor is permitted to access a memory, a detection unit decreases a counter by 1 and starts a timer, in a delay circuit, that is not in operation to count time. When the timer counts to a predetermined cycle time period, the delay circuit increases the counter by 1. A control unit permits the processor to access the memory, if the counter is larger than 0.

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: Disclosed is a system, apparatus, and method for dynamically estimating the bandwidth of a network link in a wireless network. The system includes at least one client device capable of receiving data over the wireless network and a server capable of transceiving data over a link of a wireless channel of the wireless network. The server identifies the at least one client device in the wireless network and identifies applications that are being utilized in the wireless network by the at least one client device, in which each application has an associated link between the server and the client device and an associated data stream transmitted over the link. The server passively estimates the bandwidth being used by an application over the link based upon measuring the throughput of the associated data stream and based upon determining channel utilization of the link.

Abstract: The present invention provides a technology for processing packets, such as VoIP packets, with priority. A priority-designating unit designates priority information based on header information. A pointer searching unit refers to a pointer table to obtain pointer information corresponding to a destination address. A sorting unit sorts the pointer information into a high-priority queue and a low-priority queue according to the priority information. A next queue holds pointer information obtained from a destination information table. A scheduler extracts and outputs the pointer information from each queue in the following order of priority: the next queue, a high-priority queue, and a low-priority queue.

Abstract: In a bandwidth management system and method for guaranteeing quality of service (QoS) in a Voice over Internet protocol (VoIP) network, bandwidth use information used to establish or terminate a call is provided, a bandwidth is reset when the bandwidth use information is provided, and available bandwidth information which is changed according to the reset bandwidth is reported.

Abstract: Numerous enhancements to metro Ethernet network (MEN) services include an enhancement of the overall MEN Quality of Service (QoS) architecture, an enhancement to classification at the provider edge, the use of Ethernet QoS classes, enhancements to policing and marking at ingress provider edge equipment, the provision of traffic management functions at egress provider edge equipment, the use of multiple Ethernet virtual connections (EVCs) and Aggregate EVCs, an enhancement to QoS across an external network-network interface and an enhancement to treatment of Ethernet service frames in a core network.

Abstract: The present disclosure provides a system and method for allocating bandwidth in remote equipment on a passive optical network (PON), wherein the system includes an optical line terminal (OLT), which monitors the acceptance of traffic requesting the PON remote equipment for service and configures through signaling control the parameters for the operation of classifying, shaping, and scheduling the traffic in the remote equipment, and a remote equipment which classifies, shapes, and schedules the accepted traffic based on the parameters configured by the OLT and allocates a proper bandwidth to the accepted traffic, and outputs the traffic in the scheduled order. The present disclosure helps ensure the bandwidth and delay requirements of individual traffic flows in the PON remote equipment are met and interaction between traffic of the same or different service class groups is eliminated.

Abstract: A method and system for combining requests for data bandwidth by a data source for transmission of data over a wireless communication medium is provided. A central node receives one or more bandwidth requests from one or more data sources via wireless communication. A scheduler then combines one or more bandwidths requests from the same data source to create a single data burst bandwidth. The central node then grants the data burst bandwidth to the appropriate data source via wireless communication.

Abstract: The disclosure relates to transfer of a user equipment from a network to another network. In the method a user equipment communicating with a first network is transferred from the first network to a second network providing resources to a plurality of operators. After initiation of the transfer, an operator is selected for the user equipment amongst the plurality of operators. A controller of the second network is then provided with information regarding the identity of the selected operator, and the user equipment is transferred to the second network. Information regarding the identity of the selected operator is also sent to the user equipment.

Abstract: An access control mechanism in a network connecting one or more sink devices to a server providing audio/visual data (A/V) in streams. As a sink device requests access, the server measures available bandwidth to the sink device. If the measurement of available bandwidth is completed before the sink device requests a stream of audio/visual data, the measured available bandwidth is used to set transmission parameters of the data stream in accordance with a Quality of Service (QoS) policy. If the measurement is not completed when the data stream is requested, the data stream is nonetheless transmitted. In this scenario, the data stream may be transmitted using parameters computed using a cached measurement of the available bandwidth to the sink device. If no cached measurement is available, the data stream is transmitted with a low priority until a measurement can be made. Once the measurement is available, the transmission parameters of the data stream are re-set.

Abstract: The adaptive bandwidth throttling system implements a graceful diminution of services to the clients by delaying a first class of services provided by a network server in response to the effective bandwidth utilized by this network server exceeding a first threshold. If the demand for the bandwidth by this network server exceeds a second threshold, the bandwidth throttling system escalates the throttling response and blocks the first class of services from execution and can also concurrently delay execution of a second class of services. The implementation of the throttling process can be varied, to include additional levels of response or finer gradations of the response, to include subsets of a class of services. In addition, the threshold levels of bandwidth used to trigger the throttling response can be selected as desired by the system administrator.

Abstract: Techniques for optimizing bandwidth usage while controlling latency. A latency mitigating congestion avoidance and control technique is described that is suitable for use with unreliable transport protocols. Embodiments of the present invention facilitate communication of data for applications that communicate using unreliable communication protocols and that would like to maximize use of available bandwidth but cannot tolerate high latencies. Techniques are described for preventing latency from exceeding a certain level, without destroying the ability of an application or system to probe for additional available bandwidth and maximize bandwidth usage.

Abstract: Measurement systems according to embodiments of the invention allow accurate bandwidth estimation even in non-FIFO scheduling and frame-level contention environments. In an embodiment of the invention, the approximate fraction of time that a link is idle is found by probing for idle periods (“gaps”). The fraction of idle time is then multiplied by the capacity to obtain an estimate of the available bandwidth. Gap time is estimated in an embodiment of the invention fraction by gathering samples of one-way delay (OWD) over the link in question. After the OWD is normalized and plotted, the knee in the cumulative distribution function (CDF) of OWD samples is used to identify the fraction of time that the channel is idle.

Abstract: A system that includes a network interface for receiving a packets from a network, a classifier operatively connected to the network interface that analyzes each of the packets and determines to which temporary data structure to forward each of packets, wherein the classifier analyzes each packet to determine with which of a plurality of protocols the packet is associated with. Each temporary data structure within the system is configured to receive packets from the classifier, wherein each of the temporary data structures is associated with at least one virtual serialization queue and wherein each of the temporary data structures is configured to store packets associated with at least one of the plurality of protocols. The at least one virtual serialization queue is configured to queue packets from the one of the temporary data structures associated with the at least one virtual serialization queue.

Abstract: The present invention is a method for releasing at least a part of a connection in a two-layer communication network that includes a first communication network layer adapted to establish or which establishes a communication channel to a terminal, and a second communication network layer adapted to establish or which establishes an application layer connection. The method includes deciding in one of the first and second communication network layers that at least the part of the connection associated with the terminal is to be released, and forwarding the decision from the one of the communication network layers in which the decision has been taken, to the other of the communication network layers via an interface between the first and second communication network layers.

Abstract: Switches within a telecommunications network exchange so-called available bandwidth messages, each of which advertises how much bandwidth remains unassigned on a respective link. The network is of a type in which circuits are provisioned with various predefined numbers of time slots (equivalent to bandwidth). The sending of an available bandwidth message for a given link is triggered by a change in the number of time slots available on that link if that change results in a change in the number of circuit bandwidths that can be accommodated by that link for a newly provisioned circuit.

Abstract: Embodiments of the present invention comprise methods and systems for managing and allocating bandwidth in a communication medium.

Abstract: Methods and apparatus for managing a pool of I/O interfaces associated with one or more I/O devices are disclosed. The I/O bandwidth utilization of the I/O devices is ascertained and compared with an upper threshold and a lower threshold. When the I/O bandwidth utilization is greater than the upper threshold, the resources provided by the pool of I/O interfaces are increased. When the I/O bandwidth utilization is less than the lower threshold, the resources provided by the pool of I/O interfaces are decreased.

Abstract: A packet processing apparatus includes a packet processing engine and a search engine connected through a bus having a bandwidth which is equal to or greater than a total transmission bandwidth of one or more receiving ports. The packet processing engine is configured to append a device internal header containing a search key to each of the packets, transfer the packets to the search engine through the bus, and receive the packets whose device internal headers are provided with search result information from the search engine through the bus. The search engine includes a packet buffer for temporarily storing the packets, a search processing part for performing search processing on the basis of the search key in the device internal header, and means for transferring the search result information from the search processing part and the packets stored in the packet buffer to the packet processing engine.

Abstract: A method and apparatus are provided for scaling an input bandwidth for bandwidth allocation technology. An original bandwidth count value of an input flow is received. A bandwidth scaler constant is provided and used for scaling the received original bandwidth count value to provide a scaled bandwidth value between zero and one. The scaled bandwidth value is stored and used for calculating a transmit probability for the input flow.

Abstract: Techniques for congestion control are disclosed. In one embodiment, a base station allocates a shared resource using a combination of zero or more individual grants and zero or more common grants, and generates a busy signal in response to loading conditions that exceed a pre-determined level. In another embodiment, a subset of transmitting mobile stations reduce their transmission rate in response to a busy signal. The subset may include autonomous transmission, commonly granted transmission, individually granted transmission, or any combination thereof. In various embodiments, rate adjustment may be probabilistic or deterministic. In one embodiment, a rate table is deployed, and a mobile station decreases or increases the transmission rate from one rate in the table to a lower or higher rate in the table, respectively, in response to the busy signal. Various other aspects are also presented.

Abstract: A method of allocating upstream bandwidth to at least a first upstream traffic flow and a second upstream traffic flow in a passive optical access network includes: a) associating a first timer to the first upstream traffic flow; and b) associating a second timer to the second upstream traffic flow.

Abstract: An out-of-band signaling model media control (MC) terminal for an HPNA network includes a QoS management entity (QME) and an admission control entity (ACE) and provides end-to-end QoS by passing the QoS requirements from higher layer to the lower layers of the HPNA network. The QME receives an end-to-end QoS message characterizing a session for a user application. The ACE performs an admission control decision relating to the session based on the end-to-end QoS message characterizing the QoS stream. A resource control module, when part of the ACE, performs at least one admission control decision relating to the session based on a resource permission, and a policy control module, when part of the ACE, performs at least one admission control decision relating to the session based on a policy permission.

Abstract: A step-wise approach to automatically determining the bandwidth of a communication channel includes dividing the channel's potential bandwidth into a number of ranges. An initial range is then selected and a series of data packets specific to the selected range are transmitted from a first endpoint to a second endpoint, with the second endpoint determining one or more channel metrics based on the transmitted packets (e.g., measured transmission rates). If the metrics indicate the current range accurately reflects the channel's bandwidth, a measured transmission rate of the transmitted data packets is used as the channel's bandwidth. Otherwise, another range is selected and the process is repeated. The described approach rapidly determines channel bandwidth, even when the channel between the two endpoints is asymmetric. Techniques described herein are particularly beneficial when used in conjunction with multimedia conferencing applications.

Abstract: A network system includes a first device and a second device separated by a network having asymmetric routes in which traffic forwarded in a first direction from the first device to the second device may travel a different route than traffic forwarded in a second direction from the second device to the first device. At least three intermediate processing devices are located between the first device and the second device, wherein at least two of the intermediate processing devices are located along different asymmetric routes. The intermediate processing devices intercept a communication flow between the first device and the second device, and encapsulate the communication flow within network tunnels so that communications associated with the communication flow in the first direction and the second direction are forwarded between a same set of at least two of the intermediate processing devices.

Abstract: In a network for forwarding user packets by a tunneling protocol, an egress edge node to which tunnels concentrate from a plurality of ingress edge nodes allocates a bandwidth to each of sessions multiplexed through each of the tunnels and notifies each of the ingress edge nodes of the allocated bandwidth, and the ingress node notifies private routers or terminal devices of the allocated bandwidth.

Abstract: A communications switch or router employs a replication server to perform batch processing of multicast connections. The replication server performs three distinct forms of processing using staging queues: packet arrival processing, packet replication processing, and per-interface transmission processing. Packet arrival processing queues arriving packets in session queues, adds new multicast sessions to a replication set, and assigns a counter equivalent to the fan-out of the multicast session. Packet replication processing assigns a descriptor to packets of each session in the replication set, and copies the descriptor to each per-interface queue. Per-interface transmission processing examines each descriptor in the per-interface queue, copies the corresponding packets for transmission by the interface, adjusts the counter as each packet is copied, and clears the packet in the switch based on the adjusted counter.