Abstract: A method and a network device for sharing bandwidth among a group of classes of traffic for an interface are provided. Bandwidth may be allocated to at least one traffic class of a first priority for the interface. At least some unused bandwidth of the at least one traffic class may be allocated to at least one other traffic class of a second priority for the interface. In some implementations, weighted constituents may be allocated unused interface bandwidth based on an assigned weight of each of the weighted constituents of the interface.

Abstract: A method to establish communications in a centralized network determines that a connection needs to be established and generates a connection type and a connection specification. A connection is then requested from a central coordinator. If the connection is granted, a connection identifier with an originating service access point and predefined parameters with the connection identifier. The determination of a need for a connection may be made by request from an application, or automatically determining that a connection does not exist and needs to be set up.

Abstract: An ordered list of precedence values includes a number of blocks of precedence values. An operating system receives filters from an application. The operating system assigns a precedence value to each filter from the available block of precedence values that has the highest priority. Precedence values are assigned to maintain a precedence order specified by the application. Filters and their assigned precedence values are communicated to an entity that filters packets by applying the filters in the order of their precedence values. Filters for an application can be added, deleted, or modified without affecting the precedence values of other filters for other applications. If an assignment is to be made when the lowest priority block is not available, then a repacking operation is performed to fill unused blocks in the list. The repacking is performed to reduce signaling associated with communicating reassigned precedences values to the filtering entity.

Abstract: A search engine device includes a lookup circuit, such as a content addressable memory (CAM) array. This lookup circuit is configured to generate multiple active match signals in response to detecting multiple matches between a search operand applied to said lookup circuit and multiple entries therein, during a search operation. A priority sequencer circuit is also provided. This priority sequencer circuit, which is electrically coupled to outputs of the lookup circuit, is configured to sequentially encode each of the multiple active match signals according to priority.

Abstract: A method for communication includes accepting input data from two or more data sources, one or more of which include continuous synchronous tributaries, for transmission over a wireless communication link having a variable data rate. Relative priorities are assigned to the respective data sources. A currently-available data rate of the communication link is determined. The input data accepted from the data sources is multiplexed to produce a composite data stream. The input data of at least one of the tributaries is selectively omitted from the composite data stream based on the respective relative priorities, in order to match the data rate of the composite data stream to the currently-available data rate of the communication link. The composite data stream is transmitted over the communication link.

Abstract: Apparatus and a method for transmitting a plurality of streams of data packets through a computer network assigns queued packets from each of the plurality of data streams to respective slots in scheduling windows such that queued packets from respective ones of the plurality of data streams occupy different slots in respectively different ones of the scheduling windows. The packets are transmitted through the network in the order defined by the scheduling windows.

Abstract: 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.

Abstract: Methods and apparatus for an ATM network for implementing a fair servicing of all connections during a back-logged condition through the use of a weighted fair queuing technique. The system is particularly suited for systems where the packets/cells are of a fixed size. Although some important approximations are made in the proposed implementation, all of the properties of an ideal weighted fair queuing algorithm are preserved. The sorting methods and apparatus are advantageous in that it is possible to maintain appropriate servicing of connections without sorting all of the individual connections. This may be accomplished by pre-sorting each of the individual virtual circuit connections into a finite number of predetermined bins according to a weight associated with the connection. Thereafter, only the bins need be sorted without having to sort each of the individual connections.

Abstract: New switching technology relies upon state information for providing a previously unavailable degree of quality of service. In particular, by providing the ability to give service guarantees to uniquely identifiable sets of packets (“micro-flows”), different qualities of service can be offered for each transmission. The QoS associated with each micro-flow is characterized by a set of descriptors. These descriptors are communicated to each switch by the first packet of the micro-flow associated with the descriptors.

Abstract: 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.

Abstract: Apparatus and method for adapting a control plane of a communications network normally using a call session control function (CSCF) in communication with a resource access control function (RACF) by providing a priority service functional element (PS-FE) to handle call admission and priority services.

