Abstract: A method of dealing equitably with traffic from multiple VPNs feeding into a single router utilizes the weighted fair queueing (WFQ) technique of the prior art in combination with a “service level” queue comprising a set of tokens defining the class of service (COS) with the next packet to be transmitted and a queue selector that functions to query each queue in a round robin fashion. The service level queue ensures that the higher priority traffic will be transmitted first, while the queue selector ensures that each VPN will receive similar service. The queue selector may be “weighted” in that if a particular VPN generates substantially more traffic than the other VPNS, that VPN will be selected more than once during a round robin cycle to transmit a packet (“weighted round robin” WFQ).

Abstract: A scheduler for a packet switch in a high-speed network. In various embodiments, switch throughput and fairness is improved by operating on request data before arbitration. Other embodiments further include forms of weighted round robin (“WRR”) allocation of output bandwidth prior to arbitration. In various embodiments, the WRR allocation is performed at more than one level. For example, an output applies WRR allocation to all inputs requesting access to that output. In addition, an input applies WRR allocation to multiple classes of data on that input.

Abstract: When multicast distribution is performed on a network where a point-to-point connection is made between user terminals and a multicast router, the multicast router is protected from load due to response reports, join requests, or leave statements sent from the user terminals simultaneously. If the user terminals send response reports simultaneously, a Layer 2 switch disposed between the user terminals and the multicast router limits response reports sent to the multicast router. The Layer 2 switch prevents response reports sent from the same user terminal from being discarded consecutively, by sending a response report sent from the same user terminal to the multicast router 200 with priority in the next join confirmation event. If the user terminals send join requests or leave statements simultaneously, the Layer 2 switch limits the join requests or leave statements sent to the multicast router 200 in the same manner.

Abstract: This invention has as an object the provision of a routing processing device and packet type identification device, which can alleviate the load on a processor performing routing processing. A routing processing device and packet type identification device of this invention comprise a packet information extraction portion, which extracts from a packet for identification a prescribed range of fields including at least one identifying information item which identifies the packet type, and a packet judgment portion, which judges the packet type based on information in a prescribed position among the extracted fields.

Abstract: Data structures within a shared computer-generated environment, are updated. A user terminal has memory a processor, input, network connection and a display. The memory stores data structures and instructions. The instructions configure the processor to supply an output image on a frame-by-frame basis to the output display by rendering the data structures. The data structures are updated in response to input data from another network-connected terminal or in response to delayed locally-generated input data received from the input. The data structures are extrapolated to produce output data if the data structure has not been updated in response to network input or in response to delayed locally-generated input.

Abstract: A method of dynamic transmission resource allocation that operates in a wireless network. The wireless network includes a plurality of mobile terminals each managing a given number of different data flows of protocol data units that are classified according to a set of flow types, a radio resource management unit for allocating transmission resources on a per protocol data unit basis, a plurality of schedulers operating according to a specific set of rules, and a selector for sharing the transmission resource among the mobile terminals.

Abstract: A method for operating a server having a maximum capacity for servicing requests comprises the following steps: receiving a plurality of requests; classifying each request according to a value; determining a priority for handling the request according to the value, such that requests with higher values are assigned higher priorities; placing each request in one of multiple queues according to its priority value; and dropping the requests with the lowest priority when the plurality of requests are received at a rate that exceeds the maximum capacity. The server operates according to a session initiation protocol. Classifying each request comprises running a classification algorithm.

Abstract: Techniques for selecting a call completion response from a group of call completion responses based on weights associated with the call completion responses, are provided. A server processes a call invitation for a callee by forwarding the call invitation to each of the callee's endpoints. Each of the callee's endpoints associates a weight to its call completion response it generates to accept or reject the call invitation. The server waits to receive the call completion responses from each of the callee's endpoints or for a predetermined period of time (i.e., a timeout), and uses the weights associated with the received call completion responses to decide which of the received call completion responses to use to complete the call invitation.

