Abstract: An apparatus and method for UpLink (UL) radio resource allocation in a wideband wireless communication system are provided. In a method of operating a Relay Station (RS) for UpLink (UL) radio resource allocation in a wideband wireless communication system, the method includes relaying to a Base Station (BS) a resource request message of at least one or more Mobile Stations (MSs); receiving data from the at least one or more mobile stations; if the received data is non-real time traffic, queuing the data received from the mobile stations according to a traffic type; and requesting the base station to allocate necessary radio resources by checking a queue status. Accordingly, a delay can be reduced when the UL resource is allocated to an relay station for real time traffic.

Abstract: A method and apparatus for reducing a transmission delay of a downlink frame in a wireless communication system are provided. A frame transmission method in an access point (AP) includes classifying each of a plurality of hosts as any one of a normal destination and a suspect destination according to whether a retransmission is exhausted, and managing at least one frame to be transmitted to each of the normal destination and the suspect destination in a first queue and a second queue, and assigning at least one frame transmission attempt to the first queue and the second queue according to a transmission priority.

Abstract: An apparatus includes a network receiver for receiving an over-the-air in-band on-channel broadcast signal and extracting broadcast content from the broadcast signal, and an output for delivering the content by way of a first receiver output signal to a plurality of network player devices. A method performed by the apparatus is also included.

Abstract: A system provides congestion control in a network device. The system includes multiple queues, a dequeue engine, a drop engine, and an arbiter. The queues temporarily store data. The dequeue engine selects a first one of the queues and dequeues data from the first queue. The drop engine selects a second one of the queues to examine and selectively drop data from the second queue. The arbiter controls selection of the queues by the dequeue engine and the drop engine.

Abstract: Method for transmitting a sequence of messages in a point-to-point interconnection network comprising message initiating agents, message destination agents and message transmission agents. During a transmission of an indivisible sequence of messages from an initiating agent to a destination agent, an output of a message transmission agent is locked onto an input of the transmission agent, the other inputs of the said transmission agent being able to transmit messages to the other outputs of the said transmission agent.

Abstract: A method and system schedule data for dequeuing in a communication network. The communication network includes an eligible scheduling node, a scheduling context structure, and an existence of data structure. In response to determining that an eligible scheduling node does not contain at least one child identifier in the scheduling context structure, an eligible child is selected for dequeue from the existence of data structure. At least one eligible child from the existence of data structure is absorbed into the scheduling context structure. The at least one eligible child includes the child selected for dequeue. Absorbing a child includes removing the child identifier from the existence of data queue and adding the child identifier to the scheduling context structure.

Abstract: A method and system are disclosed for modeling non-deterministic queues for efficient model checking. In this method and system, a multitude of messages are held in a plurality of queues, and these messages having n priorities. The method comprises the steps of providing (n+1) queues, including a first queue, and n priority queues; passing said messages from a source to the first queue; passing each of said messages from the first queue to one of said n priority queues based on the priority of the message; and passing each of said messages from the n priority queues to a destination based on the priority of the message. One or more non-deterministic waits are introduced into one or more of the passing steps to simplify passing the messages into or out of the n priority queues.

Abstract: Congestion control techniques based upon resource utilization information stored by a network device. According to an embodiment of the present invention, a network device is configured to identify a data source causing congestion based upon information stored by the network device identifying a set of data sources, and for each data source, information identifying the amount of a resource of the network device being used for processing data received by the network device from the data source.

Abstract: In a multi-QOS level queuing structure, packet payload pointers are stored in multiple queues and packet payloads in a common memory pool. Algorithms control the drop probability of packets entering the queuing structure. Instantaneous drop probabilities are obtained by comparing measured instantaneous queue size with calculated minimum and maximum queue sizes. Non-utilized common memory space is allocated simultaneously to all queues. Time averaged drop probabilities follow a traditional Weighted Random Early Discard mechanism. Algorithms are adapted to a multi-level QOS structure, floating point format, and hardware implementation. Packet flow from a router egress queuing structure into a single egress port tributary is controlled by an arbitration algorithm using a rate metering mechanism. The queuing structure is replicated for each egress tributary in the router system.