Abstract: The present invention provides a multi-mode mobile terminal and method of triggering a communication service using position information thereof, by which the multi-mode mobile terminal triggers its optimal communication service in a communication environment where various kinds of communications systems co-exist. The present invention includes acquiring a position of a multi-mode mobile terminal configured to operate in a plurality of separate communication modes and operating the multi-mode mobile terminal in the communication mode based on its position.

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

Abstract: A hierarchical traffic policer may include a first policer configured to pass first packets when a first condition is met. The first policer also may alter selection information within the passed first packets. A second policer may be configured to pass second packets when a second condition is met. The second policer may be further configured to pass all of the passed first packets from the first policer based on the altered selection information within the passed first packets.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for shaping traffic. These mechanisms and methods for shaping traffic can enable embodiments to control traffic flow at a network gatekeeper based upon policies implementing service level agreements dictating traffic characteristics permitted to applications and/or by network node. The ability of embodiments to provide service level agreement based control of network traffic can enable control of traffic flow by application and/or by network node.

Abstract: Computing resources available on multiple computing devices are consolidated by an intermediate computing system and provided to other computing systems when those computing systems need additional bandwidth and processing power they cannot provide by themselves.

Abstract: An apparatus and a method for providing a QoS for a multi protocol label switching (MPLS) traffic are provided. According to the apparatus and the method, a label and an experimental (EXP) are extracted from an MPLS packet input to an MPLS network system, and then applied to a predetermined hash function to generate at least one hash value. Also, a QoS policy is applied to an MPLS session, and the MPLS packet is forwarded. Therefore, the QoS for transmitting the MPLS packet input to the MPLS network system can be ensured.

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

Abstract: Method of managing priority during the transmission of a message, in an interconnections network comprising at least one transmission agent which comprises at least one input and at least one output, each input comprising a means of storage organized as a queue of messages. A message priority is assigned during the creation of the message, and a queue priority equal to the maximum of the priorities of the messages of the queue is assigned to at least one queue of messages of an input. A link priority is assigned to a link linking an output of a first transmission agent to an input of a second transmission agent, equal to the maximum of the priorities of the queues of messages of the inputs of said first agent comprising a first message destined for that output of said first agent which is coupled to said link, and the priority of the link is transmitted to that input of said second agent which is coupled to the link.

Abstract: The present invention relates to on-line admission-control decisions. Specifically, the invention concerns general delay bounds for both deterministic and statistical cases for Differentiated Services (DiffServ) networks. More specifically, a detailed method of calculation in each case is followed by simpler methods of calculation that are more appropriate for on-line admission-control decisions. Relatively involved occupancy bound calculations for various service classes take place only at the time of network configuration or reconfiguration. At the time of admission control only simple occupancy threshold compliance calculations need to be performed. Concrete illustrations are provided for deriving bounds for the EF and AF classes provided by DiffServ. These results are applicable to both layer-3 networks that support DiffServ and layer-2 networks that support the more restricted class of service functions.

Abstract: Certain embodiments of the present invention provide a method for communicating data including prioritizing data by assigning a priority to the data, analyzing a network to determine a status of the network, and communicating the data based at least in part on the priority of the data and the status of the network. Certain embodiments of the present invention provide a system for communicating data including a data prioritization component, a network analysis component, and a data communications component. The data prioritization component is adapted to prioritize data by assigning a priority to the data. The network analysis component is adapted to analyze a network to determine a status of the network. The data communications component is adapted to communicate the data based at least in part on the priority of the data and the status of the network.

Abstract: A method, system, and apparatus for prioritizing network traffic according to one embodiment includes receiving a packet addressed to a receiver device from a sender device, identifying the packet at a network layer to determine an application and/or protocol associated with the packet, and generating traffic priority information associated with the packet based upon the identification. In at least one embodiment, the traffic priority information indicates traffic prioritization between the sender device and the receiver device. The method further includes forwarding the packet to the receiver device, receiving an acknowledgment packet from the receiving device, and inserting the traffic priority information into the acknowledgment packet at a transport layer. In at least one embodiment, the acknowledgment packet is forwarded to the sender device. In various embodiments, the packet is identified at the network layer using deep packet inspection.

