404 results about "Dynamic bandwidth allocation" patented technology

A method for providing network access to a shared access communications medium for a plurality of users includes the steps of conducting predictive admission control by arbitrating user requests for access to the shared medium based on predicted aggregate demands, conducting lookahead scheduling for use in making user channel assignments by forecasting schedule transmission opportunities one or more channels of the shared medium, and balancing load by making channel assignments such that a plurality users are each assigned a respective channel of the shared medium based upon a predicted need. Congestion parameters can predicted for each channel of the shared medium and mapped to a congestion measure using a mathematical function that takes into account packet loss rate, packet delay, packet delay jitter, and available capacity.

Methods for providing video on demand service from an Application Service Provider (“ASP”) to a user over a Regional/Access Network (“RAN”) are provided. A request for a video on demand application flow may be received from the user. In response to the request, information may be obtained from the RAN regarding the capabilities of the user's Customer Premises Equipment (“CPE”). A profile may then be forwarded from the ASP to the RAN that specifies at least one policy regarding the transmission of data associated with the video on demand application flow across the RAN. The data associated with the video on demand application flow may then be forwarded across the RAN in accordance with the profile. The RAN may also be provided a default profile that specifies default policies that apply with respect to video on demand application flows that are transmitted across the RAN prior to obtaining information from the RAN regarding the capabilities of the CPE of any specific user. The user specific profiles may then be used to alter one or more policies specified in the default profile.

A system capable of dynamically reserving bandwidth and adjusting bandwidth reservations for active sessions of data communication in a data communications device is provided. The system generally separates the operation of bandwidth allocation and adjustment from the operation of data transport through the device, thereby allowing bandwidth reservations and adjustments to be made without disturbing sessions of data communication that are actively being transported through the device. The system can accept requests to allocate or reserve bandwidth in a data communications device using bandwidth reservation protocols such as RSVP. The reservation requests create sender state data that can be used to compute resource allocation data. The resource allocation data can be used to label data storage locations in a data storage mechanism according to the required bandwidth reservations. A data scheduling apparatus, which is ignorant of particular sessions and specific amounts of reserved bandwidth, examines data and deposits data into data storage locations having a label corresponding to a session identification specified in the data, if any. If an unknown or no session identification is specified in the data, the data scheduler deposits data into a data storage location that is unlabeled or that has an unreserved label. Thus session bandwidth is determined by the percentage of labeled data storage locations for the session. Changes in bandwidth reservations are reflected in the separate operation of alterations made in the data storage labeling scheme, and do not affect the data scheduler, or data dequeuing mechanisms, thus allowing data sessions to continue without interruption during bandwidth adjustments.

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.

Methods, apparatuses and systems directed to improving the efficiency of bandwidth allocation schemes by adapting to slow-start mechanisms associated with network communications protocols, such as the TCP/IP protocol suite. In one implementation, the present invention scales down the initial target rate assigned to a data flow to a fraction of an initial estimate of the effective rate capacity of the communications path between two hosts. As packets are received, the target rate is gradually increased, eventually up to the detected rate capacity of the communications path. Implementations of the present invention improve the efficiency of bandwidth allocation by reducing the over-allocation of bandwidth to data flows during the slow-start phase, leaving more bandwidth available to other data flows.