Abstract: Methods, apparatus, data structures, computer-readable media, and mechanisms may include or be used with a hierarchy of schedules with propagation of minimum guaranteed scheduling rates among scheduling layers in a hierarchical schedule. The minimum guaranteed scheduling rate for a parent schedule entry is typically based on the summation of the minimum guaranteed scheduling rates of its immediate child schedule entries. This propagation of minimum rate scheduling guarantees for a class of traffic can be dynamic (e.g., based on the active traffic for this class of traffic, active services for this class of traffic), or statically configured. One embodiment also includes multiple scheduling lanes for scheduling items, such as, but not limited to packets or indications thereof, such that different categories of traffic (e.g., propagated minimum guaranteed scheduling rate, non-propagated minimum guaranteed scheduling rate, high priority, excess rate, etc.

Abstract: An operating system allows assignment of an input message priority to a particular socket. This priority is used by the operating system to determine what socket's inbound packets get discarded when the server resources are constrained. Sockets of a lower priority than another will have its inbound packets discarded before higher priority sockets. This allows an application to give selected sockets higher inbound message priority over other sockets.

Abstract: A method and system for switching data in a data switch. In one embodiment, the present invention comprises receiving a plurality of cells at a merged input queue of the data switch, wherein a cell of the plurality of cells is characterized by a priority and a destination. In one embodiment, the destination identifies an output port of the data switch. An age tag is assigned to at least one cell of the plurality of cells. In one embodiment, the age tag indicates the relative length of time a cell of has been in the merged input queue as compared to other cells of the plurality of cells. A portion of the plurality of cells is selected according to a priority selection. It is determined whether any cells of the portion have the same destination. At least one connection request associated with cells of the portion is transmitted, wherein cells having the same destination are transmitted according to the age tag.

Abstract: Multi-channel processing control device and method that efficiently performs enhanced customer service geared to the channel and service characteristics, and that can be readily modified to suit future expansion. A process request generated at a BC controller client (21) is sent as a queue registration request to a dispatcher (32) of a BC controller server (31) via a queue controller DLL (24). In the event of a queue requiring real-time processing, an event transmission and reception unit (25) of the most appropriate client is notified via a BC-BUS (34). A queue not requiring real-time processing is registered at a queue manager (33), where it is managed.

Abstract: Message cells, cell comprising partially different priorities are transmitted via a first communication network. According to the invention, at least one of the message cells to be transmitted and comprising the same priority is added to a user data field of at least one data packet of a second packet-oriented communication network. A transmission priority (user priority) derived from the priority of the at least one added message cell, cell is associated with the data packet, according to which the at least one data packet is at least partially transmitted with the at least one added message cell, cell to/via the packet-oriented communication network. Advantageously, the message cells comprising the same priority or service category and pertaining to different virtual connections are added to a data or transmission frame of the packet-oriented communication network, thus fulfilling real time requirements.

Abstract: A method and apparatus for logical identification priority have been disclosed.

Abstract: The Ethernet packet transmission apparatus includes: a packet transceiving unit for transceiving an Ethernet packet through a plurality of Ethernet ports; a MAC header processing unit for receiving the Ethernet packet and reading header information; a packet processing unit for receiving the Ethernet packet, classifying the received Ethernet packet on a service or destination basis, assigning a priority label to the classified Ethernet packet on a packet-by-packet basis, and outputting memory state information on the corresponding port; a congestion controlling unit for controlling a position in an output sequence of the Ethernet packet; and a signal processing unit for receiving and comparing the port state information and the memory state information and outputting either a memory control signal or a congestion control signal to control the packet processing unit and the congestion controlling unit.

Abstract: Disclosed is a method for queuing in a communications network. The method positions data related to a user based on a grade of service (GoS) assigned to the user. The positioning of the data is accomplished according to a throughput range assigned to the user.

Abstract: A packet transmission device improved in packet transmission efficiency. Each packet input processor generates a pointer and identifies a packet type with respect to a received packet, and generates identification data including the pointer and the packet type identification result. A memory access controller detects a header readout amount of the packet based on the packet type identification result, generates first readout data including the header readout amount and a readout pointer indicative of a storage location of the packet in a shared memory, and adaptively reads out header data of the packet from the shared memory in accordance with the first readout data. A protocol processor analyzes the destination of the read header data, and a packet updater updates the old destination address of the packet to a new one to generate a packet with the updated destination address, and outputs the generated packet.

Abstract: The present invention relates to a method and system for scheduling data packets in a base station device of an access network. An information indicating a retransmission status of a data packet is provided to the base station device, and a scheduling priority is allocated to the data packet based on the retransmission status information. Thereby, retransmission packets can be scheduled earlier and round trip times can be reduced, so as to decrease the risk of timeouts and stalling and to loosen buffer requirements.

Abstract: A technique for managing a customer's traffic in a network node, such as a service provider edge device, involves dedicating a group of queues in the network node to the customer, performing queue-specific rate shaping on the customer's traffic according to queue-specific bandwidth limitations, and performing group-specific rate shaping on the customer's traffic as a whole according to a group-specific bandwidth limitation. In an embodiment, the queues in the group are associated with different types of customer traffic in order to provide type-specific rate shaping. Further, the queues may be prioritized among each other such that unused excess bandwidth is distributed among the different traffic types in priority order.

Abstract: A method of enforcing network bandwidth limitation includes receiving a request from a client for transmission of a server's feed data and receiving a client timestamp from the client. The method further includes determining if feed data in a previous transmission from the server to the client has been lost, and if so, reimbursing the client for the lost data. The method further includes determining if the client is eligible to receive the requested feed data transmission from the server, and if the client is eligible, then immediately transmitting of the most recent available requested feed data from the server to the client, but if the client is not eligible, then preventing the transmission and withholding the feed data from the client without prolonging the duration of any network connection from the server to the client.

Abstract: Systems and methods for scheduling data packets in a network processor are disclosed. Embodiments provide a network processor that comprises a best-effort scheduler with a minimal calendar structure for addressing schedule control blocks. In one embodiment, a four-entry calendar structure provides for rate-limited weighted best effort scheduling. Each of a plurality of different flows has associated schedule control blocks. Schedule control blocks are stored as linked lists in a last-in-first-out buffer. Each calendar entry is associated with a different linked list by storing in the calendar entry the address of the first-out schedule control block in the linked list. Each schedule control block has a counter and is assigned a rate limit according to the bandwidth priority of the flow to which the corresponding packet belongs.

Abstract: A system and method of scheduling radio resources for a plurality of users in a packet-switched radio communication network. A scheduling number (Si) is calculated for each user before each scheduling event. A weight (Wi) is assigned to each user based on an associated Quality of Service. The Si varies depending on the assigned Wi and when the user entered the scheduling session. Radio resources are assigned to the user having the largest ratio Wi/Si between the weight and the scheduling number.

Abstract: A system and method are provided for controlling the computing bandwidth and resources provided to external entities based on subscription levels associated with those external entities. Higher subscription levels provide greater resource allocation. Accounting is accomplished by tracking bandwidth allocated and used over given periods of time.

Abstract: There are provided a packet transfer device, a semiconductor device, and a packet transfer system, which can provide a DMZ constructed in a simple configuration. A LAN is connected to a first port. A public server is connected to a second port. A WAN is connected to a third port. A filtering section performs filtering processing according to attributes of each packet inputted via any one of the first to third ports. A routing section carries out routing processing on the packet which was not discarded by the filtering section.

Abstract: A method for scheduling a transmission of ATM cells, the method includes: receiving an indication that a scheduling session should starts; and repeating the stages of: selecting a channel representative queue out of multiple queues that are associated with different quality of service traffic threads that belong to that channel; scheduling a transmission of frames from channel representative queues and from single queue channels; wherein the scheduling comprises processing a scheduling table that comprises multiple sets of entries, wherein each set of entries is associated with a different transmission priority level, and wherein at least one set of entries comprises a link to a transmission parameter table that is associated with a channel representative queue.

Abstract: A packet communication system of the present invention has first mode, second mode and third mode to apply to input packets. The first mode is a mode that decides priority of the packet by at least one of the address information and the application information, the second mode is a mode that decides priority of the packet by the DS value, the third mode is a mode that decides rewrite the DS value by at least one of the address information and the application information. A control unit of the packet communication system switches a mode to apply an input packet of the first mode, the second mode and the third mode based on the packet header information of the input packet.

Abstract: Methods and apparatus for phase and frequency drift and jitter compensation in a distributed switch which carries both TDM and packet data are disclosed. The methods include the insertion of programmable fill times at different stages of the switch to allow buffers to fill, driving service processors (line cards) with different clocks and synchronizing the service processors (line cards) to the switch fabric, providing redundant switch fabric clocks and methods for automatically substituting one of the redundant clocks for a clock which fails, providing redundant switch fabrics each having a different clock and methods for automatically substituting one switch fabric for the other when one fails. The apparatus of the invention includes a plurality of service processors (line cards), switch elements and clock generators. An exemplary clock generator based on an FPGA is also disclosed.

Abstract: Network switching and/or routing devices can use multiple priority data streams and queues to support prioritized serial transmission of data from line cards (or the like) through a fabric switch to other line cards (or the like). Preemption logic is used to insert within a data stream commands indicating a switch from one priority level data to another. Delimiter commands and combination switch/delimiter commands can also be used. Multiple crossbars are implemented in the fabric switch to support the various data stream priority levels.

Abstract: There are disclosed apparatus and methods for scheduling packet transmission. At least one scheduled traffic queue holds a plurality of scheduled packets, each scheduled packet having an associated scheduled transmit time. At least one unscheduled traffic queue holds plurality of unscheduled packets. A packet selector causes transmission of scheduled packets from the scheduled traffic queue at the associated scheduled transmit time, while causing transmission of unscheduled packets from the unscheduled traffic queue during the time intervals between transmissions of scheduled packets.

Abstract: Methods and apparatus for the provision of differentiated services in a packet-based network may be provided in a communications device such as a switch or router having input ports and output ports. Each output port is associated with a set of configurable queues that store incoming data packets from one or more input ports. A scheduling mechanism retrieves data packets from individual queues in accord with a specified configuration, providing both pure priority and proportionate de-queuing to achieve a guaranteed QoS over a connectionless network.

Abstract: A wireless network device that assigns priorities to communications in a network has a first circuit for receiving wireless messages from remote wireless network devices and a second circuit operable to send wireless messages to the remote wireless network devices. A third circuit makes a determination of the relative priorities of the remote wireless network devices. The wireless network device is operable to form a message to the remote wireless network devices, where the message is used to set a backoff time in the remote wireless network devices. The backoff time sent to the remote wireless network device is related to the relative priority of the remote wireless network device.

Abstract: A method of controlling data transmission in an Ethernet passive optical network (EPON) and an apparatus thereof are provided. Transmission permission messages using a mode of bandwidth allocation are queued in a queuing unit according to the types of the transmission permission messages. A transmission time duration of upstream data is defined for each of the transmission permission messages queued in the queuing unit. A bandwidth allocation unit generates transmission permission messages to allocate upstream data transmission bandwidth for an optical network unit (ONU), based on the transmission permission messages stored in the storage unit. A scheduler designates the predetermined priority, reads transmission permission messages from queues according to a predetermined priority, determines a transmission start time of upstream data, and outputs the transmission permission messages.

Abstract: In a data multiplexing network system, a first wavelength multiplexing function unit sets a plurality of different wavelengths which correspond to a plurality of different service classes, respectively, and maps each packet into each correspondent-wavelength which corresponds to each service class, to which the each packet belongs, and multiplexes the correspondent-wavelengths for the plurality of different service classes for a data transmission at a multiplexed-wavelength through a wavelength division multiplexing network. A second wavelength multiplexing function unit receives the each correspondent-wavelength and fetches a packet from the each correspondent-wavelength.

Abstract: In cell read from a buffer for each priority provided in the intermediate stage buffers 1-5-1-1-5-N, cells can be read even from a low priority buffer within a fixed time period and at the output interfaces 1-12-1-1-12-N, cell arrival can be monitored individually on a priority basis and on a basis of each of the input interfaces 1-1-1-1-1-N while taking a cell reading cycle at the intermediate stage buffer into consideration.

Abstract: The present invention is to disclose a scheduler which comprising a priority tagging module for receiving a plurality of information chucks, a plurality of output lines, and a WRR (weighted round robin) module. In this regards, each information chucks are tagged with a priority tag by said priority tagging module according to a priority classification scheme. In addition, the WRR module further comprises a bucket list, which has a plurality of buckets, and a control module. Each bucket stores a ticket, which comprises an identification representing one of the plurality of output lines and an associated weight value of the represented output line. Besides, the control module receives the tagged information chucks from the priority tagging module and schedules the tagged information chucks into the plurality of output lines according to a scheduling scheme based on said bucket list.

Abstract: An emergency alert system for alerting DSL subscribers of imminent perils includes an alert server connected over a direct link to an edge node of a metro network for receiving an event notification, configuring from an event notification a highest priority alert message, and broadcasting the alert message to subscriber terminals over the metro network. An add multiplexer (ADM) multiplexes the alert traffic with the regular traffic onto the direct link, anthe multiplexed traffic reaches the edge node of the metro network, which is configured with a high priority policy. The edge node discards the lower priority traffic in the presence of the alert traffic and an applet installed on said subscriber terminal accepts and displays the alert message in a browser or a media player.

Abstract: An apparatus and a method for managing resources for efficient packet data transmission. More specifically, there is provided a method for allocating transmission resources in a base station comprising determining a largest supportable packet size for a highest priority user, wherein the determination is based at least partially on the available modulation types, a total number of codes available for packet transmission, a total amount of available transmission power available for packet transmission, and frame durations supported by a base station.

Abstract: Priority propagation is achieved in the context of a rate-based scheduling hierarchy. Priority traffic is not delayed by non-priority traffic by more than the duration required for transmission of the maximum packet length at the physical interface speed. Multiple sibling priority levels are supported. To achieve these objectives, the scheduling hierarchy tree is divided into sub-trees corresponding to non-priority traffic and the different levels of priority. At each scheduling decision, a packet is selected from the highest priority non-empty sub-tree. Scheduling decisions within each sub-tree exploit the usual rate-based scheduling method but without priority propagation. When a packet from a priority sub-tree is chosen, scheduling state in the non-priority sub-tree is updated.

Abstract: Aspects of the invention include assigning a priority to a primary packet for a particular channel and replicating the primary packet to create a secondary packet for the particular channel. A primary packet may be selected in order to co-relate the primary packet to a legacy system. Similarly, a secondary packet may be selected in order to co-relate the secondary packet to a new system. The priority assigned to the primary packet may uniquely distinguish the primary packet from a priority of the other packets for the particular channel. The primary packet and the secondary packet may have the same priority and the same continuity counter.

Abstract: A method and system for a network node for attachment to switch fabrics is described. The system includes an access unit to provide access to communications from an external network, a classification element to label received packets with information identifying an associated flow and queue, a mapping element to place the packets into one of a plurality of queues based on the label identifiers, a scheduler to schedule packets in the queues for transmission, and an encapsulation element to encapsulate the scheduled packets into uniform size frames. The uniform size frames may then be transmitted to a next destination through a switch fabric.

Abstract: An apparatus and method for controlling the transmission of data packets from a base station in a wireless network to a plurality of mobile stations in a coverage area of the wireless network. The apparatus comprises a transmission scheduler for accessing a plurality of data packets received from a plurality of user devices requesting to transmit data packets to the mobile stations. The transmission scheduler receives a plurality of physical parameters associated with the data packets and calculates a plurality of scheduled priority values. Each of the scheduled priority values is associated with data packets from one of the requesting user devices. Each scheduled priority value is calculated by summing a plurality of products. Each product is determined by multiplying a variable derived from a physical parameter by a weighting factor.

Abstract: A method and apparatus transmitting and receiving in a real-time system are disclosed. The method of transmitting in a real-time system includes scheduling a task included in a socket based on a predetermined transmission option designated to the socket, and transmitting a packet generated by the scheduled task based on the predetermined transmission option, so that real-time communications of a network communication can be secured and resources of the system can be efficiently used, thereby, transmitting and receiving data according to the required characteristics of transmission and reception.

Abstract: A method includes a step of (A) determining which of multiple network interfaces indicates readiness to transmit a data element to a network and which of the multiple network interfaces indicates receipt of a data element from the network. The method further includes a step of (B) running, for each network interface indicating readiness to transmit a data element to the network, a transmit interrupt handler to load that network interface with a data element for transmission if such a data element is available for transmission within the data communications device, in response to giving higher priority to handling transmit interrupts relative to handling receive interrupts. The method further includes a step of (C) after step B, running, for at least one network interface which indicates receipt of a data element from the network, a receive interrupt handler to process that data element.

Abstract: A method of scheduling high-priority packets in a metro Ethernet switch is described. In one embodiment, the method comprises the steps of determining a maximum queuing delay allowed for at least two high-priority packets in an output queue in the switch; determining which one of the at least two high-priority packets has the smallest maximum queuing delay allowed; and scheduling the one of the at least two high-priority packets determined to have the smallest maximum queuing delay allowed before the remaining ones of the at least two high-priority packets.

Abstract: A communication switch that includes a multiprocessor control block and a method therefore is presented. The multiprocessor control block includes a centralized resource and routing processor that controls resource allocation and routing functionality within the switch. A plurality of intermediate processors operably coupled to the resource and routing processor perform call processing for corresponding portions of the connections supported by the switch, where such call processing includes issuing resource allocation requests to the resource and routing processor. Each of the intermediate processors further performs functions associated with a signaling layer portion of the protocol stack. The multiprocessor control block also includes a link layer processor operably coupled to the plurality of intermediate processors, where the link layer processor also couples to a switching fabric of the communication switch.

Abstract: Systems and methods for communication of scaleable-coded audiovisual signals over multiple TCP/IP connections are provided. The sender schedules and prioritizes transmission of individual scalable-coded data packets over the plurality of TCP connections according to their relative importance in the scalable coding structure for signal reconstruction quality and according to receiver feedback. Low-latency packet delivery over the multiple TCP/IP connections is maintained by avoiding transmission or retransmission of packets that are less important for reconstructed media quality.

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 includes receiving a priority message in an Internet Protocol Multimedia Subsystem (IMS) and identifying, via the IMS, resource availability through a first network and a second network. The method further includes routing, via the IMS, the priority message through one of the first network or the second network based on the identified resource availabilities of the first network and the second network.

Abstract: The transmission of signaling frames in a QoS system may be prioritized over the transmission of content frames carrying time-sensitive information. The signaling frames and the content frames may belong to a single communication session. Alternatively, the signaling frames may belong to a different communication session than the content frames. The signaling frames and the content frames may be audio frames, video frames or frames of other time-sensitive information.

Abstract: A packet scheduler controls dispatch of packets containing constant bit rate (CBR) or real time variable bit rate (rt-VBR) at an ingress operation of multiplexing the packets into payloads of an asynchronous transfer mode (ATM) bearer virtual circuit connection. Packets can be queued in one of a number of queues according to priority. The scheduler controls assembly of common part sublayer payload data units (CPS-PDU) comprising any unused octets from a previous packet partially dispatched, and whole packets in order of priority. If a holdover timer period expires before a common part sublayer payload data unit is completed, the payload of that data unit is packed with null data; and dispatched. The packet dispatch is controlled so as to match the traffic characteristics of an underlying bearer channel.