Abstract: A novel apparatus for and a method of optimized data transmission whereby an input data stream is distributed over a plurality of physical channels within a logical channel group. Transmission of data over the channel group appears as transmission over a single logical channel having a bandwidth approximately equal to the sum of the physical channel bandwidths. The physical channels making up the logical channel group may have different bandwidth capacities. The method of data unit distribution among a plurality of physical channels generates several transmission plans for scheduling data units, which may have difference lengths, over the physical channels where the data stream is composed of data units from different sessions. A best plan according to one or more optimization criteria is selected and used for distribution of the data units.

Abstract: A method to provide an operation to an information storage device is disclosed. The method supplies an information storage device and a protocol conversion device capable of receiving an operation in a first communication protocol comprising a variable attribute, and providing that operation to the information storage device in a second communication protocol, where that second communication protocol does not support the variable attribute. The method provides an operation to the protocol conversion device using said first communication protocol, and determines if the variable attribute is configured in that operation. If the method determines that the variable attribute is not configured in the operation, then the method provides the operation to the information storage device using the second communication protocol.

Abstract: A network endpoint system and related method and computer program product for use in a network to support enhanced end-to-end QoS in the network. The network endpoint system is adapted to receive network data of varying priority on behalf of a data consumer operating at the application layer of a network protocol stack implemented by the network endpoint system. The network endpoint system includes a network interface controller adapted to receive network frames containing the network data, plural network data handling channels each having an associated priority, and priority processing logic adapted to transfer the network data from the network interface controller to the plural data handling channels on a prioritized basis according to the network data priority. Also disclosed are a network interface controller and a network node to support enhanced end-to-end QoS in a network.

Abstract: The present invention provides an improved architecture and method for the processing and transmission of multicast packets within a switching device. Briefly, as multicast packets arrive, a copy of the packet, or preferably a pointer for it, is placed in a multicast FIFO. As each pointer reaches the head of the FIFO, the destination output ports via which the packet is to be transmitted are determined, based on the packet's multicast group identifier (MGID). In the preferred embodiment, there is a dedicated multicast output queue associated with each output port. Copies of the packet, or preferably pointers to the packet, are then stored in those output queues associated with the specified destination output ports. In this way, a congested output port only affects the transmission of multicast packets via that congested port.

Abstract: A messaging service is described that incorporates messages into cached link lists. The messages are not yet acknowledged as having been received by one or more consumers to whom the messages were sent. A separate link list exists for each of a plurality of different message priority levels. Messages within a same link list are ordered in their link list in the same order in which they where received by the messaging service. At least one of the link lists contains an element that represents one or more messages that are persisted but are not cached in any of the cached link lists.

Abstract: A multicast packet readout control method is disclosed. An input multicast packet is temporarily stored in a multicast queue of a packet buffer. The multicast packet is read from the multicast queue, and converted into a unicast packet addressed to each of the destinations of the multicast packet. The converted unicast packet is stored in a unicast queue of the packet buffer. The converted unicast packet is then read from the unicast queue and transmitted to the destination.

Abstract: Cells which arrive in random sequence from the asynchronously operating exchange parts are restored into the original by a small amount of hardware. Distributing parts as inputs of a switch fabric manage serial numbers continuous for each destination. The distributing part divides an inputted variable length packet into fixed length cells, adds serial numbers corresponding to destinations to the cells, and outputs the cells to the exchange parts. The respective exchange parts deliver the cells to the objected destinations. Alignment parts as outputs of the switch fabric classify the reception cells by the number of the distributing part, and compare an expected serial number managed by the alignment part with a serial number of the destination (alignment part) of the reception cell. An identical one is stored in an aligned FIFO queue, and cells of from a packet start cell to a packet end cell are taken out.

Abstract: A novel method for coordinating the delivery of frames to and the receipt of frames from a power-saving station in a wireless local-area network (LAN) is disclosed. The illustrative embodiment establishes a wake-up schedule for a power-saving station based on a temporal period and temporal offset that reduces the frequency with which multiple stations in a network wake up simultaneously, thereby reducing traffic delays and power consumption. The illustrative embodiment is particularly well-suited to networks with traffic that has delay/jitter quality-of-service (QoS) requirements (i.e., voice calls, videophone calls, etc.).