Abstract: A semiconductor integrated circuit of the invention comprises a plurality of cores, and an interconnecting network including adaptors connected to each of the cores and a plurality of routers connecting the adaptors to communicate therebetween. Transmission side adaptors store first delivery information, and control delivery of the request signal to be received from the first core in accordance with the first delivery information. Reception side adaptors store second delivery information, and control delivery of the request signal to be received through the interconnecting network to the second core in accordance with the second delivery information. The first delivery information and the second delivery information are hierarchically set.

Abstract: A packet switching node in a pipelined architecture processing packets received via an input port associated with the packet switching node performs a method, which includes: determining a packet frame type; selectively extracting packet header field values specific to a packet frame type, including packet addressing information; ascribing to the packet a preliminary action to be performed; searching packet switching information tracked by the packet switching node based on extracted packet addressing information; formulating a preliminary switch response for the packet; classifying the packet into a packet flow; modifying the preliminary switch response in accordance with one of the preliminary action, the packet flow into which the packet was classified, and a default port action corresponding to the input port; modifying the packet header in accordance with one of the preliminary action, the packet flow, and the default port action; and processing the packet.

Abstract: Transfer of data is facilitated between at least one peer application and a host, via a network and network interface circuitry associated with the host. That is, data destined for the host is provided from the peer to the network interface circuitry via the network. The NIC has the capability to offload the processing of data provided according to particular protocols. In addition, based on characteristics of the data, a filtering rule associated with those characteristics may be applied to the data prior to providing the data to the host. When there are a plurality of filter rules associated with characteristics of the data, in some examples, it is automatically determined which one of the plurality of filter rules associated with characteristics of the data to apply to the data.

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

Abstract: Described are techniques for prioritizing messaging traffic. A first message having a second message encapsulated in a payload of the first message is received. It is determined whether the first message meets one or more prioritization criteria in accordance with one or more portions of a payload of the second message.

Abstract: A broadband wireless access system including: a base station that allocates an uplink bandwidth to each connected subscriber station according to at least one algorithm; and at least one subscriber station that when there is no voice information to be sent through the uplink bandwidth allocated from the base station according to an unsolicited grant service (UGS) algorithm, detects another packet based on another algorithm, encapsulates the detected packet, and sends the encapsulated packet in a payload field of a UGS packet to the base station through the uplink bandwidth. Thus, the broadband wireless access system maximizes utilization of the bandwidth allocated according to the UGS algorithm.

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

Abstract: Preemption techniques are disclosed which permit multiple high-priority packets to preempt a single low-priority packet. In one aspect, a first device is configured for communication with a second device via an interface bus. The first device comprises interface circuitry configured to receive from the second device a start indicator of a first type and a start indicator of a second type, and to allow at least one data segment associated with the start indicator of the second type to preempt at least one data segment associated with the start indicator of the first type. The start indicator of the second type may have a longer pulse width than that of the start indicator of the first type, such as a double-length pulse width. The first and second devices may comprise physical layer and link layer devices of a communication system.

Abstract: A wireless communication device that performs packet transmission in accordance with a packet transmission system that performs wireless bandwidth allocation by virtual carrier sensing has a time-point management section that manages the time-point and outputs current time-point information, and a parameter management section that manages a parameter relating to packet transmission right acquisition priority.

Abstract: An improved scheduling mechanism usable for a data transmission in a packet based network is provided. A plurality of connections is detected, and for each of the connections, a buffer occupancy level is determined. Then, the connections having a smaller buffer occupancy level are prioritized in comparison to the other connections, and packets of the plurality of connections are scheduled on the basis of the result of the prioritizing. The scheduling mechanism is implemented in a network element of the packet based network or in a sender and receiver.