A new concept of soft quality-of-service (soft-QoS) is developed that bridges the gap between the efficient provision of network-level QoS and the requirements of multimedia applications. Soft-QoS is defined by a satisfaction index (a number that rates users' perceptual quality) and a softness profile (a function that captures the robustness of multimedia applications to network congestion). Another aspect of this invention is a bandwidth allocation scheme for multimedia applications with soft-QoS requirements is presented. The implementation of the bandwidth allocation scheme on a network element realizes a soft-QoS controller. The controller uses the connections' softness profiles to compute a bandwidth allocation that maximizes the minimum satisfaction index of active connections.

A method of transporting a packet oriented client signal which uses a buffer-to-buffer flow control mechanism over a synchronous transmission network by assigning an arbitrary synchronous payload, where the synchronous payload bandwidth may be significantly smaller than the full bandwidth of the client signal. Flow control over the synchronous network is provided by the buffer-to-buffer flow control mechanism of the client signal to automatically regulate the data throughput to ensure no data can be lost. The method is independent of the Client Signal Data Rate and the provisioned SDH/SONET bandwidth, and SDH/SONET payload which may be non-concatenated, contiguously concatenated, or virtually concatenated. In particular, the method may be used to support the transport of Fibre Channel (1G, 2G and 4G), and ESCON (200M) in a synchronous payload.

A communication network includes a plurality of communication nodes, each of which can transmit data at a variable bandwidth. Each communication node predicts its own bandwidth requirements, and communicates its predicted own bandwidth requirements to the network. The nodes acquire bandwidth requirement information of other communication nodes on the network, and each one determines its own bandwidth allocation according to a common bandwidth allocation scheme. The common bandwidth allocation scheme is available to the plurality of communication nodes.

A computer-implemented method, apparatus, system, article of manufacture, and computer readable storage medium provide the ability to stream media content to multiple users. A first stream of/for the media content is streamed from a first location in the media content to a first user. A request is received from the first user to seek to a seek location (e.g., forward or backward) in the media content. A second location in the media content compatible with the seek location is determined. The second location is based on a second stream being streamed to one or more second users. The second stream is then streamed to the first user and the second user.

A network device and method include token buckets, each token bucket associated with one of clients and virtual ports and configured to process information based on a predefined bandwidth and a strict priority/weighted deficit round robin. A maximum rate shaper module and a minimum rate meter module shape and meter whether any of the clients or virtual ports have exceeded a predefined threshold. A scheduler is configured to schedule services of the clients and to calculate a new bandwidth allocation for at least one of the clients or virtual ports when the at least one of the clients or virtual ports has exceeded the predefined threshold, the new bandwidth allocation replacing the predefined bandwidth and being proportional to the predefined bandwidth for each of the clients or virtual ports.

Methods, devices, systems, and computer programs are provided that allow for optimally allocating bandwidth in an ad hoc, wireless network configured to support at least one guaranteed feasible flow allocation. According to some of these methods, devices, systems, Quality of Service guarantees may be provided across the network. Also, in many instances, the methods are iterative and allow for convergence to an optimized bandwidth allocation.

An approach is provided for utilizing dynamic bandwidth allocation for recording content. A recording manager generates a request for bandwidth for a future recording of a programming content to be delivered to a set-top box. The recording manager then receives a response indicating a dynamic bandwidth allocation for the future recording and schedules the future recording of the programming content based on the dynamic bandwidth allocation.

A dynamic bandwidth allocation method of an Ethernet passive optical network, comprises a predictor and a rule of QoS-promoted dynamic bandwidth allocation (PQ-DBA); the predictor predicts a client behavior and numbers of various kinds of packets by using a pipeline scheduling predictor consisted of a pipelined recurrent neural network (PRNN), and a learning rule of the extended recursive least squares (ERLS); the present invention establishes a better QoS traffic management for the OLT-allocated ONU bandwidth and client packets sent by priority.

A method, a Software-Defined Networking (SDN) controller, and a network include operation of a multi-layer SDN network and uniquely identifying streaming content on higher layers relative to the multi-layer SDN network through deep packet inspection; associating the streaming content to a multi-layer service on the SDN network; and monitoring the streaming content on the SDN network over the multi-layer service. This can include dynamically adjusting bandwidth of the multi-layer service utilizing OpenFlow on the SDN network based on the monitoring. The deep packet inspection can utilize a Bloom filter embedded in a resource identifier of the streaming content by the content provider, wherein the embedded Bloom filter is transparent to content players and does not require changes to storage on associated web servers for the streaming content.

Mechanisms for providing a subscriber-side interface with a passive optical network are described herein. An optical network termination (ONT) having an integrated broadband passive optical network processor is utilized to receive downstream data from an optical line termination (OLT) via a passive optical network and provide the contents of the downstream data to one or more subscriber devices via one or more data interfaces. Similarly, the ONT is adapted to receive and transmit upstream data from the one or more subscriber devices to the OLT via the passive optical network. The ONT preferably implements one or burst buffers for buffering upstream and/or downstream data. The ONT can be adapted to notify the OLT of the status of the burst buffer, thereby allowing the OLT to modify the bandwidth allocations.

The invention relates to optical communication field, discloses a collating device and method for dynamic bandwidth in source-free optical network, and the distribution method for dynamic bandwidth is transparent, which can satisfy the requirement for different service, improve the utilization rate of bandwidth, realize the fair distribution for bandwidth, good haleness, real time, and can distribute bandwidth for different port, and support to release offline bandwidth of ONU. The distributing device for dynamic bandwidth in source-free optical network includes ascending service active fiber network unit bit-mapping register, ascending service active port bit-mapping table, ascending virtual media accessing control sub-layer information table, descending virtual media accessing control sub-layer authorization information table; said distributing device for dynamic bandwidth, consults said fiber network unit active information, port active information and length information of sending data, according to preset priority of different service, process the service flow according to priority according to preset priority, and distributes the dynamic bandwidth for ports.

The present invention relates to a method, a system and an apparatus for implementing bandwidth allocation and scheduling management based on a relay station. A mapping information unit for controlling a RS (MAP_RS) is set in a frame structure of the physical layer of a BS and an extended frame structure of the physical layer of a BS is constructed in a frame structure of the BS physical layer. The BS constructs a mapping information message MAP_RS for controlling the relay station RS base on the extended frame structure of the BS physical layer, and performs bandwidth allocation and scheduling management of a communication channel of the RS by the RS according to the MAP_RS message. Through the present invention, a bandwidth allocation is implemented mainly at the BS, and a service scheduling is implemented mainly at the BS. The RS only performs an uplink or downlink scheduling of the RS passively. The complexity of the RS reduced effectively. The Multi-hop relay problem is solved using a bandwidth request relay and a bandwidth allocation relay, without introducing any complex technologies and procedures of the bandwidth request, the bandwidth allocation and the scheduling management. The complexity of the BWA relay network is simplified.

An adaptive weighted round robin scheduling apparatus and method schedules variable-length frame transmissions from a plurality of output queues having different transmission priorities by first allocating, for each queue, a number of bandwidth segments for a bandwidth cycle and a number of transmission opportunities for a round robin cycle, and then processing the queues consecutively in a round-robin fashion, beginning with a highest priority queue, until none of the queues has any bandwidth remaining. More specifically, during each iteration of a round robin cycle, a queue is permitted to transmit a frame if the queue has at least one remaining transmission opportunity, the queue has a frame ready for transmission, and the queue has at least one remaining bandwidth segment, and furthermore the number of transmission opportunities for the queue is decremented by at least one. Upon transmitting a frame, the number of bandwidth segments for the queue is decreased by the number of bandwidth segments in the frame. If a queue has no frame ready for transmission, then the queue may be either penalized, in which case the number of bandwidth segments for the queue is reduced, or forced to forfeit its bandwidth segments, in which case any remaining bandwidth segments are reallocated to other queues and the number of bandwidth segments and the number of transmission opportunities for the queue are set to zero.