Abstract: An automatic, adaptive voice/data Ethernet device with automatic assignment of quality of service is disclosed. When a “short” packet arrives (where short can be a default value or a configured value, if desired), it is tagged and a table is searched based upon the packet's information. If there is no table entry, the packet's arrival time and size are entered into the table. If a table entry is found, a new interval is calculated by subtracting the last arrival time from the tagged value. If the new interval is approximately the same as the old interval, then the packet is sent to the appropriate output queue. If the new interval time is different than the old interval, the interval value is cleared. The present invention can improve the quality of service by reducing jitter.

Abstract: The present invention provides a system, method and apparatus for providing multiple quality of service classes to subscribers in a network by determining a subscriber's quality of service information by using a database containing quality of service information for each subscriber that has subscribed to one of the multiple quality of service classes, and storing the subscriber's quality of service information in a visitor location register where the subscriber is currently registered.

Abstract: A packet switch which includes input line interfaces for converting variable length packets received from input lines to fixed length cells, a switch unit for switching said packets in cell units, output line interfaces for converting output cells from the switching unit to variable length packets and transmitting the variable length packets over output lines. Each of the input line interfaces has a cell output controller for queuing the fixed length cells for each output line according to the degree of priority of the cells, and for selectively outputting the stored cells in the queues in order of priority, thereby to suppress the transmission of cells with a low priority during the times of congestion.

Abstract: A network traffic shaper includes a traffic shaper table for storing traffic specifiers, such as permissible data transmission rates, an arithmetic logic unit (ALU), and a high-speed forwarding trigger mechanism having at least one time-searchable data structure or queue and a retrieve time generator that substantially tracks, but never exceeds, a system time. As network messages are received, they are stored at a message buffer and certain message parameters, including message length and a corresponding traffic specifier, are provided to the traffic shaper. The traffic shaper determines when the message may be sent in accordance with the associated traffic specifier and stores this transmission start time along with the message's buffer location in the time-searchable queue of the forwarding trigger. The forwarding trigger continuously examines the transmission start times for previously stored messages.

Abstract: An adaptive weighted round robin scheduling apparatus and method schedules variable-length frame transmissions from a plurality of output queues having different transmission priorities by first allocating, for each queue, a number of bandwidth segments for a bandwidth cycle and a number of transmission opportunities for a round robin cycle, and then processing the queues consecutively in a round-robin fashion, beginning with a highest priority queue, until none of the queues has any bandwidth remaining. More specifically, during each iteration of a round robin cycle, a queue is permitted to transmit a frame if the queue has at least one remaining transmission opportunity, the queue has a frame ready for transmission, and the queue has at least one remaining bandwidth segment, and furthermore the number of transmission opportunities for the queue is decremented by at least one.

Abstract: The present invention includes a network telephone having a microphone coupled to provide voice data to a network, a speaker coupled to facilitate listening to voice data from the network, a dialing device coupled to facilitate routing of voice data upon the network, a first port configured to facilitate communication with a first network device, a second port configured to facilitate communication with a second network device and a prioritization circuit coupled to apply prioritization to voice data provided by the microphone.

Abstract: A method for scheduling data packets from a plurality of flows into a single flow. Data packets are broken into data segments and assigned a slack value based on how long the segment can wait until transmission begins. Every time a transmission opportunity passes, the slack value of the segment is decreased. The scheduler prioritizes the segments based on their slack value.

Abstract: In a system with multiple requesters making multiple requests for resources, an arbiter prioritizes requests based on the number of requests made by a requester. The highest priority is given to a requester that has made the fewest number of requests. Priority may instead be based on the number of requests made for a particular resource. Priority may also be based on a combination of number of requests made by a requester and number of requests made for a resource. The arbiter may also implement a starvation avoidance mechanism such as a round robin scheme.