Abstract: A medium access control (MAC) architecture reduces transmission latency for data block retransmissions. A plurality of data blocks are received and temporarily stored in a first memory (e.g., queue, buffer). The plurality of data blocks are then transmitted. A determination is made as to whether each of the transmitted data blocks was received successfully or needs to be retransmitted because the data block was not received successfully. Each of the transmitted data blocks that needs to be retransmitted is marked and temporarily stored in a second memory having a higher priority than the first memory. The marked data blocks are retransmitted before data blocks stored in the first memory.

Abstract: Disclosed are, inter alia, methods, apparatus, data structures, computer-readable media, and mechanisms, for policy-based processing of packets, including mechanisms for managing the policies. A user is authenticated and its user group identifier is identified. A packet is received and is associated with the user group identifier, and one or more fields (typically other than the source address field) of the packet are used to identify a second group identifier. A lookup operation is then performed on a policy based on the first and second group identifiers to identify a packet processing action to be performed on the packet. These identifiers are typically not network addresses, which disassociates the policy from physical network addresses (which often are dynamically assigned and may also vary based on the access point into the network of a user), and allows a switching device to process packets based on a policy stated using group identifiers.

Abstract: A network communication system and a method of controlling the network communication system are provided. The network communication system includes: a member reading at least one piece of data stored in an access point (AP); a member giving priority to the data; a member re-transmitting the data having the priority to the AP; and a member processing the data in the AP according to the priority. Thus, data can be efficiently processed according to predetermined priority using a low-end type AP as a high-end type AP is used.

Abstract: The present invention relates to communicating control information in a mobile communication system, by which new control information can be transmitted more quickly. The present invention comprises transmitting a first data block comprising control information for transmitting first data when no resources for the transmission of the first data are available, receiving second data from an upper layer to be transmitted, wherein the second data has a higher priority than the first data, and transmitting a second data block comprising updated control information for transmitting the first and second data when no resources for the transmission of the first and second data are available.

Abstract: Methods, systems and computer program products for packet prioritization based on delivery time expectation. Exemplary embodiments include receiving a packet for routing, estimating a TimeToDestination for the packet, the estimating performed by a Internet Control Message Protocol, reading a TimeToDeliver field from each the Internet Protocol Header of the packet to extract data on when the packet needs to be at the destination, determining a MaxQueueDelay for the packet, the MaxQueueDelay calculated by subtracting the TimeToDeliver from the TimeToDestination, passing a lower priority packet if the lower priority packet has a lower MaxQueueDelay, and decrementing the TimeToDeliver by an amount of time the network router has had the packet in the queue before passing the packet to a next router, thereby communicating to the next router how much time is left before the packet must be delivered.

Abstract: The present invention relates to a communication control system, and provides specifically a peer-to-peer (P2P) communication control system making it possible to effectively exploit P2P communication within an organizational network.

Abstract: A mobile communications base station has a service quality detection unit that monitors and measures communication qualities of wireless terminals currently located in the service area, and a packet classification unit that classifies packets addressed to the wireless terminals into two or more groups based on the measured communication qualities. The base station also has a buffering delay measuring unit that measures buffering delay of the packets for each of the groups. A transmission priority detection unit of the base station determines the order of priority for transmitting the packets based on the measured buffering delay in comparison with a prescribed threshold value. A resource allocation unit of the base station allocates the radio resources to the packets based on the order of priority to transmit the packets to the associated wireless terminals.

Abstract: A scheduler utilizes a data structure in the form of an augmented, pruned, radix tree to implement 2-key scheduling.