Abstract: Efficient interface scheduling that maintains fairness among the scheduled interfaces and remains efficient even when scheduling large numbers of interfaces and even when implemented in software. Systems for scheduling interfaces through a physical port are provided that utilize a bit-mask. Each bit-mask has a bit-mask-level-1 having a plurality of bits, each bit in the bit-mask-level-1 represents a unit of bandwidth with the total number of bits in the bit-mask-level-1 representing the port's line speed, each bit in a bit-mask-level-1 is associated with an interface, and the number of bits associated with each interface determines the bandwidth for that interface. Methods of scheduling interfaces are provided that utilize one or more bit-masks to determine an order in which interfaces are scheduled. The present invention can efficiently implement versions of the dual-token-bucket algorithm.

Abstract: Described is a system to control a flow of packets to and from an electronic processor which includes a packet processor engine programmed to interpret the packets from a packet memory, and to perform switching between packet chains in response to events, a working chain pointer register of the packet processor engine, programmed to indicate progress in executing an active buffer chain, prioritized pointer storage registers of the packet processor engine, each of the registers being programmed to point to one of the active buffer chains, a control register of the packet processor engine having chain start bits and chain protect bits, the chain start bits identifying the chains that have been started and wsa status register of the packet processor engine, having a chain actives group identifying the chain that is currently running, a chain matches group, a chain stops group identifying the chains that have been stopped and a timer expirations group.

Abstract: A FIFO communication system is provided using a FIFO and connection circuit to transmit data from a single source to multiple sinks. The connection circuit operates to enable simultaneous reads by the multiple sinks with a single output port FIFO. Multiple FIFOs can likewise be used to distribute data from a single source to multiple sinks without requiring a simultaneous read by both sinks. Similarly, a multiple output port FIFO can be used to supply multiple sinks without requiring simultaneous reads and without requiring additional memory use.

Abstract: A system and method for routing packets from one node to another node in a system having a plurality of nodes connected by a network. A node router is provided in each node, wherein the node router includes a plurality of network ports, including a first and a second network port, wherein each network port includes a communications channel for communicating with one of the other network nodes, a plurality of virtual channel input buffers and a plurality of virtual channel staging buffers, wherein each of the virtual channel staging buffers receives data from one of the plurality of input buffers.

Abstract: A system and method of switching data using a switch device that includes a plurality of input ports, a plurality of switch units, and a plurality of output ports. Each input port storing data to be sent may generate a request to output data to each of the output ports to which stored data is to be sent, wherein each request identifies a specific one of the plurality of switch units to be used to transfer the data from the corresponding input port to the corresponding output port. Grants may be generated per output port per switch unit. Grants may be accepted per input port per switch unit. Data may be outputted from the respective input ports to the respective output ports, based on the accepted grants, utilizing the switch units identified in the requests corresponding to the accepted grants.

Abstract: In a multi-QOS level queuing structure, packet payload pointers are stored in multiple queues and packet payloads in a common memory pool. Algorithms control the drop probability of packets entering the queuing structure. Instantaneous drop probabilities are obtained by comparing measured instantaneous queue size with calculated minimum and maximum queue sizes. Non-utilized common memory space is allocated simultaneously to all queues. Time averaged drop probabilities follow a traditional Weighted Random Early Discard mechanism. Algorithms are adapted to a multi-level QOS structure, floating point format, and hardware implementation. Packet flow from a router egress queuing structure into a single egress port tributary is controlled by an arbitration algorithm using a rate metering mechanism. The queuing structure is replicated for each egress tributary in the router system.

Abstract: A transceiver apparatus and a method comprise detecting means for detecting messages, wherein the detecting means comprises a first detector arranged to operate over a first detection period and which output indicates the beginning of a message with a first detection probability, and a second detector arranged to operate over a second detection period and which output indicates the detection of the beginning of a message with a second detection probability. The second detection probability is higher than the first detection probability and the transceiver apparatus is arranged to receive the message if the second detector indicates detection of the beginning of a message.