Abstract: A multiplex communication system having a data repeater, which can prevent data from being lost so as to improve reliability of data communication, when a data repeater of a multiplex communication system repeats data. A multiplex communication system is made up of a plurality of communication groups including a plurality of communication lines and a data repeater. The data repeater is made up of receiving buffers, sending buffers, a data controller and a transfer-address table. The data controller selects multiplex communication lines through which the received data is to be repeated and transfers the received data thereto. The data controller has a priority-reset means for increasing a priority of a received data before being sent. The priority-reset means prioritizes a sending of the data from the data repeater, even if the data sent from the data repeater collides with the other data on the multiplex communication lines through which the received data is to be repeated.

Abstract: A method and apparatus for implementing Quality of Service (QoS) policy in a data communications network. A content addressable memory (CAM) contains flow information for each active flow of packets passing through a given node of a data communications network. The CAM has associated with each entry a packet counter, a byte counter, a token bucket, and a contract value. Each flow is assigned one of a plurality of output queues and optionally at least one output threshold value. An access control list CAM (ACLCAM) contains masked flow information. The ACLCAM provides an index to internal token bucket counters and preconfigured contract values of an aggregate flow table which becomes affected by the packet statistics. In this way, flows are aggregated for assignment of output queues and thresholds, possible dropping, and possible modification of packets.

Abstract: The assignment result reception circuit 11 receives the accumulation assignment result from the external portion, and sends the already-assigned input port and output port information to the assignment request mask circuit 12. The assignment request mask circuit 12 uses the already-assigned input port and output port information received from the assignment result reception circuit 11, performs the mask process on the connection assignment request received from the external portion, and sends its result to the M×N scheduler circuit 13. The M×N scheduler circuit 13 determines the assignment of the port connection in accordance with the information received from the assignment request mask circuit 12, and sends the connection assignment result to the external portion and the assignment result transmission circuit 14.

Abstract: A system and method for synchronously processing a packet are disclosed, which improve the speed of processing the packet by using a load balancing mechanism. The system comprises a switch and a clustered architecture for processing the packet. The switch is for receiving and transmitting the packet. The clustered architecture contains packet processing devices and receives the packet from the switch. All packet processing devices can synchronously process the packet. Each packet processing device has a non-duplicate device number.

Abstract: An arbiter circuit minimizes the occurrence of malfunctions and permits easy adjustment. The arbiter circuit includes a data transfer request signal holding device for accepting a plurality of data transfer request signals and holding the data transfer request signals in response to predetermined timing signals, a prioritizing device for determining only a signal with the highest priority at a certain point as a valid signal and the signals with lower priorities as invalid signals in order to assign priorities to output signals from the data transfer request signal holding device, and a delaying device for generating data transfer execution signals from the output signals of the prioritizing device. This arrangement restrains the occurrence of errors in assigning priorities to data transfer request signals and permits easy priority timing setting, thus allowing easy adjustment of a circuit to be achieved.

Abstract: The invention is directed to techniques for moving data elements within a data communications device which prioritizes handling transmit interrupts over handling receive interrupts. Preferably, while attending to transmit interrupts, the device gives priority to the “hungriest” interfaces. In one arrangement, the device includes multiple network interfaces which are capable of transmitting and receiving data elements with a network, and a controller, coupled to the interfaces.

Abstract: The principles of the present invention provide for providing contention free quality of service to wireless stations. A station indicates to an access point that higher priority data (e.g., time constrained data) is to be sent to the access point. The access point receives the indication and selects a slot time for the station based on the number of other stations that have also indicated higher priority data. A slot time is selected such that the station can check for access to a common wireless link before any stations with lower priority data (e.g., data without time constraints). The access point sends the selected slot time to the station and the station receives the slot time. When the station receives an indication that an application has higher priority data to send, the station checks the common wireless link for availability at the selected slot time.

Abstract: The present invention provides flow control for route switching in a communications system using retransmissions. It is well suited for a cellular mobile radio communications system, particularly a Universal Mobile Telecommunications System, UMTS.

Abstract: To provide a data communication apparatus capable of launching communication applications without impairing the real-time characteristic of a communication application having a high real-time characteristic in a case where plural communication applications including a communication application having a high real-time characteristic are present and to be launched at the same time.