Abstract: A switch includes an arbiter that receives a plurality of requests from N input ports, and determines N round robin arbitration option winners by performing N round robin arbitration options on the requests, each of the N round robin arbitration options performed assuming that a different one of the N input ports was a previous round robin arbitration winner. After the actual previous round robin arbitration winner is identified, a current round robin arbitration winner from among the N round robin arbitration option winners is determined by selecting the round robin arbitration option winner in which the assumed previous round robin arbitration winner is the actual previous round robin arbitration winner.

Abstract: Terminals #1 to #3 which have already been connected and a terminal #4 which wants to make a new connection send packets to a base station in that order. The base station queues the packets from the terminals #1 to #3 at a non-priority queue and the packet from the terminal #4 at a priority queue. For example, a predetermined amount of packets from a new connection is queued at the priority queue. Packets in the priority queue are dequeued with priority. Therefore, the packet sent from the terminal #4 is first sent to a base-station controller, and then the packets sent from the terminals #1 to #3 are sent to the base-station controller. As a result, the base-station controller first receives the packet sent from the terminal #4, and the period of time required for the terminal #4 to establish a connection is reduced.

Abstract: Prioritizing workload and tasks by first determining if a prioritization state change is necessary, and if so setting priorities to change the prioritization state, and if not examining prioritization state determining inputs, calculating new prioritization states, and updating prioritization states. Next interrupts are processes and prioritization states are updates. The resulting settings and prioritization states are examines, new prioritization states calculated, the new prioritization states compared with existing prioritization states, and the prioritization states changed as a function of present prioritization states and calculated new prioritization states. As a last step either a new prioritization state is set and saved, or the existing prioritization states saved.

Abstract: An apparatus including a first buffer, a second buffer and a priority switch circuit. The first buffer is configured to store data of a first data stream having a first priority. The second buffer is configured to store data of a second data stream having a second priority. The priority switch circuit is coupled to the first buffer and the second buffer and is configured to interrupt a transmission of the first data stream from the first buffer upon detection of data of the second data stream and transmit data of the second data stream.

Abstract: In a data system, such as a cable modem termination system, different-priority flows are scheduled to be routed to their logical destinations by factoring both the priority level and the time spent in queue. The time that each packet of each flow spends waiting for transmission is normalized such that the waiting times of all flows are equalized with respect to each other. A latency scaling parameter is calculated.

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

Abstract: A method for communication includes encapsulating multiple data packets, which carry data and have respective drop precedence (DP) values selected from a range of possible DP values, to produce a concatenated frame of a transport protocol. A composite drop precedence (CDP) value is assigned from the range to the concatenated frame using a pseudo-random assignment function that depends on a distribution of the DP values of the data packets in the concatenated frame. The concatenated frame is transported through a communication network using the transport protocol, in accordance with the pseudo-randomly assigned CDP value.

Abstract: A multi-source data multiplexing system that accepts information packets from a plurality of signal sources, evaluates the relative efficiencies of data transmission, and transmits the information packets in provided grant regions for maximum efficiency. The multi-source data multiplexing system may accept any form of information packet from any form of signal source. The system receives a grant region, typically comprising a transmission time on a data channel, and inserts a information packet into the grant region. The actual information packet placed in the grant region may be one other than the packet for which the grant region was intended. Further, the multi-source data multiplexing system may fragment an information packet and transmit only a portion of the information packet in the grant region.

Abstract: The present invention provides a system and method for prioritizing delay-sensitive packets relative to each other for transmission from a router in a network, based on a delay variation estimated for each delay-sensitive packet by a quality of service monitor. In accordance with the present invention, late delay-sensitive packets are assigned a higher priority than, and are transmitted before, other delay-sensitive packets, thereby reducing the level of jitter and improving the quality of the packet streams that comprise late delay-sensitive packets.

Abstract: An environment dependent network connection switching setting system and method thereof is provided, wherein the network connection is interrupted due to changes of the network environment of the user, the system is utilized to automatically detect a set of optimal current network setting parameters based on the network setting parameters previously set by the user, and proceed with network connection based on the optimal current network setting parameters, thus facilitating and expediting network connection in the changing network environments.