Abstract: For supporting a decoding of encoded frames, which belong to a sequence of frames received via a packet switched network, it is detected whether a particular encoded frame has been received after a scheduled decoding time for the particular encoded frame and before a scheduled decoding time for a next encoded frame. In case the particular encoded frame is detected to have been received after its scheduled decoding time and before the scheduled decoding time for the next encoded frame, the particular encoded frame is re-scheduled to be decoded at the scheduled decoding time for the next encoded frame.

Abstract: Connection ports for interconnecting functional modules in an integrated circuit are described. The connection ports provide enhanced functionality based around a common port primitive. This simplifies port design and selection and also allows a common packet protocol to be used for communication of packets across the packet router. In particular, there is improved functionality of target ports which allow out of order requests to be dealt with and out of order responses to be generated.

Abstract: A method and apparatus is disclosed for temporarily deferring transmission of frames to a destination in a data switch. When a request for transmission of a frame to the destination port is received, the congestion status of that destination is determined. If the destination is congested, the frame is stored in a deferred queue. When the status of a destination changes from congested to non-congested, the deferred queue is examined to see if any deferred frames can now be forwarded to their destination. While examining the deferred queue, incoming frames are placed on a backup queue. When the deferred queue is fully analyzed, the backup queue is emptied by either sending those frames to their destination or storing the frames in the deferred queue. While examining the deferred queue, the congested states of the destinations are not allowed to change from congested to non-congested.

Abstract: A first controller calculates a first read-out speed based on the traffic volume in a first buffer and information of a request for the first read-out speed, sets the speed in a first scheduler. The first controller also generates information of a request for a second read-out speed based on the traffic volume in the first buffer. A second controller calculates the second read-out speed based on the traffic volume in a second buffer and the information of the request for the second read-out speed, sets the speed in a second scheduler. The second controller also generates information of a request for the first read-out speed based on the traffic volume in the second buffer.

Abstract: Systems and methods for arbitrating for virtual channels to prevent livelock in richly-connected multiprocessor computer system. Livelock is prevented in a multiprocessor computer system, in which each of a large plurality processing node has input links and egress links. A virtual channel is assigned to convey the communication. Communication data from the plurality of input links is buffered in cross point buffers. A subset of the cross point buffers bids for, and arbitrates, use of the same one egress link. The virtual channel of the selected communication is identified. It is determined whether any of the other communications bidding for use of the egress link are associated with the identified virtual channel and if so whether any communication has been waiting longer than the selected communication. If so, allowing that communication to use the egress link before the selected communication does.

Abstract: Systems and methods for communicating on a richly-connected multiprocessor computer system using a pool of buffers for dynamic association with a virtual channel. Packets are communicated in a multiprocessor computer system having a large plurality of processing nodes interconnected by a defined interconnection topology, in which a communication from a source processing node to a target processing node may pass through one or more intermediate nodes en route to the target processing node. A set of virtual channels is associated for each link in the interconnection topology. A first subset of buffers is dedicated for fixed correspondence to virtual channel identifiers, and a second subset of buffers is dedicated for dynamic allocation and assignment to virtual channels.

Abstract: A switch at a transmission end of a system including a number of memory devices defining queues for receiving traffic to be switched, each queue having an associated predetermined priority classification, and a processor for controlling the transmission of traffic from the queues. The processor transmits traffic from the higher priority queues before traffic from lower priority queues. The processor monitors the queues to determine whether traffic has arrived at a queue having a higher priority classification than the queue from which traffic is currently being transmitted. The processor suspends the current transmission after transmission of the current minimum transmittable element if traffic has arrived at a higher priority queue, transmits traffic from the higher priority queue, and then resumes the suspended transmission. At a receiving end, a switch that includes a processor separates the interleaved traffic into output queues for reassembly of individual traffic streams from the data stream.