Abstract: An apparatus for guaranteeing MCR in an ATM device includes at least one queue for each service category, a scheduler for dequeuing cells from the queues, a queue status block for indicating which queues are empty, and an MCR service block. The MCR service block includes a plurality of timers, at least one for each service category. According to the methods of the invention, an MCR value is selected for each queue (or service category) and a timer in the MCR service block is set according to the MCR value. The scheduler dequeues cells in strict priority from non-empty queues as determined by the queue status block. The scheduler is preempted, however, by the MCR service block when a queue fails to be serviced before its associated timer expires. The arrangement of queues and associated timers is subject to alternate embodiments.

Abstract: A method for dynamically allocating bandwidth among ATM cells and packets scheduled for output from an aggregation multiplexer of a transport-layer device configured to multiplex both ATM cells and packets onto the same channel of an optical fiber. The method includes local control and relative priority lookup of incoming ATM cells and packets to support output decision. When compared to currently employed methods, the required level of coordination with the receiving circuit for dynamic bandwidth allocation is substantially lower, thereby reducing operational complexity for network operators and latency for critical data when reallocating bandwidth.

Abstract: A communication method for a network where a plurality of communication devices are interconnected and a plurality of pairs of working channels and backup channels are set in two paths between adjacent communication devices to perform 1:1-protection communications. For information traffic of a type where importance determined by the type of information to be transmitted is relatively high, the 1:1-protection communications is performed by using working channels set in one of the two paths when there is no failure, and by switching to backup channels set in the other of the two paths when a failure is detected. For information traffic of a type where the importance is relatively low, communications is performed by using channels other than the working channels set for the information traffic of a type where importance is relatively high, in the two paths, when there is no failure.

Abstract: A bridge has a shared forwarding database and a plurality of ports. The bridge handles data associated with multiple virtual local area networks (VLANs). The shared forwarding database includes static entries for one or more devices which belong to multiple VLANs. Upon receiving data addressed to one of the one or more devices the bridge determines that the data should be source routed by retrieving the static entry from the shared forwarding database. The bridge then selects a bridge port to which the data should be forwarded on the basis of information in the data, such as a VLAN ID field.

Abstract: A system and method of increasing message throughput in a communications system utilizing priority management, conglomeration and compression, TCP retransmission filtering and pull transmission. The priority manages ranks the messages in a message queue as a function of the priority and time to live of each message. The conglomerator conglomerates messages into assemblies destined for the same destination radio. The TCP filter prevents the retransmission of successfully received messages. The messages are transmitted as a function of the availability of the destination radio to receive.

Abstract: Setting packet queue priority is disclosed. A rate associated with a packet queue is measured. The rate is compared to a quality of service metric. A priority is assigned to the packet queue based at least in part on the comparison between the rate and the quality of service metric. The quality of service metric may be a committed information rate and/or a peak information rate.

Abstract: The invention relates to a device for processing packets of flows on a network link, the device including scheduling means for scheduling packets in a queue in accordance with a fair queuing with priority algorithm.

Abstract: A switch is provided that implements flexible switch scheduling according to priority levels set in data, by means of a simple apparatus configuration. A scheduler provided in the switch includes a request distribution block that distributes transfer data connection requests according to the priority level of the transfer data, a first allocator that performs allocation for high-priority-level transfer data connection requests from among the distributed connection requests, a second allocator that performs allocation for low-priority-level transfer data connection requests, an allocation combination block that combines the results of allocation by the first and second allocators, and a grant generator that sets a switch execution block on the basis of the combined allocation result, and outputs Grant signals; and further includes a request mask block that masks connection requests that duplicate the result of allocation by the first allocator before allocation is executed by the second allocator.

Abstract: A sectioned ordered queue in an information handling system comprises a plurality of queue sections arranged in order from a first queue section to a last queue section. Each queue section contains one or more queue entries that correspond to available ranges of real storage locations and are arranged in order from a first queue entry to a last queue entry. Each queue section and each queue entry in the queue sections having a weight factor defined for it. Each queue entry has an effective weight factor formed by combining the weight factor defined for the queue section with the weight factor defined for the queue entry. A new entry is added to the last queue section to indicate a newly available corresponding storage location, and one or more queue entries are deleted from the first section of the queue to indicate that the corresponding storage locations are no longer available.

