| Entries |
| Document | Title | Date |
|---|
| 20080198744 | ACCESS CONTROL FOR PACKET-ORIENTED NETWORKS - The invention relates to a method for access control to a packet-oriented network. An admissibility check for a group of packets is carried out by means of a threshold value for the traffic volume between the network input node and the network output node for the flow. The transmission of the groups of data packets is not permitted when an authorisation of the transmission would lead to traffic volume exceeding the threshold value. A relationship between the threshold values and the traffic volume in partials stretches or links may be formulated by means of the proportional traffic volume over the individual partial stretches. Using the capacities of the links the threshold values for pairs of input and output nodes can be fixed such that no overload occurs on the individual links. Within the above method a flexible reaction to the drop-out of links can be achieved by means of a resetting of the threshold values. Furthermore the inclusion of other conditions is possible, for example relating to the capacity of interfaces to other networks or special demands on transmission of prioritised traffic. | 08-21-2008 |
| 20080205269 | METHOD AND SYSTEM FOR REROUTING TRAFFIC - A traffic rerouting method for rerouting traffic to be passed to a receiving end from an old path to a new path includes rerouting the traffic by reducing the amount of traffic passing through the old route while at the same time increasing the amount of traffic passing through the new path. | 08-28-2008 |
| 20080212470 | METHOD FOR APPLICATION LAYER SYNCHRONOUS TRAFFIC SHAPING - A method, a system, and a computer program product implements traffic shaping by processing as a synchronous request, tasks representing one or more units of work contained within the request. Before a request is sent through the network, the request is inspected in order to derive the amount of work that the request would generate in the network. A traffic manager queries the amount of work in that request compared to the amount of work that the network can support and generates a number of traffic envelopes. Based on the results of this query, “task pruning” may be implemented to break the request into smaller manageable task that fit into the traffic envelopes. Task pruning may also enable only a subset of the work to be performed. Thus, a measure of the amount of work, rather than the amount of data, within a request is considered when scheduling the request. | 09-04-2008 |
| 20080225710 | Systems and Methods for Load Balancing Based on User Selected Metrics - The present invention provides improvements to load balancing by providing a load balancing solution that allows a user to select metrics, weights and thresholds from metrics collected or determined by a load balancing appliance as well as metrics obtained from another device, such as a server running the service. The systems and methods described providing a load balancing technique in which load balancing decisions can be made based on metrics known by another device monitoring such metrics. The load balancing appliance uses a network management protocol and communication model, such as a Simple Network Management Protocol (SNMP), to identify and collect metrics from a server, service or other device. These metrics are available on the load balancing appliance with appliance determined metrics. Via a configuration interface of the appliance, a user can select one or more appliance determined metrics and/or the metrics obtained via the network management protocol to determine the load of a service. | 09-18-2008 |
| 20080225711 | DYNAMIC RESPONSE TO TRAFFIC BURSTS IN A COMPUTER NETWORK - In one embodiment, a node receives traffic sent from one or more sources toward one or more destinations (e.g., Multipoint-to-Point, MP2P traffic). The node may detect a burst of received traffic based on one or more characteristics of the burst traffic, and, in response, may dynamically apply traffic shaping to the burst traffic. The traffic shaping is adapted to forward burst traffic received below a configurable threshold at a configurable pace and to drop burst traffic received above the configurable threshold. In addition, the node may also store the burst traffic dropped by traffic shaping, and forwards the stored burst traffic toward its destination after a configurable delay. | 09-18-2008 |
| 20080225712 | Policy enforcement points - A policy enforcement point (PEP) attaches to the edge of a network to manage loading when the network nears or exceeds its capacity due to changes in the network, e.g., component failures or incremental growth. Autonomous PEP's at the network's edges provide short-term, application-aware controls on their own that are applied to the corresponding network ingress traffic. Path tables are used to calculate whether particular PEP's can admit more traffic, or should they shed sessions/calls to keep service up for the existing application traffic. Long-term controls are periodically downloaded as admission tables from a session/call admission controller to the PEP's. | 09-18-2008 |
| 20080259792 | Packet shaping for mixed rate 802.11 wireless networks - A method of shaping data packet transmissions by nodes in a wireless network is presented. Each node sets a maximum limit for MAC service data unit size based on data rate so that maximum transmission times for data packet transmissions by all of the nodes are approximately the same. | 10-23-2008 |
| 20080259793 | Network traffic control in peer-to-peer environments - A method and an electronic unit are disclosed for controlling traffic on a network, especially for controlling peer-to-peer related traffic. A filter unit is intercepting messages related to peer-to-peer application from a network line, irrespective of the messages' destination, A control logic then manages a request represented by an intercepted message subject to its content and subject to peering specific information. | 10-23-2008 |
| 20080267065 | STRUCTURE FOR A MULTI-SCALE NETWORK TRAFFIC GENERATOR - A design structure embodied in a machine readable storage medium for at least one of designing, manufacturing, and testing a design is provided. The design structure includes a network traffic generation system. The system can include a Markov modified Poisson process (MMPP) model, a packet scheduler coupled to the MMP model, a data store of transition windows defined for different defined scales, traffic generation parameter computing logic comprising program code enabled to compute traffic generation parameters for different scales according to respective states identified within different transition windows in the data store for the different scales, and a packet transmitter coupled to the packet scheduler. | 10-30-2008 |
| 20080279099 | High Capacity Scheduler - A first interface for receiving downlink data packets from a core network, a second interface for transmitting data packets to user entities, a processor comprising a scheduler, a first memory partition comprising and parameter data pertaining to a first subset of allocated priority queues, a second memory partition comprising parameter data pertaining to a second subset of allocated priority queues, is provided. The processor is transferring parameter data between the first and second memory partitions, and vice versa, whereby parameter data for priority queues having no data packets in corresponding buffers is prioritized for being transferred to the first memory partition, parameter data for priority queues having data packets in corresponding buffers is prioritized for being transferred to the second memory partition, the processor performing scheduling based on a selection of priority queues whose parameter data is residing in the second memory partition. | 11-13-2008 |
| 20080285444 | METHOD AND SYSTEM FOR MANAGING MULTIMEDIA TRAFFIC OVER ETHERNET - Aspects of a method and system for managing multimedia traffic over Ethernet are provided. In this regard, multimedia traffic comprising one or more Ethernet frames may be identified via one or more headers comprising the frames and processed according to the identification. In this regard, general Ethernet traffic may be multiplexed into egress frames based on the identification. Similarly, ingress Ethernet frames may be demultiplexed into multimedia traffic and general traffic based on the identification. Headers utilized to identify and/or route multimedia traffic and general traffic may comprise Ethertype and/or subtype fields. Headers utilized to identify and/or route multimedia traffic and general traffic may comprise a connection identifier field. Similarly, Headers utilized to identify and/or route multimedia traffic and general traffic may comprise a data type field. | 11-20-2008 |
| 20080285445 | Packet Load Shedding - Methods, apparatuses and systems directed to enhanced packet load shedding mechanisms implemented in various network devices. In one implementation, the present invention enables a selective load shedding mechanism that intelligently discards packets to allow or facilitate management access during DoS attacks or other high traffic events. In one implementation, the present invention is directed to a selective load shedding mechanism that, while shedding load necessary to allow a network device to operate appropriately, does not attempt to control traffic flows, which allows for other processes to process, classify, diagnose and/or monitor network traffic during high traffic volume periods. In another implementation, the present invention provides a packet load shedding mechanism that reduces the consumption of system resources during periods of high network traffic volume. | 11-20-2008 |
| 20080285446 | SYSTEM DIRECTING FLOW OF PACKETS BY-PASSING POLICY-BASED APPLICATION FOR PROCESSING BY POLICY ENGINE ACCORDING TO ACTION SPECIFICATION IN POLICY CACHE - A hardware-based policy engine that employs a policy cache to process packets of network traffic. The policy engine includes a stream classifier that associates each packet with at least one action processor based on data in the packet, and the action processor further acts on the packets based on the association determined by the stream classifier. | 11-20-2008 |
| 20080291827 | Systems and methods for dynamic quality of service - Systems, methods, and apparatus for routing are provided in which a connection track comprising a plurality of network or transport layer packets, received by a router, is identified by examination of header fields of one or more first packets in the plurality of packets. One or more quality of service (QoS) parameters is associated with the connection track by determining whether the track encodes a data type by (i) an identification of a predetermined application protocol used within the one or more first packets and/or (ii) a comparison of a payload of one or more packets in the plurality of packets to known data type formats. A first QoS parameter is set to a first value in a first value range when the connection track contains the first data type. The connection track is routed through the router in accordance with the one or more QoS parameters assigned to the connection track. | 11-27-2008 |
| 20080310303 | QUALITY OF SERVICE INFORMATION CONFIGURATION - Quality of service information can be used to facilitate wireless communication. A network entity, such as a terminal, as well as a network can initialize an authorization to establish a link using quality of service information. Various features can be integrated with the use of quality of service information, such as having quality of service reservation before a call and supplying a permanent identity for use in correlation. | 12-18-2008 |
| 20080316924 | SHAPING DEVICE AND ROUTER DEVICE - A shaping unit includes FIFOS for accumulating a packet which is so designed as to arrive at a destination address. A packet (ordinary packet), which has one destination address, is accumulated into the FIFO corresponding to the one destination address. A packet (virtual multicast packet), which will be copied in the downstream of the shaping unit then to arrive at two destination addresses, is accumulated into either of the FIFOS. A packet read unit transmits the virtual multicast packet, which is read from either of the FIFOs, and the ordinary packet, which is read from the one of the FIFOS, to a multiplexing circuit in such a manner that total bandwidth of both packets is controlled. | 12-25-2008 |
| 20090003206 | BANDWIDTH-BASED ADMISSION CONTROL MECHANISM - A device generates a service protection factor (SPF | 01-01-2009 |
| 20090003207 | Wireless performance improvement via client-free forward error correction - Packets are duplicated, delayed, and spread in time as a form of forward error correction. If a client device receives duplicate packets, they can be discarded. If one of the duplicate packets is lost, then the duplication provides forward error correction with no change to the device that receives the packet. | 01-01-2009 |
| 20090003208 | METHOD AND APPARATUS FOR MAINTAINING AN ALWAYS-ON DATA SESSION IN A WIRELESS COMMUNICATION NETWORK - Techniques for maintaining an always-on data session for an access terminal are described. Messages to keep alive the data session may be sent using non-traffic channels to avoid bringing up traffic channels just to send these messages. In one design, an access network may send a first message (e.g., a RouteUpdateRequest message) on a first non-traffic channel (e.g., a control channel) to the access terminal. The access terminal may return a second message (e.g., a RouteUpdate message) on a second non-traffic channel (e.g., an access channel) to the access network. The access network may then send a third message (e.g., for an Echo-Request) on the first non-traffic channel over a smaller area covering an approximate location of the access terminal, which may be determined based on the second message. The access terminal may return a fourth message (e.g., for an Echo-Reply) on the second non-traffic channel to the access network. | 01-01-2009 |
| 20090010157 | FLOW CONTROL IN A VARIABLE LATENCY SYSTEM - A device and method for packet flow control is described. The method may comprise, at a packet sender device, adding a flow control identifier to a packet and transmitting a packet with the packet flow control identifier to a packet receiver device over a data path. Thereafter, the packet receiver device may receive, from the packet receiver device, flow control data that includes a received flow control identifier generated in response to the sent flow control identifier. The sent flow control identifier may then be compared with the received flow control identifier and a state of a receiver buffer at the receiver packet device may be estimated based on the comparison. In an example embodiment, at the packet sender device, a flow control instruction may be added to the packet to instruct the packet receiver device to enter a “no transmit” state. | 01-08-2009 |
| 20090034414 | COMMUNICATIONS NETWORK AND MANAGEMENT ARBITRATOR - A method, information processing system, and network that expands safety network coverage for first responder safety within a building environment. Activity of at least one independent network (106) is monitored. The independent network (106) includes at least a safety network. An emergency signal is received from the at least one independent network (106). Communication between at least the safety network (106) and a First responder network (110) is automatically bridged in response to receiving the emergency signal so as to manage data control and bandwidth allocation between the safety network and the first responder network. Other networks that may also be bridged with the first responder network so as to manage data control and bandwidth allocation among the various networks include IT networks and building automation networks in order to expand first responder network coverage. | 02-05-2009 |
| 20090040926 | System and Method of Traffic Inspection and Stateful Connection Forwarding Among Geographically Dispersed Network Appliances Organized as Clusters - A peering relationship among two or more network appliances is established through an exchange of control messages among the network appliances. The peering relationship defines a cluster of peered network appliances, and at each network appliance of the cluster traffic flow state information for all the network appliances of the cluster is maintained. Network traffic associated with traffic flows of the network appliances of the cluster is managed according to the state information for the traffic flows. This managing of the network traffic may include forwarding among the network appliances of the cluster (i.e., to those of the appliances handling the respective flows) at least some of the network traffic associated with one or more of the traffic flows according to the state information for the one or more traffic flows. The traffic flows may be TCP connections or UDP flows. | 02-12-2009 |
| 20090046582 | BEAMFORMING OF CONTROL INFORMATION IN A WIRELESS COMMUNICATION SYSTEM - Techniques for sending traffic data and control information in a wireless communication system are described. In one design, a transmitter (e.g., a Node B or a UE) may perform beamforming to send traffic data on M layers based on a precoding matrix, where M may be one or greater. The transmitter may also perform beamforming to send control information on up to M layers based on the same precoding matrix used for the traffic data. The transmitter may send the beamformed traffic data on a first physical channel and may send the beamformed control information on a second physical channel. The transmitter may multiplex the beamformed traffic data and the beamformed control information using time division multiplexing (TDM) or frequency division multiplexing (FDM). | 02-19-2009 |
| 20090052319 | RESERVATION BASED MAC PROTOCOL - Embodiments describe scheduling communication in an ad hoc multihop network. Included is a reservation based Medium Access Control (MAC) protocol that has resources scheduled along the path from source to destination. Admission control is performed on a per-hop basis and a decision is made, in a distributed manner, if enough resources exist along the multihop path to admit a new communication. | 02-26-2009 |
| 20090067328 | AUTOMATIC ADAPTIVE NETWORK TRAFFIC PRIORITIZATION AND SHAPING - A local area network includes computers and peripherals networked in a high-speed LAN with access to a WAN through a slower connection via a broadband modem. A LAN gateway device manages data traffic between the local computers and peripherals and between the LAN and the WAN. The LAN gateway device provides multiple features, such as wired or wireless links, security, firewall, NAT, DCHP, traffic management, and the like. Traffic management features include an automatic quality of service priority classification scheme. A quality of service module automatically assigns priorities to the data streams based on analysis of the data packets. A configuration access list can be provided with pre-configured priorities for some streams. Initially, all streams are given highest priority and subsequently the priority is automatically adapted to the results of the packet analysis. Traffic shaping techniques control the LAN gateway upstream output and enable IP fragmentation of TCP packets according to measured upstream channel conditions. | 03-12-2009 |
| 20090097402 | AUTOMATIC QUALITY OF SERVICE CLASS MANAGEMENT - To enhance quality of service management in support of application sessions running on top of bearer services, according to the present invention it is suggested to, firstly, execute a bearer service analysis in support of automatic quality of service class management. Heretofore, a bearer service carrying packet switched service traffic in support of an application session is analysed for identification of different types of services by the application session. Related analysis information derived at an analysis unit | 04-16-2009 |
| 20090109846 | Priority-aware hierarchical communication traffic scheduling - Priority-aware hierarchical communication traffic scheduling methods and apparatus are disclosed. Communication traffic is scheduled by schedulers. Each scheduler supports a multiple priority scheduling function to schedule communication traffic having any of multiple priorities. The communication traffic scheduled by the schedulers is further scheduled based on the priorities of the communication traffic scheduled by each of the schedulers. Traffic shaping may also be integrated into a hierarchical scheduler. The priority-aware further scheduling and the optional shaping may be implemented, for example, using multiple Active lists, one per traffic priority, and a Pending list to which a scheduler can be added if it has communication traffic to schedule but is not allowed to schedule that traffic due to the shaping. | 04-30-2009 |
| 20090129266 | Network Connection System and Traffic Shaping Method for Facilitating Shaping Traffic even in Network which Accommodates Lines Based on Different Protocols - A packet scheduling apparatus corrects an overhead amount between a DSL rate and a packet rate, converts DSL rate information to the packet rate, and shapes the IP packets from the Internet such that the IP packets are delivered at a transmission rate equal to or lower than the packet rate. An IP/ATM converter converts the IP packets from the packet scheduling apparatus to ATM cells. A DSL multiplexer has a DSL current rate detector for supplying DSL rate information indicative of a currently set DSL rate, and transmits the ATM cells from the IP/ATM converter or the IP packets from the packet scheduling apparatus to user terminals through DSL processing using telephone lines. | 05-21-2009 |
| 20090141628 | Quality of Service for iSCSI - A system adapted to provide quality of service (QoS) for an iSCSI environment including one or more initiators and one or more targets. Each initiator includes an iSCSI initiator and a TCP layer. The iSCSI initiator includes a QoS shaper for shaping one or more iSCSI PDUs according to QoS policies. The TCP layer includes a QoS marker for marking the PDUs according to the QoS policies. The target includes a first and second QoS component. The first QoS component is in an iSCSI target and handles I/O resources. The first QoS component shapes read commands and write commands according to QoS policies. The second QoS component is in a TCP layer and handles network resources. iSCSI PDUs are shaped and marked according to QoS policies of iSCSI. The QoS policies used by the initiators and targets include policies for network resources and policies for I/O resources. | 06-04-2009 |
| 20090161541 | RESOURCE ALLOCATION PLAN IN A NETWORK - A method and Resource Allocation Manager Entity for obtaining an improved resource allocation plan for the network. Traffic requests currently exist in a network, each of which having a source, a destination and at least one Quality of Service (QoS) requirement being represented by a QoS value. For each traffic request, at least one potential path consisting of a plurality of links is computed. An iteration matrix is generated having the potential path on first axis, the links on second axis and the QoS requirement on third axis. The iteration matrix is filled by, for each of potential path, distributing the QoS value of the QoS requirement over the links for enabling a gradient space calculation method on the iteration matrix. The gradient space calculation method is applied to the iteration matrix until an iteration marker thereof indicates that the iteration matrix contains the improved resource allocation plan. | 06-25-2009 |
| 20090190470 | TRAFFIC SHAPING METHOD AND DEVICE - There are provided a distribution unit for classifying traffics into group/user/class units, a transmission point-in-time processing unit for calculating available frame rate from peak-frame-rate/minimum-frame-rate/weight set for each user, and managing a transmission schedule point-in-time, a scheduling control unit for controlling a scheduling in accordance with the transmission schedule point-in-time, a user/group/line's each peak-frame-rate control unit for performing a shaping of the traffics at each peak frame rate of the user/group/line, and a priority-control processing unit for carrying out an inter-groups priority control. | 07-30-2009 |
| 20090190471 | Method and Apparatus for Optimized Session Setup with Network-Initiated QoS Policy Control - Apparatus and methods operable by a network in configuring quality of service (QoS) for an access terminal are operable to receive, at a network, a request for packet data access from an access terminal. The apparatus and methods are further operable to determine, at the network and based on establishment of the packet data access, an initial QoS policy configuration for at least one reservation link corresponding to at least one application on the access terminal, wherein the initial QoS policy configuration is based on preconfigured information and comprises initial QoS parameters for the at least one application. Additionally, the apparatus and methods are operable to establish the at least one reservation link with the access terminal, prior to initiation of the at least one application on the access terminal, wherein the at least one reservation link includes the initial QoS parameters for the at least one application. | 07-30-2009 |
| 20090196174 | VIRTUAL SCHEDULING IN HETEROGENEOUS NETWORKS - Providing for virtual management of wireless resources in a mobile communication environment is described herein. By way of example, access terminals in the communication environment can maintain connections with nearby network transmitters and report factors pertinent to wireless scheduling to a central entity, such as a macro base station. The macro base station can employ those factors in improving wireless communications for other serving cells within or near to a macro coverage area served by the macro base station. By maintaining information pertinent to prevailing wireless conditions, quality of service requirements, pilot signal reports, mobility management considerations, and so on, of transmissions within the cell, significant interference reduction can be implemented for the macro coverage area, or nearby coverage areas. | 08-06-2009 |
| 20090196175 | METHOD AND APPARATUS FOR INITIALIZING, PRESERVING, AND RECONFIGURING TOKEN BUCKETS - A method and an apparatus are provided for initializing token buckets to a non-zero value, preserving the token buckets during a medium access control (MAC) reset or handover, resetting the token buckets based on a minimum bucket size or ratio of sizes, and transmitting a token status report. | 08-06-2009 |
| 20090196176 | BANDWIDTH CONTROL APPARATUS AND BANDWIDTH CONTROL METHOD - A policer sets in advance, with respect to tokens consumed with the passage of arriving packets, a threshold for each bandwidth usage rate (for each rate order ranked by the bandwidth usage rate) to be compared with the remaining amount of tokens at packet arrival time to determine whether to discard an arriving packet. Determining that the remaining amount of tokens at the arrival of a packet is less than a threshold set for the bandwidth usage rate (rate order) of a class (network flow) where the arriving packet belongs, the policer discards the arriving packet. | 08-06-2009 |
| 20090207730 | SCHEDULING POLICY-BASED TRAFFIC MANAGEMENT - Various traffic management techniques may be employed in a multi-hop wireless communication system. For example, a decision to transmit data to another node may be based on whether that node is able to effectively transmit its data. A decision to transmit an interference management message may be based on the amount of data a parent node may transmit. A decision to transmit an interference management message may be based on how effectively data is being transmitted. A weight may be assigned for an interference management message based on a traffic scheduling policy. | 08-20-2009 |
| 20090252035 | Packet relaying apparatus and packet relaying method - A packet relaying apparatus includes queues holding packet information, and queue control units controlling dequeueing. The dequeueing means transmission of packet information from a queue of a previous stage to a queue of a next stage. The packet relaying apparatus further includes a packet information control unit that, on receiving packet information to be dequeued at the time of dequeueing, returns discard information and data volume corresponding to the received packet information, a first bandwidth adjusting unit that, on determining that the received packet has been discarded, discards the packet information, maintains a usable bandwidth, and transfers the discard information and the data volume to the previous stage, and a second bandwidth adjusting unit that, on receiving the discard information and the data volume from the next stage, adds the data volume to the usable bandwidth and transfers the discard information and the data volume to a previous stage. | 10-08-2009 |
| 20090279430 | FEMTO CELL ACCESS POINT PASSTHROUGH MODEL - The subject innovation provides system(s) and method(s) to supply fixed, differentiated quality of service (QoS) for packetized traffic (e.g., voice and data) intended for femto cell coverage when transmitted concurrently with external broadband traffic. Quality of Service differentiation is supplied without an external implementation. Femto cell coverage is prioritized over concurrent packetized traffic to deliver a rich user experience for delay and jitter sensitive applications. A passthrough configuration for a femto access point (AP) facilitates supplying hard QoS for data packet streams, or flows, intended for femto cell coverage or non-femto-cell coverage. The femto AP receives a consolidated packet stream through backhaul link(s) and distinguishes flow(s) for femto coverage and flow(s) for auxiliary broadband coverage. The femto AP routes the flow(s) intended for femto with hard QoS according to QoS policy which can be determined by a network operator or a subscriber. | 11-12-2009 |
| 20090296577 | METHOD AND APPARATUS FOR END-TO-END NETWORK CONGESTION MANAGEMENT - The invention provides a method and apparatus for network congestion management. The method includes inserting a probe frame into data traffic in the network from a first endpoint in the network, reflecting the probe frame from a second endpoint in the network back to the first endpoint, receiving the reflected probe frame at the first endpoint via the network, determining a round-trip delay based on flow of the probe frame through the network, and throttling network traffic according to the determined delay to manage network traffic congestion. | 12-03-2009 |
| 20090303876 | Systems and methods for flow control and quality of service - Various embodiments of methods and systems for pausing and shaping data flow while supporting both parameterized and prioritized Quality of Service are disclosed. In some embodiments, a system for pausing and shaping data flow comprises an input buffer, a first pause controller coupled to the input buffer and an output buffer for flow control messages. Various embodiments also include a hop- | 12-10-2009 |
| 20100002582 | Apparatus and methods for managing access and update requests in a wireless network - Methods and apparatus that enable a wireless network to detect and manage impending congestion events caused by a plurality of mobile devices attempting to access the network in a brief space of time. In one embodiment, the network comprises a 3g (UMTS) cellular network, and includes a congestion management and avoidance entity that preemptively triggers a collision mode upon detecting an impending congestion event. This mode advantageously reduces processing burden on the base station by causing the mobile devices (UEs) to halt current access attempts, and invoke a multiple access scheme (e.g., wait a random amount of time before attempting further access attempts). The comparatively early detection and avoidance of collisions reduces the mobile device's power consumption, while addressing congestion events early in the wireless communication process so as to maintain optimal network conditions. | 01-07-2010 |
| 20100034083 | METHOD AND APPARATUS FOR PACKET DIFFERENTIATION IN A WIRELESS COMMUNICATION SYSTEM - Systems and methodologies are described herein that facilitate efficient packet differentiation and forwarding in a wireless communication system. As described herein, identifiers or tags (e.g., corresponding to radio bearers, logical channels, Internet Protocol (IP) addresses, etc.) can be applied to respective packets based on their destinations as determined by traffic flow templates (TFTs) associated with the packets. Further, techniques are provided for establishing radio bearers, IP addresses, and/or other resources for transmission of packets associated with respective TFTs in a manner irrespective of associated quality of service (QoS) policies for the TFTs. Upon an establishment of resources, techniques are described herein for tagging packets with resources associated with TFTs corresponding to the packets to facilitate forwarding of respective packets to their intended destinations with lowered required processing cost. Additionally, techniques are described herein for offloading packet analysis and/or forwarding functionality from a terminal to a device tethered to the terminal. | 02-11-2010 |
| 20100061234 | QOS on Bonded Channels of a Shared Access Cable Network - Various techniques are disclosed for managing traffic flow for transport over a plurality of communication channels of a shared access cable network. According to various embodiments, one or more devices of the cable network (such as, for example, a Cable Modem Termination System (CMTS)), may be operable to implement at least a portion of the traffic flow management techniques. In at least one embodiment, one or more aspects of the traffic flow management techniques disclosed herein may be used for performing real-time shaping of traffic flows across multiple different channels of a DOCSIS channel bonding group. In some embodiments, various different traffic shaping and/or traffic scheduling techniques may be employed (e.g., in DOCSIS 3.0 compatible cable networks) to reduce and/or mitigate issues which, for example, may arise as a result of an inability to represent traffic schedulers as tree-based hierarchies. Other aspects are disclosed for implementing quality of service (QoS) procedures on shared access network(s), such as for example hybrid fiber/coaxial (HFC) cable networks. | 03-11-2010 |
| 20100061235 | Traffic Flow Scheduling Techniques Implemented on Bonded Channels of a Shared Access Cable Network - Various techniques are disclosed for managing traffic flow for transport over a plurality of communication channels of a shared access cable network. According to various embodiments, one or more devices of the cable network (such as, for example, a Cable Modem Termination System (CMTS)), may be operable to implement at least a portion of the traffic flow management techniques. In at least one embodiment, one or more aspects of the traffic flow management techniques disclosed herein may be used for performing real-time shaping of traffic flows across multiple different channels of a DOCSIS channel bonding group. In some embodiments, various different traffic shaping and/or traffic scheduling techniques may be employed (e.g., in DOCSIS 3.0 compatible cable networks) to reduce and/or mitigate issues which, for example, may arise as a result of an inability to represent traffic schedulers as tree-based hierarchies. Other aspects are disclosed for implementing quality of service (QoS) procedures on shared access network(s), such as for example hybrid fiber/coaxial (HFC) cable networks. | 03-11-2010 |
| 20100080122 | COMMUNICATION DEVICE AND COMPUTER USABLE MEDIUM THEREFOR - A communication device that is to be connected to a providing server for providing time information via a network is provided. The communication device includes a congestion-degree obtainer to obtain a congestion degree indicating a condition of traffic in the network, a time information obtainer to obtain the time information provided by the providing server, and an obtainment restrictor to compare the obtained congestion degree with a predetermined reference degree of congestion, and restricts the time information obtainer from obtaining the time information if the comparison indicates that the traffic in the network is busier than the reference degree of congestion. | 04-01-2010 |
| 20100118699 | Systems and methods for dynamic quality of service - Systems, methods, and apparatus for routing are provided in which a connection track comprising a plurality of network or transport layer packets, received by a router, is identified by examination of header fields of one or more first packets in the plurality of packets. One or more quality of service (QoS) parameters is associated with the connection track by determining whether the track encodes a data type by (i) an identification of a predetermined application protocol used within the one or more first packets and/or (ii) a comparison of a payload of one or more packets in the plurality of packets to known data type formats. A first QoS parameter is set to a first value in a first value range when the connection track contains the first data type. The connection track is routed through the router in accordance with the one or more QoS parameters assigned to the connection track. | 05-13-2010 |
| 20100128605 | METHOD AND SYSTEM FOR CONTROLLING TRAFFIC OVER A COMPUTER NETWORK - A rate limiter incorporated in a server connected to a network. The rate limiter is adapted to reduce congestion in the network in response to a congestion notification message. The server is adapted to send packets over the network. The rate limiter includes at least one of: a server rate limiter engine adapted to rate limit the packets in response to the server; a virtual machine rate limiter engine adapted to rate limit the packets in response to a virtual machine associated with the packets, the virtual machine hosted by the server; a flow rate limiter engine adapted to rate limit the packets in response to a flow associated with the packets; the flow being one of a plurality of flows transporting packets over the network; and a transmit engine adapted to rate limit the packets in response to a virtual pipe of the network for transmitting the packets. | 05-27-2010 |
| 20100149975 | OPTIMIZING DATA TRAFFIC AND POWER CONSUMPTION IN MOBILE UNIFIED COMMUNICATION APPLICATIONS - Data traffic, latency, and power consumption in a mobile unified communication environment are reduced by optimizing communication between a mobile client application and a mobile data server through determining optimum delay between exchanged messages and/or filtering portions of data not relevant to the mobile client application at the server. Additional optimizations include providing mobile client application relevant updates in an intelligent fashion based on user activity, screen resolution or displayed information, relevant contacts and relevance of information, and similar characteristics. | 06-17-2010 |
| 20100157797 | METHODS OF DATA TRAFFIC SHAPING, APPARATUS AND WIRELESS DEVICE - Methods of data traffic shaping, an apparatus and a wireless device are provided. A method of data traffic shaping comprises receiving data packets, the data packets to be forwarded; storing at least one of the data packets in a buffer memory if the buffer memory has an available space for accomodating the at least one of the data packets; and discarding at least one other of the data packets if the buffer memory does not have an available space for accomodating the at least one other of the data packets. An apparatus is configured to carry out the method. A wireless device may include the apparatus. | 06-24-2010 |
| 20100188975 | Verifiable device assisted service policy implementation - Various embodiments are disclosed for a services policy communication system and method. In some embodiments, a communications device implements a service policy for assisting control of the communications device use of a service on a network; and monitors use of the service based on the service policy, in which the implementation of the service policy is verified. | 07-29-2010 |
| 20100202290 | Data Flow Control - There is disclosed a method and controller for controlling an information flow in a data transmission system. In one embodiment, the method and controller receives a plurality of data packets. The method and controller further generate a modified information flow by providing a variable spacing between the data packets that is exponentially distributed. The variable spacing between the data packets may be random or pseudo-random. | 08-12-2010 |
| 20100208587 | METHOD AND APPARATUS FOR DISTRIBUTING CREDITS TO MULTIPLE SHAPERS TO ENABLE SHAPING TRAFFIC TARGETS IN PACKET COMMUNICATION NETWORKS - A computer based system and method for distributing a global shaper rate implemented across multiple traffic processing devices. A controller distributes credits according to the demand (amount of traffic, or offered load) of each device, in such a way to achieve global targets, including the shaper rate, strict prioritization of traffic, WFQ weights and fairness between cloned channels, iteratively updated as changes occur in the quantity and makeup of the traffic across the devices | 08-19-2010 |
| 20100208588 | SHARED SHAPING OF NETWORK TRAFFIC - A method for sharing an aggregate bandwidth among a group of traffic classes may include allocating a portion of the aggregate bandwidth to one of the group of traffic classes having a first priority associated therewith, where the allocated portion is referred to as a first bandwidth. The method may include allocating an unused portion of the aggregate bandwidth to a second one of the group of traffic classes having a second priority associated therewith in conjunction with a parameter associated with a downstream device. | 08-19-2010 |
| 20100214918 | METHOD AND ARCHITECTURE FOR A SCALABLE APPLICATION AND SECURITY SWITCH USING MULTI-LEVEL LOAD BALANCING - A switch architecture and method provides scaling through multi-level load balancing of flows across data and application processing planes. An input/output module receives a communication session flow (forward) from a client device and selects one of a plurality of data processors to process the flow. The selected data processor determines the level of processing needed for the forward flow and selects an application processor from a plurality of such application processors. The application processor generates a session structure identifying actions to be performed on the forward flow and transfers the session structure to the selected data processor to perform the actions on the forward flow. The application processor also predictively generates and offloads a session structure for the associated reverse flow. If the reverse session structure is offloaded to a different data processor, either the forward or reverse flow redirects packets, or is redirected, to the data processor hosting the other flow. Typically, the redirection is accomplished by offloading a redirection structure as the offloaded session structure. | 08-26-2010 |
| 20100220591 | BIAS CORRECTION FOR SCRUBBING PROVIDERS - A decision about provider quality based on a quality metric observed says little about the quality of the provider. Further, the decision may be biased by a variation in customer contributions to the quality metric observed or by a variation in a number of completed calls received by a provider. Accordingly, a method and corresponding apparatus are provided to evaluate quality and to correct bias by determining a standard that accounts for at least one source of bias, comparing an observed measure of a provider against the standard to produce an evaluation of the observed measure of the provider, and affecting a decision about the quality of the provider based on the evaluation. As a result, an unbiased decision, for example, to scrub a provider can be made and in some instances, a provider may be rescued from being scrubbed. | 09-02-2010 |
| 20100238802 | Method, System, Program, and Readable Storage Medium for Providing Service Quality Guarantee to Network Service - A method for guaranteeing a service quality of a network service is disclosed that includes the steps of storing a historical record of a network service quality, inputting an acceptable maximal service delay of the network service, inputting a desired control level between the service quality of the network service and the number of users of the network service, determining the content of service quality guarantee, which can be provided to each service node, with respect to each pair of service nodes in accordance with the historical record, the maximal service delay, and the control level between the service quality and the number of users, monitoring the service quality between a corresponding pair of service nodes in accordance with the content of service quality guarantee, and regulating the network service between a pair of service nodes in a case where degradation of service quality occurs between the pair of service nodes. | 09-23-2010 |
| 20100246394 | SYSTEM AND METHOD FOR MANAGING NETWORK RESOURCES AND POLICIES IN A MULTICAST ENVIRONMENT - An approach is provided for managing network resources and policies. A network resource manager receives an allocation request, over a radio network, for one or more network resources for joining one of a plurality of multicast groups, the one mutlicast group being associated with a quality of service (QoS) level. The network resource manager then determines whether the network can accommodate the allocation request and modifies the network to accommodate the allocation request based on the determination by modifying a local multicast service provider (LMSP) mapping list that associates, respectively, one or more LMSPs with the multicast groups. | 09-30-2010 |
| 20100271944 | DYNAMIC BUFFERING AND SYNCHRONIZATION OF RELATED MEDIA STREAMS IN PACKET NETWORKS - The present invention is directed to the use of two or more buffers, at a common receiving node, to reduce the effects of jitter, packet loss, and/or packet latency and/or synchronize different types of packets. | 10-28-2010 |
| 20100271945 | DOWNLINK ROUTING MECHANISM - The present technology relates to protocols relative to utility meters associated with an open operational framework. More particularly, the present subject matter relates to protocol subject matter for advanced metering infrastructure, adaptable to various international standards, while economically supporting a 2-way mesh network solution in a wireless environment, such as for operating in a residential electricity meter field. The present subject matter supports meters within an ANSI standard C12.22/C12.19 system while economically supporting a 2-way mesh network solution in a wireless environment, such as for operating in a residential electricity meter field, all to permit cell-based adaptive insertion of C12.22 meters within an open framework. Cell isolation is provided through quasi-orthogonal sequences in a frequency hopping network. Additional features relate to apparatus and methodology subject matters relating to Downlink routing mechanisms. | 10-28-2010 |
| 20100284274 | System and method for determining a transmission order for packets at a node in a wireless communication network - A wireless communications network comprising a plurality of nodes and effective to provide quality of service requirements for packets being transmitted. An ingress node calculates variables based on quality of service requirements and places those variables in a header of a packet to be transmitted. The packet is then transmitted to a core node. The core node reads the variables in the packet and calculates a holding time for the packet based on the variables and the quality of service requirements. | 11-11-2010 |
| 20100296396 | Traffic Shaping Via Internal Loopback - A method for traffic shaping includes receiving traffic from one or more clients at one or more ingress ports of forwarding engine of a network node. The method also includes transmitting at least a portion of the traffic through the forwarding engine to one or more first egress ports of the forwarding engine and shaping the traffic transmitted to the egress ports. Furthermore, the method includes looping the shaped traffic internally within the network node back to one or more ingress ports of the forwarding engine. The method further includes transmitting the looped traffic through the forwarding engine to one or more second egress ports (the second egress ports different than the first egress ports) and outputting the shaped traffic from the network node. | 11-25-2010 |
| 20100296397 | CONTROL MANAGEMENT OF VOICE-OVER-IP PARAMETERS - A control management system for managing voice-over-IP parameters includes a network traffic shaping control state model for a network traffic shaping control. The network traffic shaping control state model defines state sets that contain states. The state sets may include a pending state set, a running state set, a terminated state set, a finished state set, and a stopped state set. The network traffic shaping control state model also defines intra-state transitions, which are transitions within a state set, and inter-state transitions, which are transitions between state sets. The intra-state and inter-state transitions may be associated with a condition, and the network traffic shaping control changes state according to the intra-state or inter-state transition when the associated condition is satisfied. The associated condition may be satisfied when one or more network event identifiers are generated by the control management system. | 11-25-2010 |
| 20110044167 | AUTO ADAPTIVE QUALITY OF SERVICE ARCHITECTURE AND ASSOCIATED METHOD OF PROVISIONING CUSTOMER PREMISES TRAFFIC - A customer premises device is provided for monitoring quality of service (QOS) metrics between a network edge and a customer. The device includes a memory which stores at least one user profile, and, information regarding active sessions of traffic flow through the customer premises device. A hardware and/or software/firmware based controller monitors traffic flow between the customer and the network edge and receives requests for new active sessions. The processor accesses the at least one user profile stored in memory to identify a policy hierarchy with respect to active sessions of traffic flow upon receipt of a request to establish a new active session. The processor selects a candidate active session to be terminated based upon the policy hierarchy and terminates the selected session in accordance with information stored in memory regarding the selected session. In this manner, the processor enforces quality of service, for both upstream and downstream sessions, based upon the policy hierarchy of the user profile. | 02-24-2011 |
| 20110063975 | WIRELESS RESOURCE ALLOCATION APPARATUS AND METHOD - A wireless resource allocation apparatus performs determining an amount of VoIP traffic for each terminal station; determining whether semi-persistent scheduling or dynamic scheduling is used for transmitting each packet of the VoIP traffic, based on a result of the determination for the amount of the VoIP traffic; managing, for each terminal station, a resource block allocated in the semi-persistent scheduling; and managing each resource block which is not managed for the allocation in the semi-persistent scheduling and is allocated in the dynamic scheduling. If it is determined that the dynamic scheduling is used for transmitting each packet of the VoIP traffic to a terminal station, the resource block, which has been managed for the relevant terminal station as a resource block allocated in the semi-persistent scheduling, is released, and the released resource block is managed as a resource block allocated in the dynamic scheduling. | 03-17-2011 |
| 20110075558 | RATE SHAPING TRIGGERED DISCONTINUOUS TRANSMISSION IN WIRELESS COMMUNICATIONS - A modified token bucket algorithm in a rate shaper in a wireless communication network allows for the “borrowing” of tokens, creating the possibility of a token debt, or a token bucket with a negative Token Bucket Counter (TBC) value. In this modified token bucket algorithm, an incoming packet is passed along so long as the TBC is positive, even if the packet must “borrow” some tokens, driving the TBC negative. Subsequent incoming packets are stalled until the TBC reaches a positive value. The token bucket refills at a known rate; accordingly, the duration of traffic stalling, when the TBC is negative, is known. During this time, the UE is forced into DRX mode, saving battery power by not monitoring DPCCH for traffic that has been halted. The DRX, or sleep, mode may be invoked in several ways. | 03-31-2011 |
| 20110116370 | Service Curve Mapping - A method for configuring service curves for managing the output port of a networking device includes the following steps. A multitude of traffic classes is defined, each traffic class being characterized by a bandwidth and a delay priority. A multitude of traffic service curves is computed, each of the plurality of traffic service curves is associated with a different one of the multitude of traffic classes. At least one of the multitude of traffic classes service curves is characterized by a shifted two-piece linear function shifted such that the service curve limits service to during a nonzero time period prior to the start of the two-piece linear function. | 05-19-2011 |
| 20110116371 | METHOD FOR PACING MULTI-RATE TIME SENSITIVE TRAFFIC ON ETHERNET AND BRIDGE CONNECTED NETWORKS - A system and method for delaying packet transmissions within source devices and network bridges for the purpose of reducing the worst-case delays associated with forwarding of time-sensitive packets through a bridged network. The minimal bridged network system include a first device node attached to a first network link, a second device node attached to a second network link, and a bridge connecting the first network link to the second network link. The method and system includes shaping the traffic within a source device or bridge (shaping involves spreading bunched packets over time). Within a bridge, shaping occurs at each output port of the bridge, applying a distinct shaper to the traffic coming from each of the input ports, as well as distinct shapers for the distinct traffic class coming each of the input ports. According to the system and method disclosed herein, the present invention ensures small latencies when passing through network bridges, regardless of the network topology or other concurrent data-packet transfers, subject to the restriction that the cumulative time-sensitive bandwidth flowing through any link is less than the prenegotiated rate below that of the link's cumulative bandwidth capacity. | 05-19-2011 |
| 20110128847 | PACKET TRANSMISSION DEVICE AND PACKET TRANSMISSION METHOD - The packet transmission device including: a first and a second storage module to store a token value; a token controller to add a predetermined token value to a first total token value, and subtract a predetermined token value from the first total value in response to the output of the packet; an overrun state controller to add an excess of the first total token value over a predetermined upper limit value to a second total token value, in the case where the first total token value added by addition control is greater than or equal to the predetermined upper limit value; and an underrun state controller to subtract a predetermined token value from the second total token value and add the subtracted token value to the first total token value, in the case where the subtracted first total token value is less than the predetermined upper limit value. | 06-02-2011 |
| 20110134751 | Method for Congestion Detection in Packet Transmission Networks - A method for measuring degree of packet congestion on a channel of a packet communication network. The method includes: during a training mode, generating an mathematical relationship between the degree of packet congestion on the channel and a plurality of measurable features of the network over a plurality of network conditions; and, during a subsequent normal operating mode, periodically measuring the plurality of measurable features and applying the generated mathematical relationship to such periodically measured plurality of measurable features to determine actual degree of congestion on the channel; and comparing the actual degree of congestion on the channel with a predetermined channel congestion threshold level. The degree of packet congestion on the channel is saturation level. The measurable features include: lime delay between transmission starts and terminations of the previously transmitted packet; the fraction of time the channel is busy; and. average number of packet transmission retries. | 06-09-2011 |
| 20110134752 | MULTILINK TRAFFIC SHAPING - A method for performing multilink communications may include applying a quality-of-service (QoS) policy to incoming traffic, where the QoS policy operates to identify a first portion and a second portion of the incoming traffic. The method may include fragmenting the first portion of the incoming traffic into a group of fragments. The method may include sequencing the group of fragments and the second portion of the incoming traffic into a sequenced flow, where the sequencing causes the second portion to be interleaved among the group of fragments so that the sequenced flow can be made available to a first link and a second link as multilink traffic, where the first link carries a first portion of the multilink traffic and the second link carries a second portion of the multilink traffic. | 06-09-2011 |
| 20110141889 | Methods and Systems for Managing Variable Delays in Packet Transmission - An improved method and system for the determination of jitter buffers enables the generation of buffers having sizes and delays such that, as designed, the buffers capture a substantial majority of packets while not being resource intensive. The present methods and systems provide for improved jitter buffer management by deriving playout buffer adjustments from a plurality of variances, centered around a distribution peak, or mean average delay. The playout buffer monitor uses the buffer adjustments, in size and delay, to select, store and playout packets at their adjusted playout time. The present invention may be employed in a media gateway that enables data communications among heterogenous networks and may be specifically deployed to manage jitter experienced in the course of receiving packetized data and processing the data for further transmission through a packet-based or circuit-switched network. | 06-16-2011 |
| 20110170409 | OVERLOAD CONTROL IN A QUALITY-OF-SERVICE-AWARE TELECOMMUNICATIONS NETWORK - A method of controlling overload in a telecommunications network (e.g. a Next Generation Network) is described. A series of offers are sent from one or more source nodes to a throttle. An admission decision is carried out at the throttle for each offer, the outcome of the admission decision determining whether or not that offer should be admitted into the network. For each offer, if the admission decision is to admit the offer, it is sent from the throttle towards a target node in the network. Each offer belongs to a traffic class selected from a set of traffic classes. The throttle identifies the traffic class of each offer and the admission decision for each offer takes into account the traffic class of that offer according to a Service Level Agreement. | 07-14-2011 |
| 20110176418 | ADAPTIVE TRAFFIC MANAGEMENT VIA ANALYTICS BASED VOLUME REDUCTION - A method of managing traffic over a communication link between a transmitting node and a receiving node is provided herein. The method includes: determining momentary traffic shaping constraints; accumulating incoming messages at the transmitting node into a data queue, based on the momentary traffic shaping constraints; transmitting the messages from the data queue to the receiving node over the communication link based on the momentary traffic shaping constraints; estimating a desired amount of data that needs to be discarded from messages in the data queue, based on: (a) the size of the data queue and (b) the momentary traffic shaping constraints; sorting data in the data queue by an order of importance, based on analytic objects; discarding, based on the analytic objects, the desired amount of data from the messages in the queued data, such that the discarded data is ranked lowest by the order of importance. | 07-21-2011 |
| 20110176419 | ANALYSIS AND CONTROL OF TRAFFIC BASED ON IDENTIFIED PACKET CONTROL FUNCTIONS - A device receives packet control function (PCF) load information associated with a packet data serving node (PDSN), and determines PCF Internet protocol (IP) address information and a number of sessions per PCF based on the PCF load information. The device also receives IP information from an IP network associated with the PDSN, and determines PCF identity information based on the IP information. The device further generates control information based on the PCF IP address information, the number of sessions per PCF, and the PCF identity information, and provides the control information to the PDSN to control operation of the PDSN. | 07-21-2011 |
| 20110199899 | Rate-Adaptive Bundling of Data in a Packetized Communication System - Methods and apparatus minimize message latency time by dynamically controlling an amount of message bundling that occurs in a computer network application. Unbundled messages are allowed while a bottleneck resource, such as a network link, is lightly utilized, but the amount of bundling is progressively increased as the message rate increases, thereby progressively increasing resource efficiency. | 08-18-2011 |
| 20110199900 | Partitioning Entity and Method for Partitioning Capacity - The present invention relates to a partitioning entity and a method for partitioning capacity in a communication network to avoid starvation of certain data traffic and to support services with different characteristics. The method of partitioning capacity comprises assigning communication links to a group associated with a time-varying group capacity to form a group of communication links. The group comprises a first sub-group and at least a second sub-group of communication links. Further, the method comprises allocating a non-zero fraction of the time-varying group capacity to the first sub-group of communication links of the group. | 08-18-2011 |
| 20110199901 | METHOD AND APPARATUS FOR MANAGING COMMUNICATIONS IN A WIRELESS COMMUNICATION SYSTEM - The present technology provides a method and apparatus for managing communications in a wireless communication system. The method and apparatus evaluate one or more network traffic levels, each network traffic level associated with a respective network sector, and submit access-configuration messages in one or more network sectors when the evaluated network traffic level of a particular network sector has a predetermined relation to the traffic threshold for that particular network sector. The access-configuration messages are configured to shift one or more of wireless devices into one or more predetermined operational conditions. The present technology further provides corresponding wireless devices. | 08-18-2011 |
| 20110205894 | TRAFFIC SHAPING FOR REAL TIME MEDIA STREAMS - A traffic shaper spaces out bursts of non-audio data traffic while allowing audio packets to be delivered in a more timely manner. The packets of bursts of non-audio packets are spaced such that audio packets are delivered at approximately the same spacing as before a burst of non-audio packets are submitted to be delivered. The packets for the non-audio data packets are scheduled based on the currently available bandwidth. | 08-25-2011 |
| 20110222402 | ETHERNET EXTENSION FOR THE DATA CENTER - The present invention provides methods and devices for implementing a Low Latency Ethernet (“LLE”) solution, also referred to herein as a Data Center Ethernet (“DCE”) solution, which simplifies the connectivity of data centers and provides a high bandwidth, low latency network for carrying Ethernet and storage traffic. Some aspects of the invention involve transforming FC frames into a format suitable for transport on an Ethernet. Some preferred implementations of the invention implement multiple virtual lanes (“VLs”) in a single physical connection of a data center or similar network. Some VLs are “drop” VLs, with Ethernet-like behavior, and others are “no-drop” lanes with FC-like behavior. Some preferred implementations of the invention provide guaranteed bandwidth based on credits and VL. Active buffer management allows for both high reliability and low latency while using small frame buffers. Preferably, the rules for active buffer management are different for drop and no drop VLs. | 09-15-2011 |
| 20110235511 | COEXISTENCE MANAGEMENT FOR COOPERATIVE TRANSCEIVING IN A SHARED SPECTRUM - A wireless interface circuit transceives packetized data between a host module and a first external device using a frequency spectrum, wherein the packetized data is formatted in accordance with a first wireless communication protocol and wherein the packetized data includes an indication that the first external device is configured to use at least a portion of the frequency spectrum for communication via a second wireless communication protocol. A coexistence management module generates a wireless interface schedule that includes a least one contention free period reserved for communication via the second wireless communication protocol, and generates schedule data, based on the wireless interface schedule, for transmission to a plurality of external devices including the first external device. | 09-29-2011 |
| 20110235512 | DATA TRANSMISSION METHOD - A plurality of radio base stations constitute a radio communication system. Each of the radio base stations performs shaping control to output data in accordance with a shaping amount for adjusting a data transmission interval and transmits the output data to an upper-level apparatus. Each of the radio base stations performs shaping control by adjusting the shaping amount according to the number of mobile terminals which are performing radio communication and a QoS (Quality of Service) of a communication service being executed in a radio communication with the mobile terminal. The upper-level apparatus monitors data received from the radio base station, detects missing data, and transmits a control signal concerning the shaping control to the radio base station in accordance with the detection result of missing data. The radio base station performs the shaping control according to the received control signal. | 09-29-2011 |
| 20110255403 | System and Method for Controlling Network Congestion - A method for controlling network congestion includes estimating a queue size, entering a first mode of operation if the estimated queue size is below a first threshold, and entering a second mode of operation if the estimated queue size is above a second threshold. | 10-20-2011 |
| 20110261692 | METHOD FOR BALANCING LOADS IN MOBILE WIRELESS AD-HOC NETWORKS - The invention relates to a method for balancing the traffic load without affecting the performance or efficiency or efficiency in Pocket Switched Networks, comprised within the so-called Delay-Tolerant Networks. The method introduces the concepts of strength and affinity to make decisions for routing messages in the Pocket Switched Network. | 10-27-2011 |
| 20110261693 | METHOD AND APPARATUS FOR OPTIMIZING DATA TRAFFIC IN SYSTEM COMPRISING PLURAL MASTERS - A data traffic optimization method and apparatus is provided for guaranteeing data transmission service quality such that the plural masters transmit data within a time period according to the data amount optimized for the corresponding master. The method includes acquiring a control factor for controlling the data traffic, issuing a traffic control signal according to a determination whether to open or block data transfer of a master to a bus, and controlling the master to continue or stop transferring data according to the traffic control signal issued by the traffic optimizer. | 10-27-2011 |
| 20110261694 | METHOD AND SYSTEM FOR PROVIDING AUTO-BANDWIDTH ADJUSTMENT - An approach is provided for auto-bandwidth adjustment of allocated bandwidth for a traffic tunnel over a network. A determination is made regarding a traffic load over the tunnel, where the tunnel meters traffic in accordance with the bandwidth allocation. A determination is made regarding whether the traffic load triggers an adjustment threshold, where the adjustment threshold is set to provide a desired headroom below the bandwidth allocation. And the bandwidth allocation is adjusted when the adjustment threshold is triggered to provide the desired headroom between the adjusted bandwidth allocation and the traffic load. | 10-27-2011 |
| 20110292797 | Dynamic delay budget allocation using single-point estimation of end-to-end delay - A computer-readable medium has tangibly embodied thereon and accessible therefrom a set of instructions interpretable by at least one data processing device. The set of instructions is configured for causing the at least one data processing device to carry out operations for estimating a delay for each one of a plurality of packets of a VOIP traffic flow and for allocating a delay budget for each one of the packets dependent upon the estimated delay thereof. Such estimating is performed at a fixed location between end locations of a path over which the packets traverse and is performed using packet timestamp information acquired from the packets only at the fixed location. | 12-01-2011 |
| 20110299391 | TRAFFIC MANAGEMENT FOR VIRTUAL CLUSTER SWITCHING - One embodiment of the present invention provides a switch system. The switch includes one or more ports on the switch configured to transmit packets encapsulated based on a first protocol. The switch further includes a traffic management mechanism and a control mechanism. During operation, the control mechanism forms a logical switch based on a second protocol, receives an automatically assigned identifier for the logical switch without requiring manual configuration of the identifier, and joins a virtual cluster switch. | 12-08-2011 |
| 20110317556 | TRAFFIC CONTROL METHOD AND APPARATUS FOR WIRELESS COMMUNICATION - A throughput detector | 12-29-2011 |
| 20120020210 | BYTE-ACCURATE SCHEDULING IN A NETWORK PROCESSOR - Described embodiments provide for scheduling packets for transmission by a network processor. A traffic manager generates a tree scheduling hierarchy having a root scheduler and N scheduler levels. The network processor generates tasks corresponding to received packets. The traffic manager enqueues the received task in the associated queue, the queue having a corresponding parent scheduler at each of one or more next levels of the scheduling hierarchy up to the root scheduler. Each scheduler determines one or more tasks to schedule from a given queue based on a default packet size of the packet corresponding to the task. The corresponding packet data is read from a shared memory, and, at each corresponding parent scheduler up to the root scheduler, an actual size of the packet data is updated. Scheduling weights of each corresponding parent scheduler are updated based on the actual size of the packet data. | 01-26-2012 |
| 20120057456 | METHOD AND APPARATUS FOR DISTRIBUTED COMMUNICATION USING SHORT RANGE AND WIDE RANGE COMMUNICATION LINKS - A method and apparatus for a wireless device comprising means for receiving first packets of an IP flow utilizing a wireless link to a cellular base station or a Wi-Fi access point during a first time interval; means for receiving second packets of an IP flow utilizing a wireless link to another wireless device during the first time interval; and means for recovering the IP flow utilizing the first and second packets are disclosed. | 03-08-2012 |
| 20120106336 | DATA COMMUNICATION SYSTEM AND COMMUNICATION CONTROL METHOD THEREOF - A data communication system and a communication control method are provided. The data communication system includes a data transmission apparatus and a data receiving apparatus connected to each other through two or more parallel paths; and two or more routers disposed on the two or more parallel paths, respectively, wherein at least one of the routers detects bandwidth aggregation communication being performed on the parallel paths, from data transmitted through the at least one of the routers, and controls a sum of transmission rates used for the bandwidth aggregation communication to be lower than an upper-limit transmission rate during the bandwidth aggregation communication. | 05-03-2012 |
| 20120127857 | Dynamic Queuing and Pinning to Improve Quality of Service on Uplinks in a Virtualized Environment - Techniques are provided for improve quality of service on uplinks in a virtualized environment. At a server apparatus having a plurality of physical links configured to communicate traffic over a network to or from the server apparatus, forming an uplink group comprising a plurality of physical links. A first class of service is defined that allocates a first share of available bandwidth on the uplink group, and a second class of service is defined that allocates a second share of available bandwidth on the uplink group. The bandwidth for the first class of service is allocated across the plurality of physical links of the uplink group, and the bandwidth for the second class of service is allocated across the plurality of physical links of the uplink group. Traffic rates are monitored on each of the plurality of physical links to determine if a physical link is congested indicating that a bandwidth deficit exists for a class of service. In response to determining that one of the plurality of physical links is congested, bandwidth is reallocated for a class of service to reduce the bandwidth deficit for a corresponding class of service. | 05-24-2012 |
| 20120140623 | LOW POWER AND FAST APPLICATION SERVICE TRANSMISSION - An apparatus, method and system are provided to allow a low power and fast application service transmission (LP-FAST) engine to enhance the quality of service (QoS) and optimize the power consumption of the mobile applications operating in a mobile terminal in a service-aware, bandwidth-aware and power-consumption-aware manner. | 06-07-2012 |
| 20120140624 | SYSTEMS AND METHODS FOR DYNAMIC CONGESTION MANAGEMENT IN COMMUNICATIONS NETWORKS - Systems and methods for dynamic congestion management in communications networks are disclosed herein. According to an aspect, a method can include determining traffic statistics of at least one node in a communications network. The method can also include determining whether the at least one node is congested based on the traffic statistics. Further, the method can include dynamically changing or provisioning a set of at least one traffic shaping rule for application to the at least one node in response to determining that the at least one node is congested. | 06-07-2012 |
| 20120155260 | Dynamic Synchronized Scheduling in a Computer Network - In one embodiment, a receiving node in a computer network may detect congestion, and also identifies a set (e.g., subset) of its neighbor nodes. In response to the congestion, the receiving node may assign a transmission timeslot to each neighbor node of the set based on the congestion, where each neighbor is allowed to transmit (synchronously) only during its respective timeslot. The assigned timeslots may then be transmitted to the set of neighbor nodes. In another embodiment, a transmitting node (e.g., a neighbor node of the receiving node) may receive a scheduling packet from the receiving node. Accordingly, the transmitting node may determine its assigned transmission timeslot during which the transmitting node is allowed to transmit. As such, the transmitting node may then transmit packets only during the assigned timeslot (e.g., for a given time). In this manner, congestion at the receiving node may be reduced. | 06-21-2012 |
| 20120155261 | DATA PROCESSING METHOD AND DEVICE - Disclosed is a data processing method and device according to the present invention, including: calculating a maximum allowable delay time of each of a plurality of operators that constitute a plurality of services and are executed according to a data processing request of a user; classifying the plurality of operators based on the calculated maximum allowable delay time; calculating a quality of service (QoS) satisfaction allowable level with respect to each of the plurality of operators, wherein the allowable level for QoS satisfaction indicates the number of times that there is no need to satisfy one goal of QoS with the premise that there is no problem in satisfying QoS satisfaction requested by the user; setting execution orders of the plurality of classified operators by reflecting the calculated allowable level for QoS satisfaction; and executing the plurality of operators based on the set execution orders. | 06-21-2012 |
| 20120176895 | Message Loss Prevention By Using Sender Buffer and Traffic Shaping in Event-Triggered Distributed Embedded Real-Time Systems - A vehicular distributed embedded real-time controller area network system includes ECUs that function in an event-triggered mode to initiate a transmission of the message to the communication bus. Each ECU includes a sender buffer for storing the generated message. A bus controller interfaces with the ECUs and manages the transfer of messages to and from the communication bus. The transfer of messages onto the communication bus is executed by the controller area network controller on an interrupt basis. The bus controller being unavailable to receive a message from the ECU when a previous message stored within a memory of the bus controller is awaiting transmission on the communication bus. The bus controller is available to receive a message from the ECU when the memory is empty. The sender buffer stores messages received from the electronic control unit when the bus controller is unavailable. The ECU further includes a traffic shaping module for selectably delaying a transfer of messages to the bus controller. | 07-12-2012 |
| 20120176896 | METHODS, SYSTEMS, AND COMPUTER READABLE MEDIA FOR DEEP PACKET INSPECTION (DPI)-ENABLED TRAFFIC MANAGEMENT FOR xDSL NETWORKS - Methods, systems, and computer readable media for DPI-enabled traffic shaping for xDSL networks are disclosed. According to one method, a DPI node analyzes signaling for an xDSL network access node or a broadband network gateway to determine nodal or link capacities available to nodes upstream from the network access node or the broadband network gateway for delivering downstream traffic to the network access device. The DPI node uses the determined capacities to shape downstream traffic delivered to the network access device. | 07-12-2012 |
| 20120188872 | SYSTEM AND METHOD FOR MEASURING INTERFACE UTILIZATION USING POLICERS - An approach is provided for monitoring interface utilization. Bandwidth data for an interface is collected during a configurable time interval, and a peak utilization of the interface over the time interval is determined using a plurality of incremented policers to measure the collected bandwidth data. An implementation of which is system that includes a monitoring module configured to collect bandwidth data for an interface over a configurable time interval, a plurality of incremented policers configured to measure the collected bandwidth data, and an analysis module configured to determine a peak utilization of the interface over the time interval using the measurements of the plurality of incremented policers. | 07-26-2012 |
| 20120201135 | Reassignment of Distributed Packet Flows - In one embodiment, packet flows are distributed among groups, such as, but not limited to, queues or links. For example in the context of a bundled interface in which multiple links appear as a single logical interface on each of the sender and receiver, packet flows are distributed among these multiple links by the sender. When one or more links become unavailable, packet flows of the affected links are reassigned to other active links, while packet flows assigned to the unaffected links remain associated with the same link in contrast to prior systems which do not attempt to preserve prior associations between packet flows and links. By maintaining these associations, the receiver of the packets does not need to adjust to the different arrival links of packet flows. | 08-09-2012 |
| 20120213068 | METHODS OF DATA TRAFFIC SHAPING, APPARATUS AND WIRELESS DEVICE - Methods of data traffic shaping, an apparatus and a wireless device are provided. A method of data traffic shaping comprises receiving data packets, the data packets to be forwarded; storing at least one of the data packets in a buffer memory if the buffer memory has an available space for accommodating the at least one of the data packets; and discarding at least one other of the data packets if the buffer memory does not have an available space for accommodating the at least one other of the data packets. An apparatus is configured to carry out the method. A wireless device may include the apparatus. | 08-23-2012 |
| 20120218890 | APPARATUS, SYSTEM AND METHOD FOR THE TRANSMISSION OF DATA WITH DIFFERENT QoS ATTRIBUTES - An apparatus, system and method are provided for transmitting data from logical channel queues over a telecommunications link, each of the logical channel queues capable of being associated with quality of service attributes, the method including determining available resources for transmission over the telecommunications link in a frame; selecting one of the logical channel queues based on a first one of the quality of service attributes; packaging data from the selected one of the logical channel queues until one of: a second one of the quality of service attributes for the selected one of the logical channel queues is satisfied, the available resources are used, or the selected one of the logical channel queues is empty; and repeating the selecting step and the packaging step for remaining ones of the logical channel queues. | 08-30-2012 |
| 20120224481 | TRAFFIC MANAGEMENT IN DISTRIBUTED WIRELESS NETWORKS - Wireless networks and devices are ubiquitous today. For service providers to offer customers QoS and Service Level Agreements (SLAs) means in part providing resilient connectivity of wireless devices with good signal strength, good Signal to Noise and Interference Ratio (SNIR), and adequate useable bandwidth. Doing so requires that devices transmitting and receiving packets use over-the-air bandwidth efficiently and manage over-the-air congestion. According to embodiments of the invention QoS measurements and controls are incorporated only in the network (i.e. APs or controllers) and therefore QoS and SLAs can be achieved with all deployed client stations versus standards based approaches that require additional capabilities in network nodes, client stations and in most cases modifications to the applications. SLAs can be provided exploiting embodiments of the invention for traffic prioritization, capacity improvements through load distribution, and adjacent channel interference mitigation discretely or in combination with standards based mechanisms. | 09-06-2012 |
| 20120250505 | Method and System for Writing to a VLAN Tag - According to one embodiment, a method may include writing a congestion forward indicator (CFI) bit of an outer virtual local area network (VLAN) tag in an Ethernet frame to one of a first setting or a second setting, reading the CFI bit of the outer VLAN tag at a switching element, copying priority (PRI) bits of the outer | 10-04-2012 |
| 20120275304 | HIERARCHICAL PROFILED SCHEDULING AND SHAPING - Various exemplary embodiments relate to a method and related network node including one or more of the following: determining, by the network node, that a port of the network node is ready to receive a packet; identifying a packet having a highest packet priority among a plurality of packets received via a plurality of interfaces, wherein the step of identifying includes, for each of a plurality of components at a first hierarchy level: identifying a first level highest priority packet among a plurality of packets available to the component, based on a packet priority associated with each of the plurality of packets available to the component, sharing the packet priority of the first level highest priority packet with at least one component at a second hierarchy level; and transmitting the packet having the highest priority to the port. | 11-01-2012 |
| 20120287784 | SYSTEM AND METHOD FOR INTEGRATED QUALITY OF SERVICE IN A WIRELESS NETWORK ENVIRONMENT - A method is provided in one example embodiment and includes receiving a request for a service flow over a wireless link, where the request specifies resource requirements; dynamically reserving bandwidth for the resource requirements in a backhaul link; and mapping a packet received over the wireless link to the backhaul link based on an identification element associated with the packet and the service flow. | 11-15-2012 |
| 20120287785 | DATA TRAFFIC HANDLING IN A DISTRIBUTED FABRIC PROTOCOL (DFP) SWITCHING NETWORK ARCHITECTURE - A switching network includes an upper tier having a master switch and a lower tier including a plurality of lower tier entities. The master switch, which has a plurality of ports each coupled to a respective lower tier entity, implements on each of the ports a plurality of virtual ports each corresponding to a respective one of a plurality of remote physical interfaces (RPIs) at the lower tier entity coupled to that port. Data traffic communicated between the master switch and RPIs is queued within virtual ports that correspond to the RPIs with which the data traffic is communicated. The master switch applies data handling to the data traffic in accordance with a control policy based at least upon the virtual port in which the data traffic is queued, such that the master switch applies different policies to data traffic queued to two virtual ports on the same port of the master switch. | 11-15-2012 |
| 20120300624 | BANDWIDTH GUARANTEEING APPARATUS AND BANDWIDTH GUARANTEEING METHOD - A bandwidth guaranteeing apparatus includes a controller that collects guaranteed communication rate for a plurality of devices on an OVC between a user-side apparatus and the bandwidth guaranteeing apparatus; and a determiner that obtains the smallest value of the guaranteed communication rate collected by the controller and upon a bandwidth change request that is for the OVC and from the user-side apparatus, determines whether the bandwidth change request can be accepted, based on the obtained guaranteed communication rate. | 11-29-2012 |
| 20120300625 | METHOD AND EQUIPMENT FOR PERFORMING FLOW SHAPING THAT MAINTAINS SERVICE QUALITY IN PACKET-SWITCHED TELECOMMUNICATIONS - The invention relates to a method and equipment for performing flow shaping that maintains service quality in packet-switched telecommunications. Using the method according to the invention, the speed properties (CIR, PIR, CBS) of an aggregate flow (A) can be monitored and limited in a situation, in which the aggregate flow contains delay-critical traffic (V | 11-29-2012 |
| 20120314573 | SYSTEM AND METHOD FOR MONITORING AND ALTERING PERFORMANCE OF A PACKET NETWORK - The disclosed embodiments include a system and method for monitoring performance of a packet network. In one embodiment, a method includes determining network performance information of a packet network by monitoring performance information packets that are communicated along network paths of the packet network. The method also includes appending the network performance information gathered at a network node along the network paths to data stored in the performance information packets. The method stores the network performance information collected by monitoring the performance information packets in memory and analyzes the stored network performance information to generate historical network performance information. The method automatically alters network operation in response to current network performance information indicating that the packet network is not operating properly based on the historical network performance information. | 12-13-2012 |
| 20120327768 | System and Method for Dynamic Rate Limiting and Shaping of Traffic Based on Available Bandwidth - A method may include monitoring available aggregate bandwidth of a network element and determining if the available aggregate bandwidth is sufficient to communicate traffic at a rate equal to an aggregate sum of committed information rates for a plurality of classes of traffic. If the available aggregate bandwidth is sufficient to communicate traffic at the rate equal to the aggregate sum of committed information rates for a plurality of classes of traffic, traffic may be communicated for each of the plurality of classes in accordance with the respective committed information rate for each class. Otherwise, traffic may be communicated for each of the plurality of classes in an amount proportional to the respective committed information rate for a particular class and the available aggregate bandwidth. | 12-27-2012 |
| 20130003545 | PROVIDING QUALITY OF SERVICE FOR SUB-FLOWS IN A MULTIPLE GRANTS PER INTERVAL SERVICE FLOW - A method and system to provide Quality of Service (QoS) for packet transmission in a grant of a multiple grants per interval (MGI) service flow is provided herein. The method includes the steps of receiving a packet of an application session, determining characteristics associated with the packet and mapping the packet to a MGI sub-flow, wherein the MGI sub-flow is associated with the QoS attributes for the application session. The method further includes the steps of storing the packet in a pre-shaper sub-flow queue that is associated with the MGI sub-flow that the packet is mapped to, and enforcing the QoS for the packet transmission by adjusting the egress of the packet from the queue based on the QoS attributes associated with the MGI sub-flow. | 01-03-2013 |
| 20130033984 | SYSTEM AND METHOD FOR REMOTELY CONTROLLING NETWORK OPERATORS - A system and method for controlling communications networks. Network performance information is gathered from a first communications network using performance information packet data packets. A network operator of the first communications network is controlled from a secondary communications network using the performance information packet data packets. Changes to the network operator are implemented based on instructions included in the performance information packet data packets. | 02-07-2013 |
| 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 |
| 20130039179 | POWER MANAGER AND METHOD - A power manager for a mobile device comprises a traffic shaping unit ( | 02-14-2013 |
| 20130044597 | Apparatus for controlling data traffic and a method for measuring QoE - The present invention refers to an apparatus for controlling data traffic in a cell of a cellular network wherein the apparatus comprises means for determining the data rate of an ongoing data session established between a first client device located in a cell and a network device wherein said data session is used for receiving streaming data, means for determining the data rate of an ongoing data session established between a second client device located in the same cell and a network device wherein said data session is used for receiving non streaming data, means for determining a Quality of Experience of the data stream of the first client device and means for adjusting the data rate of the first and/or second client device if the determined Quality of Experience of said data stream of the first client device is lower than a predetermined threshold. | 02-21-2013 |
| 20130058214 | Method and apparatus to avoid overloads on subscriber access lines - A communication system has special Agents in the subscriber terminals which detect the need of applications for data paths with QoS over the access network. The Agents have packet based control channels to a Remote Resource Manager installed outside the network typically as a web server and use the control channels for sending bandwidth allocation requests to the Remote Resource Manager which stores all bandwidth relevant information for a subscriber and delivers bandwidth and QoS class back to the Agents which adjust packet rate and packet QoS class marking accordingly. A Self-Sustaining Scheduler placed in the bottlenecks of the data path guarantees given delay times per QoS class and keeps packet drop rate below given limits if the Remote Resource Manager assigns bandwidth appropriately. | 03-07-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 |
| 20130070593 | Policy-Enabled Dynamic Deep Packet Inspection for Telecommunications Networks - Provided herein is a method including the steps of: establishing at least one policy in a centralized policy management framework (PMF), wherein the policy includes at least one policy condition; monitoring data traffic; determining if the data traffic at least substantially meets one of the policy conditions; sending a trigger to the PMF, if at least one of the policy conditions is at least substantially met; generating an enforcement decision at the PMF, wherein the enforcement decision includes at least one enforcement action; sending the enforcement decision to an enforcement function; and enforcing the enforcement decision. A system for realizing this method is also provided. | 03-21-2013 |
| 20130077486 | PRIORITIZING CLASSES OF NETWORK TRAFFIC TO PROVIDE A PREDETERMINED QUALITY OF SERVICE - A network shaping engine can be used to optimize network traffic by employing means to prioritize data packets assigned to a network traffic class over other network traffic. The network shaping engine accomplishes network traffic optimization by determining whether received data packets comprise a traffic class mark or indicia that indicates the data packets are part of a minimum latency traffic class. After analyzing the packets, the network optimization engine sorts the data packets according to the identified traffic classes and transmits the packets. Data packets comprising a traffic class marking are transmitted according to a first transmission scheme while data packets that do not comprise a traffic class marking are transmitted according to a second transmission scheme that differs from the first transmission scheme. | 03-28-2013 |
| 20130083657 | METHOD TO VERIFY A DROP PROBABILITY CURVE - In one embodiment, a test technique verifies a drop probability curve implemented by an intermediate node of a computer network, wherein a test point of the drop probability curve has a drop probability value and a queue length value. Traffic may be loaded into a queue of the node at a constant bit rate that is based on the drop probability value and an output rate associated with queue. An average traffic latency may then be measured, and an actual queue length may be calculated by multiplying the measured average traffic latency with the output rate. The drop probability curve may be verified when the calculated queue length is within a specified tolerance of the queue length value associated with the test point. | 04-04-2013 |
| 20130083658 | CONGESTION-BASED TRAFFIC SHAPING FOR DISTRIBUTED QUEUING IN SHARED-MEDIA COMMUNICATION NETWORKS - In one embodiment, a device in a shared-media communication network determines a priority of a packet to be queued at the device, and based on the priority determines a length of time the packet is allowed to be queued before being successfully transmitted. After attempting to successfully transmit the queued packet within the shared-media communication network, in response to reaching a threshold amount of the length of time without having successfully transmitted the queued packet, the device may transmit a “shaping” request to one or more reachable neighbors in the shared-media communication network. Specifically, the shaping request is for a temporary reduction in bandwidth utilization by the reachable neighbors for traffic having a comparatively lesser priority than the priority of the packet. | 04-04-2013 |
| 20130107707 | EMULATING NETWORK TRAFFIC SHAPING | 05-02-2013 |
| 20130163421 | Systems and Methods for Dynamically Adjusting QoS Parameters - A method for dynamically adjusting QoS parameters associated with a virtual circuit is disclosed. The virtual circuit includes a first end connected to a first router and a second end connected to a second router. The method includes receiving an offer message at the second router, and sending a request message to the first router. The offer message includes a first set of QoS parameters and the request message includes a second set of QoS parameters. The method further includes receiving a request confirmation message at the second router, receiving a new offer message at the second router, and sending information compliant with the second set of QoS parameters to the first router. The new offer message includes the second set of QoS parameters. | 06-27-2013 |
| 20130163422 | COMMUNICATION DEVICE - A device in a line part from a LAN to a WAN includes a plurality of cards which includes a TCP converter relaying two TCP communications. The TCP converter exchanges the number of connections in which data transmission is in progress and the number of connections in which data reception is in progress between TCP converters, receives the total number of connections in which data reception is in progress in an opposite device and an access line bandwidth to a WAN from the opposite device for each TCP connection. A control bandwidth is determined on the basis of the retransmission ratio of data, the total number of connections in which data transmission is in progress and an access line bandwidth to the WAN, and the total number of connections in which data reception is in progress and an access line bandwidth to the WAN of which the opposite device notifies. | 06-27-2013 |
| 20130170348 | HIERARCHIES AND CATEGORIES FOR MANAGEMENT AND DEPLOYMENT OF POLICIES FOR DISTRIBUTED WIRELESS TRAFFIC OPTIMIZATION - Systems and methods for deploying and employing policies for wireless traffic optimization in a wireless network based on hierarchies are disclosed. One embodiment includes deploying a global policy set of the policies for wireless traffic optimization among mobile devices in the wireless network and deploying a first policy set of the policies among a first subset of mobile devices among the mobile devices. In one embodiment, the first subset of mobile devices meet a device-based criteria including one or more of, device type, device platform, or device model and any policy of the first policy set overwrites any policy of the global policy set in case of conflict when deployed on any of the first subset of mobile devices. | 07-04-2013 |
| 20130176848 | COMMUNICATION APPARATUS AND COMMUNICATION METHOD - When a transmitting terminal | 07-11-2013 |
| 20130215743 | NETWORK DEVICES WITH TIME AWARE MEDIUM ACCESS CONTROLLER - A network device includes a memory, a MAC module, a host control module, and a selector module. The memory stores frames and timestamps corresponding to the frames. The MAC module receives the frames and the timestamps and forwards the frames to a physical layer device. The MAC module includes queues that store the frames received from the memory, and shaping modules that receive the frames from the queues and spread data in the frames over time to generate blocking signals. The host control module transfers ownership of the frames to the MAC module. The host control module or the MAC module masks the transfer of the ownership of first frames including gating the first frames based on the timestamps to delay reception of the first frames in the queues. The selector module selects one of the blocking signals, and forwards the selected blocking signal to the physical layer device. | 08-22-2013 |
| 20130223216 | QoS AWARE BALANCING IN DATA CENTERS - One embodiment of the present invention provides a system for balancing loads between two physical resources. During operation, for each physical resource, the system establishes resource-usage models for a plurality of jobs that share the physical resource, identifies quality-of-service (QoS) levels associated with the jobs, and computes a QoS balance point for the physical resource based on the resource-usage models and the QoS ratings. The QoS balance point indicates a rating of QoS, above which substantial resource provisioning is required. In response to detecting a difference between a first QoS balance point associated with a first physical resource and a second QoS balance point associated with a second physical resource, the system identifies one or more jobs to be moved between the first and second physical resources such that the difference between the first and the second QoS balance points is reduced. | 08-29-2013 |
| 20130265870 | DOWNSTREAM TIME DOMAIN BASED ADAPTIVE MODULATION FOR DOCSIS BASED APPLICATIONS - In a satellite gateway, data is transmitted over a downstream channel at different throughput rates. Data destined for each subscriber/receiver is assigned a throughput rate depending upon the downstream signal quality of that subscriber/receiver. The downstream data is parsed to extract data packets. The data packets are then loaded into packet queues based on an identifier within such packets. The queues represent a bandwidth efficiency or throughput rate that can be currently tolerated by specific subscribers that may also be based on the current signal quality at a subscriber location. The parsed data traffic is processed based on the profile of the plurality of profiles to produce processed data traffic, and transmitted from the packet queues over a downstream channel. | 10-10-2013 |
| 20130279332 | Telecommunications Network and Method for Time-Based Network Access - The invention relates to a telecommunications network configured for providing access to a plurality of terminals is proposed and a method therefore. Each terminal comprises a unique identifier for accessing the telecommunications network. The telecommunications network comprises a register, an access request receiver and an access module. The register is configured for storing the unique identifier of at least one terminal in combination with at least one grant access time interval, or an equivalent thereof, during which access for the terminal is permitted. The access request receiver is configured for receiving the access request and the unique identifier for accessing the telecommunications network from the terminal. The access module is configured for denying access for the terminal if the access request is received outside the time interval, or the equivalent thereof. | 10-24-2013 |
| 20130294234 | COMMUNICATION MANAGEMENT SYSTEM, COMMUNICATION MANAGEMENT METHOD, AND NON-TRANSITORY COMPUTER READABLE MEDIUM - A communication management system includes a measuring unit, an assigning unit, and a distribution controller. The measuring unit measures, for each of clients, a traffic pattern representing a pattern of temporal changes in an amount of communication traffic regarding the client. The assigning unit assigns, to each of plural communication channels, one or more clients that use the communication channel, on the basis of the traffic patterns of the clients measured by the measuring unit. The distribution controller performs control of selecting, as a communication channel with which distribution data is to be distributed to one or more of the clients, at least one of the plural communication channels to which the assigning unit has assigned the clients. | 11-07-2013 |
| 20130329553 | TRAFFIC METERING AND SHAPING FOR NETWORK PACKETS - An integrated circuit device comprising, an interface configured to receive signals external to said integrated circuit device; a memory; a logic unit; and a lookup table coupled with the logic unit, wherein the lookup table is configured to govern traffic of a network. | 12-12-2013 |
| 20130329554 | MOBILE DEVICE AND METHOD - Embodiments of the invention provide the ability to use policy defined by the operator to control the interfaces on which data is sent and received by a device. The policy can be dynamically updated by the operator, by pushing new policy to the device for implementation. The policy can define that the device should switch certain data between two or more available interfaces at certain times, or may define when certain data may be sent or received over a particular interface. Advantageously, the device may receive new policy from the operator in order to help with the operator's own operational objectives. For example, the operator may be engaging in traffic shaping or other traffic limitation, for example to ease congestion or enforce service agreements. | 12-12-2013 |
| 20130336113 | WIRELESS LAN COMMUNICATION DEVICE, WIRELESS LAN COMMUNICATION METHOD AND PROGRAM - A wireless LAN communication device configured to carry out the priority control of an EDCA scheme includes a first determining section for determining access categories, a second determining section for determining a bandwidth occupancy rate for each access category, and a change section for dynamically changing parameters regarding the priority control for each category in accordance with determination results of the first and second determining sections. Accordingly, even when a mass of traffic exists in categories having the priority of the same class, the collision of packets in the traffic, the increase of the amount of delay, the reduction of throughput, and the like can be avoided. | 12-19-2013 |
| 20130343188 | EVENT-BASED SHAPER FOR A PACKET SWITCH - Egress of data packets from a packet switch is controlled in a manner that involves adjusting the shaper accumulators only when a packet egress event or accumulator credit threshold event occurs. A timeline having a number of timeslots is maintained in a memory to mark the times at which events are predicted to occur. If an egress event occurs, in which one or more data packets have been sent from a queue, or if the current timeslot contains a marker, then a count stored in an accumulator is adjusted. If an egress event has occurred or a threshold event in which a count stored in an accumulator has crossed a threshold has occurred, then a marker is stored in a future timeslot. | 12-26-2013 |
| 20140003235 | METHOD AND A SYSTEM FOR FINDING SMALLEST HOP-SPECIFIC DATA TRANSFER SPEED | 01-02-2014 |
| 20140016463 | PACKET PROCESSING APPARATUS AND PACKET PROCESSING METHOD - A packet processing apparatus includes a packet processing unit that performs a packet output process, an extraction unit that extracts information about each packet before the packet is inputted to the packet processing unit, and a contention handling unit that performs a process avoiding occurrence of contention between/among predetermined processes before the packet is inputted in the packet processing unit, the contention being predicted based on the information about the packet. As a process avoiding contention among series of processes including, for example, processes performed by the packet processing unit to read an amount of transmission rights from a storage unit, do subtraction, and write the amount of transmission rights back into the storage unit, the contention handling unit detects packets belonging to a same flow from information about predetermined number of successive packets and reports the information to the packet processing unit on a flow by flow basis. | 01-16-2014 |
| 20140036672 | Calculating credit for controlling data frame transmission - A hardware circuit configured to calculate credit for controlling data frame transmission in an AVB network. | 02-06-2014 |
| 20140036673 | NETWORK SYSTEM, CONTROLLER AND QOS CONTROL METHOD - When a network composed of usual switches on a communication route exists, in the network, a QoS control cannot be carried out to a user. Specifically, the switch receives a packet and issues a notice to an external controller and a user authenticating section of the controller determines a QoS policy of a flow. When a plurality of networks exists on the route, a route calculating section selects a route based on the QoS policy and topology data so as to pass through an appropriate network. A flow table generating section generates a flow table which carries out queuing based on the QoS policy and a marking of a DSCP value to a DS field of a header when transmitting a packet to the selected network, and registers the flow table for the round-trip on the switch. | 02-06-2014 |
| 20140043974 | LOW-LATENCY SWITCHING - Disclosed are systems and methods for cut-through switching in port-speed-mismatched networks. Specifically, systems and methods are described in which data packets from an ingress device are paced, thereby matching the data rate of the ingress device with the data rate of the egress device. | 02-13-2014 |
| 20140064077 | OPPORTUNISTIC WIRELESS RESOURCE UTILIZATION USING DYNAMIC TRAFFIC SHAPING - Systems and methods which provide resource sharing techniques implementing opportunistic shared resource utilization using dynamic traffic shaping are disclosed. Embodiments implement a multi-part transmission frame generation process in which data packets of various different traffic flows are selected for the transmission frame to fill the frame capacity. For example, scheduling logic may apply traffic shaping logic to select data packet queues from which data packets are to be included in a frame and to initially determine a number of packets to be included in the frame from each selected data packet queue according to the traffic shaping logic. Thereafter, the frame may be analyzed to determine if excess capacity remains. The scheduling logic may then apply traffic shaping logic to the data packet queues to implement an opportunistic scheme for including additional data packets in the frame and thereby fill the excess capacity. | 03-06-2014 |
| 20140071822 | AUTOMATIC DISCOVERY AND ENFORCEMENT OF SERVICE LEVEL AGREEMENT SETTINGS - A method of automatically detecting the service level agreement settings in an Ethernet virtual circuit (EVC) carrying user packets comprises generating synthetic packets different from the user packets, on a data path in the EVC at a level sufficiently high to saturate the EVC. This accelerates the detection of actual effective values for the Committed Information Rate (CIR) and the Excess Information Rate (EIR) by triggering traffic shaping devices in the data path to enforce the CIR and EIR settings configured for those devices. A plurality of traffic samples are collected from the data path during a sampling period that is long enough to allow the collection of at least two valid traffic samples, where a valid traffic sample is the amount of user packets measured between two consecutive losses of synthetic packets. The CIR and EIR values enforced by the traffic shaping devices are determined from the collected samples. | 03-13-2014 |
| 20140071823 | METHOD AND APPARATUS FOR TRANSMITTING PACKETS IN ACCORDANCE WITH IEEE 802.1 QBV - A network device including a plurality of queues configured to store respective frames of data having a priority level. The network device includes a shaper configured to transmit, during a first portion of a transmission interval, frames of data from a first one of the plurality of queues having a highest priority level, block frames of data from a second one of the plurality of queues during a blocking band extending from a first time prior to a start of the transmission interval to a second time indicating the start of the transmission interval, determine, based on the second time and a maximum frame size to be transmitted during the transmission interval, the second time, and selectively transmit, subsequent to the first time and prior to the second time, frames of data from the second one of the plurality queues based on the second time. | 03-13-2014 |
| 20140105015 | NETWORK TRAFFIC SHAPING FOR LOW POWER AND LOSSY NETWORKS - In one embodiment, data packet messages are received in a Field Area Router (FAR) sent from one or more sources toward one or more destination devices in a Low-Power Lossy Network (LLN). An LLN routing topology for the data packet messages is interpolated in the FAR. An expected time for the data packet messages to reach a destination device in the LLN is determined based upon the routing topology interpolation. Traffic shaping is applied by thse FAR for the data packet messages based upon the determined expected time for the data packet messages to reach destination devices in the LLN. | 04-17-2014 |
| 20140105016 | INFORMATION PROCESSING APPARATUS, COMMUNICATION SYSTEM, INFORMATION PROCESSING METHOD, AND PROGRAM - There is provided an information processing apparatus including an acquiring unit that acquires communication quality of wireless communication at a location where a wireless communication apparatus exists, and a control unit that controls ON/OFF of another data communication function other than a data communication function to which a high priority is set, among data communication functions included by the wireless communication apparatus, based on the acquired communication quality. | 04-17-2014 |
| 20140169166 | PACKET TRAIN GENERATION FOR ESTIMATING AVAILABLE NETWORK BANDWIDTH - Aspects of a high-precision packet train generation process are distributed among several distinct processing elements. In some embodiments a control processor configures a packet-processing unit with a packet train context that includes details such as the number of packets to be generated and the headers to be included in the packets. The packet-processing unit takes a packet to be used in the packet train and recirculates it a number of times, as specified by the packet train context. The recirculated packets, with the appropriate headers inserted, are forwarded to a traffic-shaping queue in queuing hardware. The traffic-shaping queue is configured to output the forwarded packets with a constant inter-packet gap. Thus, the generation of the multiple packets in the packet train is handled by the packet-processing unit, while the precise inter-packet timing is provided by the traffic-shaping queue in the queuing hardware. | 06-19-2014 |
| 20140177439 | DYNAMIC PACKET TRAFFIC PERFORMANCE ADJUSTMENT SYSTEMS AND METHODS - A method, a network, and a network element use dynamic packet traffic performance adjustment techniques. In an exemplary embodiment, the dynamic resizing techniques utilize different packet connections providing connectivity to same sites between which bandwidth resizing is needed. Each of the packet connections has a separate and independent bandwidth profile that governs an amount of traffic that is dispatched over each packet connection. A network element sourcing traffic into the packet connections uses bridge functionality that dispatches client traffic onto all of the packet connections or an individual packet connection. This effectively means that the transport network bandwidth utilization is only consumed by a single packet connection, i.e., the packet connection-A (even through there are multiple configured). The network element sinking the traffic selects from a single active packet connection. | 06-26-2014 |
| 20140177440 | DEQUEUING AND CONGESTION CONTROL SYSTEMS AND METHODS FOR SINGLE STREAM MULTICAST - A system that processes single stream multicast data includes multiple queues, a dequeue engine, and/or a queue control engine. The queues temporarily store data. At least one of the queues stores single stream multicast data. A multicast count is associated with the single stream multicast data and corresponds to a number of destinations to which the single stream multicast data is to be sent. The dequeue engine dequeues data from the queues. If the data corresponds to the single stream multicast data, the dequeue engine examines the multicast count associated with the single stream multicast data and dequeues the single stream multicast data based on the multicast count. The queue control engine examines one of the queues to determine whether to drop data from the queue and marks the data based on a result of the determination. | 06-26-2014 |
| 20140269284 | SYSTEM AND METHOD FOR DISTRIBUTED DATA MANAGEMENT IN WIRELESS NETWORKS - Described are systems and methods for managing data traffic to a plurality of mobile devices over a wireless network. For each mobile device, a facility is provided that is capable of:
| 09-18-2014 |
| 20140269285 | APPARATUS, SYSTEM AND METHOD FOR LOAD BALANCING TRAFFIC TO AN ACCESS POINT ACROSS MULTIPLE PHYSICAL PORTS - A method for load balancing traffic from controller to destination access point (AP) via switch across multiple physical ports starts with controller receiving a packet from a source client device that is destined for destination client device associated with destination AP. The controller may select, based on an identifier associated with source or destination client device, a first or a second controller IP address. Controller may encapsulate the packet to generate an encapsulated packet including an outer header that includes the selected controller IP address. Controller may transmit the encapsulated packet to the switch that may distribute traffic to destination AP across multiple physical ports based on the selected controller IP address. Controller may also select a destination port based on destination client device of a packet and may encapsulate the packet using CAPWAP to generate an encapsulated packet including the destination port in a header of the encapsulated packet. | 09-18-2014 |
| 20140269286 | Delay Timer Device, Method for Managing a Plurality of Delays, and Apparatus for Delaying a Plurality of Data Packets - An embodiment delay timer for timing a plurality of delays includes a delay clock comprising a number of clock memories, wherein the number of clock memories corresponds to a number of digit positions of a delay clock value, and a delay memory configured to store the plurality of delays. The delay timer further includes a delay logic unit configured to add a new delay by storing it in the delay memory and to time the new delay by coupling it to that clock memory which corresponds to the most significant digit position of the delay value of the new delay that is not zero, by subsequently coupling the new delay to that clock memory which corresponds to the next less significant digit position of the delay value according to the delay value of the new delay and by generating a delay signal when the new delay expires. | 09-18-2014 |
| 20140269287 | APPARATUS, SYSTEM AND METHOD FOR THE TRANSMISSION OF DATA WITH DIFFERENT QoS ATTRIBUTES - An apparatus, system and method are provided for transmitting data from logical channel queues over a telecommunications link, each of the logical channel queues capable of being associated with quality of service attributes, the method including determining available resources for transmission over the telecommunications link in a frame; selecting one of the logical channel queues based on a first one of the quality of service attributes; packaging data from the selected one of the logical channel queues until one of: a second one of the quality of service attributes for the selected one of the logical channel queues is satisfied, the available resources are used, or the selected one of the logical channel queues is empty; and repeating the selecting step and the packaging step for remaining ones of the logical channel queues. | 09-18-2014 |
| 20140286163 | DATA CHANNEL SCHEDULING METHOD AND SYSTEM FOR ORTHOGONAL FREQUENCY DIVISION MULTIPLEXING ACCESS (OFDMA)-BASED WIRELESS MESH NETWORK - Provided is a data channel scheduling system for an orthogonal frequency division multiplexing access (OFDMA)-based wireless mesh network, the system including a set classifying unit to classify a plurality of nodes included in the OFDMA-based wireless mesh network, into multiple requests allowing sets based on a preset reference, and an information providing unit to provide information on the classified sets such that multiple requests are performed on one of the classified multiple requests allowing sets. | 09-25-2014 |
| 20140301195 | ATTRIBUTION OF CONGESTION CONTRIBUTIONS - A method of attributing contributions to congestion of a shared resource to respective user registers, said resource being operable to serve requests for service, each of a plurality of said requests having a user indication associated therewith indicating with which of a plurality of user registers the request is associated. | 10-09-2014 |
| 20140307548 | Information Handling System Data Center Bridging Features with Defined Application Environments - Information handling system network traffic is managed by populating a DCBX client framework with application network parameters associated with predetermined applications. Network devices, such as information handling system clients and servers, retrieve a TLV from a switch to obtain application network parameters for an application and apply the parameters so that the application executing on the device tags network communications with the associated parameters, such as bandwidth, loss less behavior, priority, latency, through put and CPU utilization. | 10-16-2014 |
| 20140334301 | HIERARCHICAL ALLOCATION OF NETWORK BANDWIDTH FOR QUALITY OF SERVICE - Network bandwidth is allocated to virtual machines (VMs) according to a node hierarchy that includes a root node, intermediate nodes, and leaf nodes, wherein each leaf node represents a queue of packet transmission requests from a VM and each intermediate node represents a grouping of leaf queues. As VMs generate requests to transmit packets over the network, the network bandwidth is allocated by queuing packets for transmission in the leaf nodes, and selecting a leaf node from which a packet is to be transmitted based on tracking data that represent how much network bandwidth has been allocated to the nodes. Upon selecting the leaf node, the tracking data of the selected leaf node and the tracking data of an intermediate node that is a parent node of the selected leaf node are updated, and a command to transmit the packet of the selected leaf node is issued. | 11-13-2014 |
| 20140341023 | METHOD AND APPARATUS FOR TRANSMITTING AND RECEIVING DATA PACKET IN WIRELESS COMMUNICATION SYSTEM - A method for transmitting a data packet in a transmitting apparatus in a wireless communication system is provided. The method includes receiving first feedback information including buffer status information indicating information related to a status of a buffer included in a receiving apparatus from the receiving apparatus, determining a number of first data packets to be transmitted to the receiving apparatus based on the buffer status information, determining a number of second data packets which is identical to at least one of the number of first data packets based on a data packet loss rate for each of a plurality of paths, and encoding the determined number of first data packets and the determined number of second data packets and transmitting encoded first data packets and encoded second data to the receiving apparatus through each of the plurality of paths. | 11-20-2014 |
| 20140341024 | CONCURRENT WIRELESS COMMUNICATIONS OVER LICENSED AND UNLICENSED SPECTRUM - Methods and apparatuses are described for wireless communications. A first method includes transmitting a first Orthogonal Frequency-Division Multiple Access (OFDMA) communications signal to a wireless node in a licensed spectrum, and transmitting, concurrently with the transmission of the first OFDMA communications signal, a second OFDMA communications signal to the wireless node in an unlicensed spectrum. A second method includes receiving a first Orthogonal Frequency-Division Multiple Access (OFDMA) communications signal from a wireless node in a licensed spectrum, and receiving, concurrently with the reception of the first OFDMA communications signal, a second OFDMA communication signal from the wireless node in an unlicensed spectrum. A third method includes generating a periodic gating interval for a cellular downlink in an unlicensed spectrum, and synchronizing at least one boundary of the periodic gating interval with at least one boundary of a periodic frame structure associated with a primary component carrier of the cellular downlink. | 11-20-2014 |
| 20140341025 | SYSTEMS AND METHODS FOR DYNAMIC CONGESTION MANAGEMENT IN COMMUNICATIONS NETWORKS - Systems and methods for dynamic congestion management in communications networks are disclosed herein. According to an aspect, a method can include determining traffic statistics of at least one node in a communications network. The method can also include determining whether the at least one node is congested based on the traffic statistics. Further, the method can include dynamically changing or provisioning a set of at least one traffic shaping rule for application to the at least one node in response to determining that the at least one node is congested. | 11-20-2014 |
| 20140355434 | BEACON INDICATION TARGET WAKEUP TIME (TWT) - Certain aspects of the present disclosure provide methods and apparatus for a relay to indicate a transmission interval it wishes to be protected by a restricted access window (RAW) restricting transmission by other devices. | 12-04-2014 |
| 20140362697 | PROCESS FOR MANAGING A QUEUE OF DATA - Method for managing a queue of data sent by a requesting data processing system ( | 12-11-2014 |
| 20150009815 | Traffic Shaping Mechanism for UE Power Saving in Connected Mode - A method of uplink shaping and scheduling request (SR) prohibition in RRC Connected Mode is proposed. A UE applies DRX operation in a wireless network, the UE is in RRC Connection mode. The UE processes a data packet to be sent to the network. The data packet is associated with a traffic type. If the data packet belongs to a normal traffic type, then the UE transmits a scheduling request (SR) to the network. If the data packet belongs to a background traffic type, then the UE buffers the data packet and is prohibited from sending the SR to the network until a triggering condition is satisfied. By reducing the activity of uplink transmission, UE power consumption is improved and signaling overhead is reduced. | 01-08-2015 |
| 20150009816 | Traffic Shaping Mechanism for UE Power Saving in Idle Mode - A method of uplink shaping and extending UE in RRC Idle Mode is proposed. The UE processes a data packet to be sent to the network. The data packet is associated with a traffic type. If the data packet belongs to a normal traffic type, then the UE enters RRC Connected mode and thereby transmitting the data packet to the network. If the data packet belongs to a background traffic type, then the UE buffers the data packet and the UE is prohibited from entering RRC Connected mode until a triggering condition is satisfied for uplink transmission. The proposed mechanism achieves power saving by reducing the activity of uplink transmission. In addition, the proposed mechanism also reduces signaling overhead to enhance network efficiency. | 01-08-2015 |
| 20150009817 | METHOD OF CONTROLLING CONGESTION, APPARATUS FOR CONTROLLING CONGESTION AND COMMUNICATION SYSTEM - Provided herein is a method of controlling a congestion in a communication scheme using a lower layer that performs a first congestion control and an upper layer that performs a second congestion control different from the first congestion control. The method includes detecting a congestion in the lower layer, notifying, from the lower layer to upper layer, the occurrence of the congestion and congestion control information related to the congestion; and setting, in the upper layer, an output rate for each of at least one congestion-related upper-layer session that is processed in the upper layer and is related to the congestion. Also provided is an apparatus for controlling congestion, a communication system, and a non-transitory computer-readable recording medium having stored therein a congestion control program. | 01-08-2015 |
| 20150009818 | METHOD AND SYSTEM FOR GROUP COMMUNICATION, GROUP SERVER, AND GROUP MEMBER DEVICE - Embodiments of the present invention provide a group communication method, system, group server, and group member device. A group server receives notification messages sent by a group member device, aggregates, according to an address of a subscription device, the notification messages destined for the same subscription device, and sends a notification message obtained after aggregation to the subscription device. By aggregating multiple messages sent by the group member device to the subscription device, messages exchanged between the group member device and the subscription device are reduced, thereby reducing communication traffic between the group member device and the subscription device. | 01-08-2015 |
| 20150016253 | SOURCE-AWARE NETWORK SHAPING - Systems and methods are described for source-aware shaping of network traffic in a communications system. Embodiments can manage resource congestion within a communications network by preferentially adjusting certain types of traffic on a per-subscriber and/or per-application basis. For example, a subscriber can receive various types of traffic in respective streams, and the streams can be identified according to whether they carry adaptive traffic. When a congestion condition is detected, one or more of the identified streams can be squeezed or expanded, which can cause an associated content source to automatically adapt communication of the adaptive traffic (e.g., its quality) to the reduced or expanded capacity. Selectively squeezing those streams identified as adaptive can appreciably mitigate congestion, while maintaining a desired level of network performance for the subscriber. | 01-15-2015 |
| 20150029846 | Use of Switching for Optimizing Transport Costs for Bandwidth Services - Methods and systems are disclosed for receiving, with circuitry of a network controller, information indicative of characteristics of incoming data traffic in an information transport network, the network comprising at least one packet switched layer and at least one transport layer; determining to transport the incoming data traffic through at least one determined layer being at least one of the packet switched layer and the transport layer, based on the characteristics of the incoming data traffic and/or network information; determining at least one route for the incoming data traffic through the determined layer; and transmitting a signal containing computer executable instructions to at least one switch, to configure the switch to steer the incoming data traffic through the at least one route of the at least one determined layer. The information indicative of characteristics of data traffic may be gathered/provided by one or more traffic monitor. | 01-29-2015 |
| 20150055465 | Controlling Transmission of Data - In an embodiment, a method of controlling transmission of data from a wireless device to a receiver connected via a communication channel includes an application executing on the wireless device providing an estimate of end-to-end bandwidth of the communication channel; supplying to the application from wireless access circuitry in the wireless device at least on communication-related parameter and modifying in the application the estimate of end-to-end bandwidth using the at least one communication-related parameter. | 02-26-2015 |
| 20150071066 | AUTOMATIC DISCOVERY AND ENFORCEMENT OF SERVICE LEVEL AGREEMENT SETTINGS - A method of automatically detecting the service level agreement settings in an Ethernet virtual circuit (EVC) carrying user packets comprises generating synthetic packets different from the user packets, on a data path in the EVC at a level sufficiently high to saturate the EVC. This accelerates the detection of actual effective values for the Committed Information Rate (CIR) and the Excess Information Rate (EIR) by triggering traffic shaping devices in the data path to enforce the CIR and EIR settings configured for those devices. A plurality of traffic samples are collected from the data path during a sampling period that is long enough to allow the collection of at least two valid traffic samples, where a valid traffic sample is the amount of user packets measured between two consecutive losses of synthetic packets. The CIR and EIR values enforced by the traffic shaping devices are determined from the collected samples. | 03-12-2015 |
| 20150078159 | PACKET TRAIN GENERATION FOR ESTIMATING AVAILABLE NETWORK BANDWIDTH - Aspects of a high-precision packet train generation process are distributed among several distinct processing elements. In some embodiments a control processor configures a packet-processing unit with a packet train context that includes details such as the number of packets to be generated and the headers to be included in the packets. The packet-processing unit takes a packet to be used in the packet train and recirculates it a number of times, as specified by the packet train context. The recirculated packets, with the appropriate headers inserted, are forwarded to a traffic-shaping queue in queuing hardware. The traffic-shaping queue is configured to output the forwarded packets with a constant inter-packet gap. Thus, the generation of the multiple packets in the packet train is handled by the packet-processing unit, while the precise inter-packet timing is provided by the traffic-shaping queue in the queuing hardware. | 03-19-2015 |
| 20150092549 | SYSTEMS AND METHODS FOR HIGH THROUGHPUT TRAFFIC PATTERN GENERATION - A method of generating network traffic in a network device of a data communication network includes providing traffic generation parameters in the network device that describe a desired traffic pattern to be generated by the network device, generating a trigger packet in the network device, the trigger packet specifying a drop precedence for packets generated by the network device in a state defined by the trigger packet, replicating the trigger packet to provide a packet train, selectively dropping one or more packets in the packet train based on the drop precedence specified in the trigger packet, and transmitting the packet train from the network device. | 04-02-2015 |
| 20150117193 | WIRELESS ACCESS NODE AND METHOD FOR SIGNALING AGGREGATION OF A PLURALITY OF UE DEVICES THROUGH A HUB UE DEVICE - A wireless access node and method for performing signaling aggregation for a plurality of User Equipment devices (UEs) through a hub UE are provided. The wireless access node in one example includes a communication transceiver configured to allocate traffic channels and signaling channels between the wireless access node and the plurality of UEs and a processing system configured to determine whether a signaling load exceeds a predetermined signaling load threshold, if the signaling load exceeds the predetermined signaling load threshold, then select a hub UE from among the plurality of UEs, with remaining UEs comprising one or more secondary UEs, allocate a plurality of traffic channels between the wireless access node and the hub UE, and relay all signaling for the one or more secondary UEs through the hub UE via signaling aggregation using one or more traffic channels of the plurality of traffic channels. | 04-30-2015 |
| 20150117194 | Network Control Method and Device - A network control method and device collect a network state in a network through an edge device. On the basis of the network state, the network control device guides traffic transmitted from a user site, through the edge device to a specific route in the network or a specific receiving end. | 04-30-2015 |
| 20150146526 | NETWORK CONGESTION MANAGEMENT USING FLOW REBALANCING - Systems and methods are disclosed for managing congestion in a data network. In a data network, various data flows are transmitted between source and destination nodes. One or more computing devices of the network may be configured to detecting congestion in a first path and provide an indication of the congestion, directly or indirectly, to a destination device. A switch associated with the path is designated for performing rebalancing of the flow based at least in part on a control message generated in response to an instruction received, either directly or indirectly, from a source device. Reassignment of the congested flow to a new path can help alleviate congestion and improve network performance. | 05-28-2015 |
| 20150146527 | System, Method and Apparatus for Network Congestion Management and Network Resource Isolation - System, method and apparatus for network congestion management and network resource isolation. A high level network usage and device architecture is provided that can satisfy buffering and network bandwidth resource management for data center networks. The congestion management can be defined to bring the reaction point closer to the network ports. In one embodiment, the reaction point is resident in a network interface card (NIC). | 05-28-2015 |
| 20150304223 | SHARED BACKHAUL LINK FOR MULTIPLE WIRELESS SYSTEMS - Systems and methods are presented for effectively utilizing a Backhaul link shared by two or more wireless system Operators, such that data rates from multiple Core Network data sources to the shared Backhaul link, and data rates from multiple sets of Subscriber Stations to the shared Backhaul link, are controlled so that a combined downlink rate substantially does not exceed a predetermined Backhaul data rate, and a combined uplink rate substantially does not exceed a predetermined Backhaul data rate, thereby preventing an overloading of the shared Backhaul link. Further, communication rates of different data sets within the downstream and upstream, respectively, are dynamically altered to provide best overall service within the downstream and upstream, respectively, while not overloading the shared Backhaul link. | 10-22-2015 |
| 20150341275 | DYNAMIC TRAFFIC SHAPING BASED ON PATH SELF-INTERFERENCE - In one embodiment, a method is disclosed in which a device in a network receives self-interference information from one or more nodes in the network. A degree of self-interference along a communication path in the network is determined based on the received self-interference information. A packet to be sent along the communication path is also identified and traffic shaping is performed on the communication path based on the degree of self-interference along the path. | 11-26-2015 |
| 20160037379 | System and Method for a Location Prediction-Based Network Scheduler - Embodiments are provided for traffic scheduling based on user equipment (UE) in wireless networks. A location prediction-based network scheduler (NS) interfaces with a traffic engineering (TE) function to enable location-prediction-based routing for UE traffic. The NS obtains location prediction information for a UE for a next time window comprising a plurality of next time slots, and obtains available network resource prediction for the next time slots. The NS then determines, for each of the next time slots, a weight value as a priority parameter for forwarding data to the UE, in accordance with the location prediction information and the available network resource prediction. The result for the first time slot is then forwarded from the NS to the TE function, which optimizes, for the first time slot, the weight value with a route and data for forwarding the data to the UE. | 02-04-2016 |
| 20160050154 | Dynamic Load Balancing Under Partial Service Conditions - Methods and apparatuses for controlling load balancing of modems may include receiving an indication of impairment of a channel, placing modems using the impaired channel into a partial service mode and removing the impaired channel from a list of channels available for load balancing, monitoring the quality of the impaired channel, and, responsive to detection of acceptable quality on the impaired channel, removing the modems from partial service mode and adding the channel back to the list of channels available for load balancing. Another method includes, but is not limited to, receiving an indication of a partial service mode for a modem, incrementing a partial service mode counter for a channel associated with the partial service mode indication, computing a partial service mode metric based in part upon the partial service mode counter, and responsive to a determination that the partial service mode metric meets a threshold, determining an allocation of modems to channels. | 02-18-2016 |
| 20160080268 | METHODS AND SYSTEMS FOR HUB HIGH AVAILABILITY AND NETWORK LOAD AND SCALING - A method includes receiving at a branch device an assigned first hub device and an assigned second hub device associated with a data center, establishing a VPN data tunnel to the assigned first and second hub devices, designating the first hub device as a primary device, designating the second hub device as a secondary device and switching traffic destined for the primary device to the secondary device based, at least in part, on a cost of a link. | 03-17-2016 |
| 20160080272 | System and Method for Remotely Controlling Network Operators - A system and method for controlling communications networks. Network performance information is gathered from a first communications network using performance information packet data packets. A network operator of the first communications network is controlled from a secondary communications network using the performance information packet data packets. Changes to the network operator are implemented based on instructions included in the performance information packet data packets. | 03-17-2016 |
| 20160105368 | APPARATUS AND METHOD FOR TIME AWARE TRANSFER OF FRAMES IN A MEDIUM ACCESS CONTROL MODULE - A medium access control module including queues and gate, shaping and selector modules. The queues or the gate modules receive frames and timestamps from a memory. Ownership of the frames is masked based on the timestamps, which delays reception of the frames by the queues. The queues store the frames received from the memory. The gate modules compare the timestamps to a local time and permit transfer of the frames based on the comparisons. Each of the gate modules permits transfer of one of the frames in response to the local time matching or being later than a corresponding one of the timestamps. The shaping modules receive the frames from the queues or the gate modules and spread data in the frames over time to generate output signals. The selector module selects one of the output signals to forward to a physical layer device. | 04-14-2016 |
| 20160112323 | SCALABILITY OF PROVIDING PACKET FLOW MANAGEMENT - Systems and methods for managing packet flows in a communication network are provided. Packet information can be cached on different levels and used to avoid external queries. The cache information can also be correlated with other types of information, such as location information, to be able to serve that information quicker than if one or more external queries were to be made. A demux manager can provide routing and session setup, by routing packets that already have a session to the session manager and assigning packets to a session manager if they are not already assigned to a session. The tiered architecture also provides scalability to many users and minimizes delays even during high call volumes because the load can be distributed well across the gateway's resources. | 04-21-2016 |
| 20160112326 | Framework for Traffic Engineering in Software Defined Networking - System and method embodiments are provided for traffic engineering (TE) in software defined networking (SDN). The embodiments enable a complete end-to-end TE solution between a user equipment (UE) and a source/destination across a radio access network (RAN). In an embodiment, a method in a network component for TE in a SDN includes receiving TE information from a first core network component in a core network, a RAN component, wherein the RAN is communicably coupled to the core network, wherein the TE information includes a TE objective; and determining a TE decision between at least one UE and a second core network component in the core network according to the TE information and the TE objective, wherein the TE decision comprises information for at least one end-to-end path solution between the at least one UE and the second core network wherein the path traverses the core network and the RAN. | 04-21-2016 |
| 20160112896 | USER-PLANE CONGESTION MANAGEMENT - Methods, apparatuses and systems for user-plane congestion management are provided. Among these method, apparatuses and systems is a method, implementable by a base station (and/or a serving gateway), for mitigating user plane congestion. The method may include sending a congestion indication to a core network; receiving a general packet radio system (GPRS) tunneling protocol (GTP) packet including an first internet protocol (IP) packet associated with a first flow within a bearer; obtaining, from a header of the GTP packet, an indicator indicative of a priority of the IP packet, wherein the indicator was inserted into the header of the GTP packet by the core network responsive to the congestion indication; and dropping any of the GTP packet and the first IP packet on condition that a priority of a second IP packet associated with second flow within the bearer takes precedence over the priority of the first IP packet. | 04-21-2016 |
| 20160119239 | Method and Apparatus for Providing an Efficient Multi-Client Access - An apparatus and a method for providing an efficient multi-client access in a WLAN, the method comprising the step of: when the number of clients exceeds a threshold, creating at least two virtual access points (VAP1, VAP2, VAP3); load balancing by distributing workloads across the created at least two virtual access points; and dynamically allocating at least one quality of service parameter (e.g., timeslots, AIFS, TXOP, maximum and minimum contention window) to each of the created at least two virtual access points. | 04-28-2016 |
| 20160119241 | Method and device for regulating a quality of service between a local area network and a wide area network - A method is provided for regulating a Quality of Service in a local area network, including the following: a Quality of Service regulator receives at a gateway of the local area network, from at least one Quality of Service checker, a status report concerning a distributed application; the Quality of Service regulator establishes, based on the status report, traffic engineering rules pertaining to the gateway; and the Quality of Service regulator transmits the traffic engineering rules to a Quality of Service controller. A corresponding device, a corresponding computer program and a corresponding storage medium are also provided. | 04-28-2016 |
| 20160156561 | SIDE CHANNEL ATTACK DETERRENCE IN NETWORKS | 06-02-2016 |
| 20160164775 | METHOD AND ARRANGEMENT FOR QOS-AWARE ROUTING IN A LI SYSTEM - A method and arrangements providing QoS-aware routing of received session flows of separate communication sessions comprising Communication Content achieved and received from Lawful Interception of target sessions. The method comprises sorting each separate communication session into one of two groups, a first routing group and a second routing group, according to certain criteria wherein QoS is at least one of the criteria. Further, the method comprises routing communication sessions sorted into the first routing group via a regular handover interface and routing communication sessions sorted into the second routing group via an additional handover interface to a Law Enforcement Agency. | 06-09-2016 |
| 20160164789 | DEVICE AND METHOD FOR SELECTIVELY TRANSMITTING DATA PACKETS DURING A BLOCKING BAND - A bridge device including first and second queues and a shaper. The shaper receives an indication of a first time corresponding to a beginning of a blocking band and transmits, during a first portion of a transmission interval, a frame of data from the first queue. The transmission interval begins at a second time subsequent to the first time and the blocking band extends from the first time into the first portion of the transmission interval. The shaper blocks a frame of data from the second queue during the blocking band in response to a determination that transmission of the frame of data will not be completed prior to the second time. The shaper transmits the frame of data from the second queue during the blocking band in response to a determination that the transmission of the frame of data will be completed prior to the second time. | 06-09-2016 |
| 20160205023 | SYSTEM AND METHOD OF FLOW SHAPING TO REDUCE IMPACT OF INCAST COMMUNICATIONS | 07-14-2016 |
| 20160255534 | Techniques for Managing Parameters Used by Terminal Devices in Access Network Selection and/or Traffic Steering or Routing Procedures | 09-01-2016 |
| 20170237669 | NETWORK TRAFFIC SHAPING FOR LOW POWER AND LOSSY NETWORKS | 08-17-2017 |
| 20190149474 | METHOD AND SYSTEM FOR SHAPING TRAFFIC FROM AN EGRESS PORT IN A SOFTWARE-DEFINED WIDE AREA NETWORK | 05-16-2019 |
| 20220141148 | SYSTEM AND METHOD FOR CONGESTION MANAGEMENT IN COMPUTER NETWORKS - A method for congestion management on a computer network including: receiving a packet from a traffic flow; determining at least one attribute associated with the packet; determining a priority level for the packet based on the at least one attribute; determining a queue depth for a queue in a data plane path of the packet; determining whether to send or drop the packet based on the priority level and the queue depth. A system for congestion management including: an incoming packet handler configured to receive a packet; an application detector configured to determine at least one attribute associated with the packet; a policy module configured to determine a priority level for the packet based on the at least one attribute; an enhanced weighted random early detection module configured to determine a queue depth and whether to send or drop the packet based on the priority level and the queue depth. | 05-05-2022 |