Abstract: In a RTP stream having a plurality of FEC frames containing source blocks of media packets, random access points are inserted in front of the source blocks so as to allow a media decoder to decode the media packets as soon as FEC decoding is finished. In particular, the media packets contain forward error correction (FEC) source blocks for a multimedia broadcast/multicast-based streaming service content. As the multimedia broadcast/multicast streaming service includes dynamic interactive multimedia scene content where the source RTP packets of different media along with the FEC RTP packets are transmitted as separate RTP streams, the inclusion of the random access point facilitates immediate rendering of the dynamic interactive multimedia scene content after FEC decoding, thus reducing the tune-in latency.

Abstract: A system and method of scheduling packets or cells for a switch device that includes a plurality of input ports each having at least one input queue, a plurality of switch units, and a plurality of output ports. There is generated, by each input port having a packet or cell in its at least one queue, a request to output the corresponding packet or cell to each of the output ports to which a corresponding packet or cell is to be sent to, wherein the request includes a specific one of the plurality of switch units to be used in a transfer of the packet or cell from the corresponding input port to the corresponding output port. Access is granted, per output port per switch unit, to the request made on a first priority scheme. Grants are accepted per input port per switch unit, the accepting being based on a second priority scheme.

Abstract: The present invention is a technique to select an input port. A database stores records of input ports for a plurality of communication channels. Each of the records includes a timestamp and a ready status. The timestamp indicates a most recent service time. A selector selects one of the input ports based on the timestamp and the ready status. A listener updates the records.

Abstract: One embodiment relates to a method of processing packets by a network stack. A first data packet is received from a client via a network, and a network buffer is allocated for the data packet. An indication is given that the data packet is ready for reading by an application. In addition, the network buffer is cached in a network buffer cache. Subsequently, response data may be received from the application, and the network buffer may be re-used from the network buffer cache. The response data may be sent in a second data packet to the client via the network. Finally, the network buffer may be freed. Other embodiments, aspects, and features are also disclosed.

Abstract: A method of transferring data over a plurality of optical channels. Bus access is requested. A bus grant is issued and received by the bus requester. The bus requester places data and a clock on an optical bus with the data synchronized to the clock.

Abstract: A method for selecting a queue for service across a shared link. The method includes classifying each queue from a group of queues within a plurality of ingresses into one tier of a number “N” of tiers. The number “N” is greater than or equal to 2. Information about allocated bandwidth is used to classify at least some of the queues into the tiers. Each tier is assigned a different priority. The method also includes matching queues to available egresses by matching queues classified within tiers with higher priorities before matching queues classified within tiers with lower priorities.

Abstract: A matrixed memory array device is disclosed that includes input ports and output ports. Each input port is coupled to a first data bus and each output port is coupled to a second data bus that is different and separate from the first data bus. A memory brick is placed at each cross-point between first data buses and second data buses so as to switchably couple frames of data from input ports to output ports. Each memory brick contains a plurality of eight transistor (8-T) memory cells that can be used to store, erase, read, write, and switchably couple a data bit from the input port to a corresponding output port.

Abstract: Methods of routing and switching a packet from an incoming link to an outgoing link of a router. In one example, the method includes assigning a destination queue to the packet, determining if the router is implemented in a scaled-down configuration, remapping the destination queue to one or more remapped destination queues, and storing the packet in the one or more remapped destination queues. In one embodiment, the method may also include requesting a packet from the destination queue, translating the request to the remapped destination queue, and transmitting the packet from the remapped destination queue.

Abstract: This disclosure relates to methods and systems for queuing traffic in packet-switched networks. In one of many possible embodiments, a queue management system includes a plurality of queues and a priority module configured to assign incoming packets to the queues based on priorities associated with the incoming packets. The priority module is further configured to drop at least one of the packets already contained in the queues. The priority module is configured to operate across multiple queues when determining which of the packets contained in the queues to drop. Some embodiments provide for hybrid queue management that considers both classes and priorities of packets.

Abstract: Methods and apparatus are provided for determining traffic characteristics and statistics for storage area network flows. An intelligent line card associated with a fibre channel switch is used to snoop selected flows in a storage area network. Flows are characterized using information that may include initiator target pairs and initiator target logical unit number (LUN) groupings. Selected flows are configured for monitoring and information about the selected flows is maintained. Selected flow information can be analyzed at a line card associated with a fibre channel switch.