Abstract: The present invention is directed to a method and apparatus for scheduling a resource to meet quality of service guarantees. In one embodiment of three levels of priority, if a channel of a first priority level is within its bandwidth allocation, then a request is issued from that channel. If there are no requests in channels at the first priority level that are within the allocation, requests from channels at the second priority level that are within their bandwidth allocation are chosen. If there are no requests of this type, requests from channels at the third priority level or requests from channels at the first and second levels that are outside of their bandwidth allocation are issued. The system may be implemented using rate-based scheduling.

Abstract: There is disclosed a method and controller for controlling an information flow in an acyclic data transmission system including receiving a plurality of data packets, and allocating a priority level for each data packet including a class of loss for the data packet and a class of urgency of service for the data packet. The method and controller also include servicing the data packets in accordance with the priority levels and outputting the data packets at a configured rate.

Abstract: In an ad hoc network comprising an initiator for use by a user transmitting a request to provide a service, and a plurality of components, etc. such as a CD player, etc., the initiator collects a table of contents describing a service, etc. which can be provided by each component before receiving a service, refers to the information about a table of contents, and lists available services. A user is allowed to select a service, and receives a desired service from a device to which predetermined components are connected by cable or by wireless.

Abstract: A system and method for processing information transport elements, such as ethernet packets, at interfaces to a forwarder. Modules that implement processing logic are allocated per interface and per direction (i.e., inbound or outbound). At any given interface, a series of modules would be used to process inbound packets; likewise, a set of modules would be used to process outbound packets. For inbound packets, the modules allocated for inbound processing are executed when the packet is received from the interface, before sending the packet on to the forwarder. For packets that are outbound from the forwarder, the modules allocated for outbound processing are applied when the packet is sent by the forwarder, prior to any other processing, e.g., queuing to hardware. To assign modules to different interfaces at a forwarder, a registration process is performed during the system start-up process, or dynamically at runtime.

Abstract: Data for an application is routed over a highest priority, available network from multiple networks that are assigned application-specific routing priorities. Data of the application is received and the highest priority network for the application is determined based on the application-specific routing priorities. The received data is sent over the highest priority network when the highest priority network is available. When the highest priority network is unavailable, a next highest priority network is determined based on the assigned application-specific priorities for the application. The data is sent over the next highest priority network when the highest priority network is unavailable and the next highest priority network is available.

