Patent application number | Description | Published |
20110019571 | Method and Apparatus for Traffic Shaping - A method and apparatus for a traffic shaper that uses a traffic shaping algorithm based on a sustained rate token bucket and a constant rate emitter. The sustained rate token bucket uses a plurality of tokens based on the sustained rate and the sustained burst size. The constant rate emitter allows transmission of traffic at an adjusted transmission rate, where the adjusted transmission rate is derived from the peak rate, peak burst size, sustained rate and sustained burst size. | 01-27-2011 |
20130039178 | SCHEDULING UNDER CONGESTION WITH TRAFFIC LOAD-BASED SCALING - Apparatus and techniques for scheduling packets to reduce congestion in a packet data network are described. In one embodiment of the invention, packets are received through each of a plurality of channels and are stored in a respective queue for each channel. The status of each queue is monitored as empty or not empty. When an empty queue becomes not empty, then bandwidth allocation value is added for the respective channel to a port load value. When a not empty queue becomes empty, then the bandwidth allocation for the respective channel is subtracted from the port load value. The traffic rate through the port is then scaled based upon the port load value. | 02-14-2013 |
20130070592 | Proportional Bandwidth Sharing of the Excess Part in a MEF Traffic Profile - A method and apparatus to shape packet traffic rates of packets in-transit from a plurality of channels to a port, monitor a status of each queue, subtract a CIR from a port load value when an empty queue becomes active, add the CIR to the port load value when an active queue becomes empty, add a difference between an EIR and the CIR for a channel to a port excess value when a queue of the channel becomes excess, subtract the difference for the channel from the port excess value when the excess queue for the channel becomes not excess, calculate an oversubscription ratio based on the port load value and port excess value, calculate a shaping rate for each of the plurality of channels, and shape the traffic for each of the plurality channels using the shaping rate. | 03-21-2013 |
Patent application number | Description | Published |
20080222480 | ERASURE-RESILIENT CODES HAVING MULTIPLE PROTECTION GROUPS - A multiple protection group (MPG) erasure-resilient coding method for constructing MPG codes for encoding and decoding data. The MPG codes constructed herein protect data chunks of data in multiple protection groups and subgroups. In general, the MPG erasure-resilient codes are constructed by locating data chunks into multiple protection groups and assigning at least one parity chunk to each protection group. Basic MPG codes are constructed from existing Maximum Distance Separable (MDS) codes by splitting at least some of the parity chunks into local parities for each of the multiple protection groups and projecting local parities onto each of the groups. Generalized MPG codes have a Maximally Recoverable property that can be used to determine whether an erasure pattern is recoverable or unrecoverable. Generalized MPG codes can recover any erasure pattern that is recoverable. | 09-11-2008 |
20080222481 | MULTIPLE PROTECTION GROUP CODES HAVING MAXIMALLY RECOVERABLE PROPERTY - A multiple protection group (MPG) erasure-resilient coding method for constructing MPG codes for encoding and decoding data. The MPG codes constructed herein protect data chunks of data in multiple protection groups and subgroups. In general, the MPG erasure-resilient codes are constructed by locating data chunks into multiple protection groups and assigning at least one parity chunk to each protection group. Basic MPG codes are constructed from existing Maximum Distance Separable (MDS) codes by splitting at least some of the parity chunks into local parities for each of the multiple protection groups and projecting local parities onto each of the groups. Generalized MPG codes have a Maximally Recoverable property that can be used to determine whether an erasure pattern is recoverable or unrecoverable. Generalized MPG codes can recover any erasure pattern that is recoverable. | 09-11-2008 |
20090138618 | RATE-CONTROLLABLE PEER-TO-PEER DATA STREAM ROUTING - Difficulties associated with choosing advantageous network routes between server and clients are mitigated by a routing system that is devised to use many routing path sets, where respective sets comprise a number of routing paths covering all of the clients, including through other clients. A server may then apportion a data stream among all of the routing path sets. The server may also detect the performance of the computer network while sending the data stream between clients, and may adjust the apportionment of the routing path sets including the route. The clients may also be configured to operate as servers of other data streams, such as in a videoconferencing session, for example, and may be configured to send detected route performance information along with the portions of the various data streams. | 05-28-2009 |
20100146108 | RATE-CONTROLLABLE PEER-TO-PEER DATA STREAM ROUTING - Difficulties associated with choosing advantageous network routes between server and clients are mitigated by a routing system that is devised to use many routing path sets, where respective sets comprise a number of routing paths covering all of the clients, including through other clients. A server may then apportion a data stream among all of the routing path sets. The server may also detect the performance of the computer network while sending the data stream between clients, and may adjust the apportionment of the routing path sets including the route. The clients may also be configured to operate as servers of other data streams, such as in a videoconferencing session, for example, and may be configured to send detected route performance information along with the portions of the various data streams. | 06-10-2010 |
Patent application number | Description | Published |
20090164657 | APPLICATION AWARE RATE CONTROL - A “communications rate controller” provides various techniques for maximizing a quality of real-time communications (RTC) (including audio and/or video broadcasts and conferencing) over multi-hop networks such as, for example, the Internet. Endpoints in such networks generally communicate via a segmented path that extends through one or more routers between each endpoint. Maximization of conferencing quality is generally accomplished by providing in-session bandwidth estimation across segments of the network path between endpoints (i.e., communication/conference participants) in combination with a robust non-oscillating dynamic rate control strategy for maximizing usage of available bandwidth between RTC endpoints. Further, the dynamic rate control techniques provided by the communications rate controller are designed to prevent degradation in end-to-end delay, jitter, and packet loss characteristics of the RTC. | 06-25-2009 |
20090164762 | OPTIMIZING XOR-BASED CODES - A “code optimizer” provides various techniques for optimizing arbitrary XOR-based codes for encoding and/or decoding of data. Further, the optimization techniques enabled by the code optimizer do not depend on any underlining code structure. Therefore, the optimization techniques provided by the code optimizer are applicable to arbitrary codes with arbitrary redundancy. As such, the optimized XOR-based codes generated by the code optimizer are more flexible than specially designed codes, and allow for any desired level of fault tolerance. Typical uses of XOR-based codes include, for example, encoding and/or decoding data using redundant data packets for data transmission real-time communications systems, encoding and/or decoding operations for storage systems such as RAID arrays, etc. | 06-25-2009 |
20110299526 | MULTIPARTY REAL TIME CONTENT DELIVERY - Described is a distributed peer-assisted multicast content delivery system (e.g., a multiparty conferencing application) that uses an adaptive link rate control protocol to discover and adapt to an arbitrary topology quickly and converge to efficient link rate allocations allowed by an underlying network. Link rates are regularly obtained and used to determine trees for sending packets to other nodes. Network coding is used to implement data multicast so that mixtures (i.e., linear combinations) of the packets are transmitted in the network. The redundant packets may be differentiated from non-redundant (“innovative”) packets such that network conditions may be measured by link innovation and/or session innovation. | 12-08-2011 |
20130301606 | LOAD AWARE RESOURCE ALLOCATION IN WIRELESS NETWORKS - A technique for resource allocation in a wireless network (for example, an access point type wireless network), which supports concurrent communication on a band of channels, is provided. The technique includes accepting connectivity information for the network that supports concurrent communication on the band of channels. A conflict graph is generated from the connectivity information. The generated conflict graph models concurrent communication on the band of channels. A linear programming approach, which incorporates information form the conflict graph and rate requirements for nodes of the network, can be utilized to maximize throughput of the network. | 11-14-2013 |