Abstract: Disclosed is a scheduling method. The scheduling method includes assigning a priority associated with a transmitted order with respect to object packets based on a delayed time remaining until the object packets are reproduced, recognizing a significance of the object packets, the significance being associated with an effect on a decoding process, and scheduling the object packets based on whether the priority is assigned to the object packets and the recognized significance. The scheduling method may perform scheduling based on the delayed time and significance, thereby effectively providing multimedia services and a data communication server.

Abstract: To selectively route stand-by packets in input modules to destination output modules via a switching matrix, distributed arbitration functions are executable by successive arbitration cycles. Each cycle comprises: a first phase executable by each input controller to send each output controller requests representative of the quantities of required stand-by packets; a second phase executable by each output controller to determine the quantity of admissible packets depending on the requests; a third phase executable by a central arbitration unit to determine allowed aggregate quantities depending on all the admissible quantities; and a fourth phase executable by each input controller to determine the allowed packet quantities depending on the admissible quantities and of the allowed aggregate quantities.

Abstract: An Infiniband switch can have an input port and a plurality of output ports. The switch can be configured to interrogate at least a header portion of a received packet to determine an output port for the packet and to forward the packet to an output buffer associated with the determined output port. The switch can also be configured to determine an output buffer ratio in dependence upon at least an inbound data rate characteristic of the input port and an outbound data rate characteristic of the determined output port. The output port can be configured to commence onward transmission of the packet once a proportion of the packet conforming to the output buffer ratio has been written into the output buffer.

Abstract: Embodiments of the invention provide systems, devices and methods to schedule data transport across a fabric, e.g., prior to actual transmission of the data across the fabric. In some demonstrative embodiments, a packet switch may include an input controller to schedule transport of at least one data packet to an output controller over a fabric based on permission information received from the output controller. Other embodiments are described and claimed.

Abstract: Methods and apparatus are disclosed using a random indication to map items to paths and to recirculate or delay the sending of a particular item when a destination over its mapped path is unreachable, including, but not limited to the context of sending of packets across multiple paths in a packet switching system. In one implementation, a set of items is buffered, with the set of items including a first and second sets of items. The items in the first set of items are forwarded over a set of paths in a first configuration. The set of paths is reconfigured into a second configuration, and the items in the second set of items are forwarded over the set of paths in the second configuration. In one implementation, a recirculation buffer is used to hold items not immediately sent. In one implementation, the paths are reconfigured in a random fashion.

Abstract: Prior to alteration of the communication route connecting the enterprise servers 51 to 53, ports a, b and c of the enterprise server 51 are each connected with port 1 of the storage system 7 through the communication route. When enterprise server 54 is connected with the storage system 7 in response to a new connection request, the communication port of the storage system 7 with which ports a, b and c are respectively connected through the communication route is altered to port 3. Due to this alteration, the enterprise server 544 can be connected through its port f via the communication route with the port 1 of the storage system 7, which was thus freed.

Abstract: Acknowledgement packets and data packets of multiple streams are reordered for transmission in order to gain good overall utilization of both uploading and downloading links. Durations of various packets in a transmit queue may evaluated to determine whether a later packet in the transmit queue can be transmitted ahead of an earlier packet in the transmit queue. A relative acknowledgement priority parameter for a node effectively tunes the amount of transmit bandwidth available to increase acknowledgment transmissions and therefore increase the node's receive rate from another node.

Abstract: In accordance with at least one embodiment of the present invention, a method and apparatus for scheduling traffic in a communications node is provided. Line cards request communication opportunities from a switch fabric. The switch fabric issues grants for such communication opportunities in response to specific requests. By dynamically adjusting usage of such communication opportunities corresponding to such grants among requests of differing priorities and/or latency criteria, embodiments of the present invention are able to provide increased capacity utilization of switching fabric bandwidth while maximizing adherence to priority requirements and/or latency criteria.

Abstract: Techniques for accelerating network receive side processing of packets. Packets may be associated into flow groupings and stored in flow buffers. Packet headers that are available for TCP/IP processing may be provided for processing. If a payload associated with a header is not available for processing then a descriptor associated with the header is tagged as indicating the payload is not available for processing.