Abstract: A method for deadline based scheduling for asynchronous transfer mode adaptation layer, type 2, messages, in accordance with the present invention, includes calculating, for a list of channels, a last possible transmit time for messages on each of the channels in accordance with system criteria. The list of channels is prioritized in an ordered list based on a last possible transmit time for the messages for each of the channels. The messages for the channels are transmitted in accordance with the ordered list. Also disclosed is a method for requesting for quality of service.

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: An apparatus for preparing at least a first (#1) and a second data flow (#2) for transmission in a mobile network comprises a weight determination means (40) for determining at least one transmission priority for said first data flow (#1) and at least one transmission priority for said second data flow (#2) according to their classes. The apparatus further comprises a scheduling means (1) for scheduling said first and second data flow (#1, #2) for transmission in the mobile network depending on their transmission priority determined. Also a method for preparing the first and second data flow (#1, #2) is described.

Abstract: A system and method places signaling message frames in a traffic channel carrying voice frames so that the signaling message transmission does not seriously impact voice quality. This is accomplished by producing a first stream of voice encoded packets and a second stream of signaling message packets. The signaling message packets are prioritized in the second stream relative to the voice encoded packets in the first stream. An arbitration element arbitrates between the voice encoded and prioritized signaling message packets, which are multiplexed as a function of this arbitration. The multiplexed voice encoded and prioritized signaling message packets are then transmitted.

Abstract: A network architecture includes a communication network that supports one or more network-based Virtual Private Networks (VPNs). The communication network includes a plurality of boundary routers that are connected by access links to CPE edge routers belonging to the one or more VPNs. To prevent traffic from outside a customer's VPN (e.g., traffic from other VPNs or the Internet at large) from degrading the QoS provided to traffic from within the customer's VPN, the present invention gives precedence to intra-VPN traffic over extra-VPN traffic on each customer's access link through access link prioritization or access link capacity allocation, such that extra-VPN traffic cannot interfere with inter-VPN traffic.

Abstract: An integrated circuit processes communication packets and comprises a core processor and scheduling circuitry. The core processor executes a software application that directs the core processor to process the communication packets. The scheduling circuitry comprises multiple scheduling boards where at least some of the scheduling boards have multiple priority levels. The scheduling circuitry processes the scheduling boards to schedule and subsequently initiate transmission of the communication packets.

Abstract: A multi-priority encoder includes a plurality of interconnected, single-priority encoders arranged in descending priority order. The multi-priority encoder includes circuitry for blocking a match output by a lower level single-priority encoder if a higher level single-priority encoder outputs a match output. Match data is received from a content addressable memory, and the priority encoder includes address encoding circuitry for outputting the address locations of each highest priority match line flagged by the highest priority indicator. Each single-priority encoder includes a highest priority indicator which has a plurality of indicator segments, each indicator segment being associated with a match line input.

Abstract: The present invention provides a packet (400, 410 or 420) having a message (404) and a processing priority (402) associated with the message (404). The processing priority (402) is dynamically changeable by a function operating on the message (404). The present invention also provides a method for associating a processing priority (402) to a message (404) by receiving the message (504), determining the processing priority for the message (506) and associating the processing priority with the message such that the processing priority is dynamically changeable by a function operating on the message (508). In addition, the present invention provides a method for scheduling messages by receiving one or more messages (904) and storing each message in a multidimensional processing queue based on a processing priority and an attribute associated with the message (906). Each queued message from the multidimensional processing queue is scheduled for processing based on an algorithm (908).

Abstract: An integrated circuit processes communication packets and comprises co-processor circuitry and a core processor. The co-processor circuitry is configured to operate in parallel with the core processor. The co-processor circuitry receives and stores the communication packets in data buffers. The co-processor circuitry also determines a prioritized processing order. The core processor executes a packet processing software application that directs the processor to process the communication packets in the data buffers based on the prioritized processing order.

Abstract: In the packet scheduling device, the output class selection part is made to conduct the selective output of priority class, based on the weight count value calculated from a weight value corresponding to minimum guarantee bandwidth for each priority class and the amount of packet accumulated in each queue. The output class selection part operates so that if the weight count value is “0” or more, then the packet length of variable-length packet data to be output is subtracted from the current weight count value to give a renewed weight count value. On the other hand, if the weight count value is less than “0”, until reaching a predetermined repeat count (Cmax−1), the weight value of each priority class is added to the weight count value of all priority classes, and, when reaching the repeat count (Cmax−1), the weight value is added to the weight count value of all priority classes or replaced by half the weight value.

Abstract: A system enables a cell of data to be transmitted one time over a high speed data bus to an Ethernet switch system where it is then distributed to each of the destinations for which it is intended. A first group of buffers is for temporarily storing data that is to be delivered to only one destination. A second group of buffers is for holding the cells that are to be transmitted to a plurality of devices. In the described embodiment of the invention, the unicast and multicast cells are transmitted over the same line or bus. The invention further includes a switch processor that is formed to detect congestion within the switch fabric and to transmit a congestion rating to each device coupled to transmit and receive data through the switch fabric.

Abstract: Method and Apparatus for delivering audio signals from a source node to a destination node on a network. The apparatus uses a number of switches that transmit prioritized data on a packet network. The switches are coupled to a number of send/receive nodes for sending and receiving digital audio signals on the data network. The audio packet size and the receive buffers are sized to store a minimum possible number of audio samples to minimize latency in processing audio signals arriving at said receive node, but still ensure audio delivery without interruption due to packet data network delay. An additional feature of the invention is recovery of clock synchronization over the same data network by novel arrangement of transmission of timing packets on the network.

Abstract: In a means for forwarding message cells transmitted according to the asynchronous transfer mode, the message cells of a plurality of blocks are supplied to an interface that supports back pressure of traffic. A 100% utilization of the interface is achieved in that a block only receives an authorization for forwarding a message cell when it has a message cell with payload data.

Abstract: A novel method of servicing multiple data queues having different priorities is provided in a network switch. A dequeuing logic circuit services the data queues in a round-robin fashion. Programmable number of data packets is selected from each data queue in each cycle. The dequeuing logic circuit compares the number of data packets selected from a current data queue in a current cycle with the preprogrammed number of data packets set for the current queue, and selects a data packet from the current data queue only if the number of packets selected from the current data queue in the current cycle is less than the preprogrammed number. Selection of a data packet from the current data queue is bypassed, processing a next data queue, if the number of packets selected from the current data queue in the current cycle is not less than the preprogrammed number.

Abstract: The invention intends to transmit audio signals of multiple channels in such a manner as to be able to decode and reproduce them in real time on the receiving side. Digital signals of multiple channels are each divided into one or more fragments in an audio signal input circuit, and the fragments of multiple channels are each encoded into coded fragment data by an encoder of the corresponding channel. At the time when transmission of one of the coded fragment data is ended, a multiplexer selects another of the coded fragment data of multiple channels to be next transmitted, and supplies it to a transmitting circuit.

Abstract: A system and method for a cell based wrapped wave front arbiter (WWFA) with bandwidth reservation are disclosed. The method for reserving bandwidth of a given priority using the WWFA for arbitrating bandwidth among virtual links between input and output ports, each virtual link supporting one or more priorities and corresponding to an arbitration unit (AU) of the WWFA generally comprises performing at least one arbitration pass of a wave front of the WWFA where AUs having a reserved bandwidth request of a given priority and reserved bandwidth credit of the given priority compete for the bandwidth associated with the wave front, and where AUs not having a reserved bandwidth request of the given priority and reserved bandwidth credit of the given priority do not compete for the bandwidth, and performing at least one subsequent arbitration pass where AUs having a reserved bandwidth request of the given priority compete for the bandwidth.

Abstract: A method for minimizing the access delay in wireless communication systems, e.g. GPRS (General Packet Radio Service) networks, which includes at least a base station system and at least a mobile terminal having a communication context with the GPRS network. The above mentioned mobile terminal is also adapted to open a communication context with the radio access network of said base station system to initiate a Temporary Block Flow or TBF establishment each time has to transmit data packets to the network and the TBF is released when the transmission of the packet has been completed. The TBF establishment is requested by means of a Radio Link Control message or RLC called Packet Channel Request or PCR sent on one of the Control Channel of the GPRS radio access and in particular on the Packet Random Access Channel or PRACH. The GPRS data packets and messages are organized in frame with a predetermined number of TDMA slots and in multiframe.

Abstract: A hierarchical scheduler architecture for use with an access node terminal disposed in an access network portion. Ingress flows aggregated via a plurality of aggregation layers are switched through an ATM fabric that segregates flow cells based on service priority categories (planes). Thus, a two-dimensional scheduler employs arbitration on a per-aggregation layer, per-service priority basis, wherein each layer is responsible for selecting the most eligible flow from the constituent flows of that layer, which is forwarded to the next layer for arbitration. A service-based arbiter selects overall winner cells for emission through the fabric from winner cells generated for each service plane.

Abstract: A method and apparatus for use with a computer system are disclosed. A packet is received that includes a header. The header indicates at least one characteristic that is associated with a layer of a protocol stack, and the layer is hierarchically no lower than a network layer. The packet is parsed in hardware to extract the characteristic(s), and the packet is processed based on the parsing. The computer system may be capable of executing software of a protocol stack to extract the characteristic(s) of the packet, and the apparatus may include an interface and a circuit. The interface may be adapted to receive the packet, and the circuit may be adapted to parse the header to extract the characteristic(s) without causing the computer to execute the software and process the packet based on the extracted characteristic(s).