Abstract: A buffer temporarily stores data received from a network by a receiving unit. An output mode switching unit switches the mode in which the data received by the receiving unit is output to the buffer, between FIFO and FILO, in accordance with the storage amount of data temporarily stored in the buffer. For example, if the data temporarily stored in the buffer falls below a given threshold value of the buffer, data is stored in the buffer in FIFO. If the data temporarily stored in the buffer exceeds a given threshold value of the buffer, data is stored in the buffer in FILO. A sending unit outputs data taken from the buffer in FIFO or FILO, to a network.

Abstract: A multi-function device capable of executing a plurality of functions, the device comprising: a first acquisition unit configured to acquire communication state information relating to a current communication state of the multi-function device; a determination unit configured to determine: a first priority order in a case of a first state indicating that the current communication state of the multi-function device is good; and a second priority order in a case of a second state indicating that the current communication state of the multi-function device is poor, wherein the second priority order is different from the first priority order, and wherein each of the priority orders indicate each of priorities of the plurality of functions; and a data transmission unit configured to execute preferentially a transmission of data for a high-priority function earlier than a transmission of data for a low-priority function, based on the determined priority order.

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: A Network Interface (NI) includes a host interface, which is configured to receive from a host processor of a node one or more cross-channel work requests that are derived from an operation to be executed by the node. The NI includes a plurality of work queues for carrying out transport channels to one or more peer nodes over a network. The NI further includes control circuitry, which is configured to accept the cross-channel work requests via the host interface, and to execute the cross-channel work requests using the work queues by controlling an advance of at least a given work queue according to an advancing condition, which depends on a completion status of one or more other work queues, so as to carry out the operation.

Abstract: A packet switching system includes a plurality of switch fabrics connected in cascade and a plurality of buffers respectively connected to the plurality of switch fabrics. In the event of packet competition, the plurality of switch fabrics buffer the competing packets to the corresponding buffers through buffer connection ports, and forward the competing packets in excess of the number of buffer connection ports to an adjacent switch fabric through switch connection ports.

Abstract: A fabric login (FLOGI) in a Fiber Channel (FC) adapter is throttled. The system includes a first tracking mechanism, a second tracking mechanism, a switch, and an FC adapter. The FC adapter comprises three or more FLOGIs and a controller. First and second FLOGI requests are transmitted to the switch and indicate, via a first tracking mechanism, that a first FLOGI associated with the first FLOGI request and a second FLOGI associated with the second FLOGI request are active. A third FLOGI request is queued until the first FLOGI request or the second FLOGI request is processed by the switch and indicates, via a second tracking mechanism, that a third FLOGI associated with a third FLOGI request is queued.

Abstract: A network device for processing data includes at least one ingress module for performing switching functions on incoming data, a memory management unit for storing the incoming data and at least one egress module for transmitting the incoming data to at least one egress port. The at least one egress module includes an egress scheduling module and multiple queues per each of the at least one egress port. Each of the multiple queues serve data attributable to a class of service, and the egress scheduling module is configured to service a minimum bandwidth requirement for each of the multiple queues and then to service the multiple queues to allow for transmission of a maximum allowable bandwidth through a weighting of each of the multiple queues.

Abstract: An apparatus that includes input ports, input buffers coupled with respective input ports, output ports, and routing control circuitry coupled with the input ports, the input buffers and/or the output ports. The plurality of input buffers and the plurality of output ports, the routing control circuitry to maintain a two-tier priority scheme having at least two queues for prioritizing requests stored in the plurality of input buffers.

Abstract: In one embodiment, a method for processing a series of MAC-hs protocol data units (PDUs) in an HSDPA-compatible (high-speed downlink packet access) receiver in a 3G wireless communication network, the method including: (a) receiving a MAC-hs PDU having: (i) a queue identification (QID), (ii) a transmission sequence number (TSN), and (iii) one or more MAC-d PDUs, (b) then disassembling the MAC-hs PDU (c) then distributing the one or more MAC-d PDU to a reordering queue indicated by the QID, and (d) then performing reordering processing for the corresponding reordering queue based on the TSN. Steps (a) and (b) are performed in a physical layer of the receiver. Steps (c) and (d) are performed in a data-link layer of the receiver.

Abstract: Transmitting from a mobile terminal to a telecommunication network data stored in a plurality of queues, each queue having a respective transmission priority, includes setting the data in each of the queues to be either primary data or secondary data, or a combination of primary data and secondary data. The data may be transmitted from the queues in an order in dependence upon the priority of the queue and whether the data in that queue are primary data or secondary data. Resources for data transmission may be allocated such that the primary data of each of the queues are transmitted at a minimum predetermined rate and such that the secondary data of each of the queues are transmitted at a maximum predetermined rate, greater than the minimum predetermined rate.

Abstract: In a passive optical network, dynamic bandwidth allocation and queue management methods and algorithms, designed to avoid fragmentation loss, guarantee that a length of a grant issued by an OLT will match precisely the count for bytes to be transmitted to an ONU. The methods include determining an ONU uplink transmission egress based on a three-stage test, and various embodiments of methods for ONU report 700 threshold setting.

Abstract: Methods for contention-based transmission with contention-free feedback for reduced latency in LTE Advanced networks and an enhanced PUCCH are generally disclosed herein. User equipment (UE) may transmit a contention sequence on a physical uplink control channel (PUCCH) to an enhanced-Node B (eNB) and may concurrently transmit data requesting uplink resources on a physical uplink shared channel (PUSCH) to the eNB. The contention sequence is transmitted on the PUCCH in accordance with a format that is assigned by the eNB. The contention sequence is either randomly selected by the UE or assigned by the eNB. When the contention sequence and data are not successfully received by the eNB, the UE may fall back to a more conventional random access channel (RACH) procedure for uplink resource allocation.

Abstract: One embodiment of the present invention provides a system that facilitates flow control of multi-path-switched data frames. During operation the system transmits from an ingress edge device data frames destined to an egress edge device across different switched paths based on queue status of a core switching device and queue status of the egress edge device. The egress edge device is separate from the core switching device.

Abstract: A self-adjusting load balancing among multiple fabric ports. A plurality of first values is received in response to receiving a first frame, wherein each of the first values is related to a quantity of data stored in a respective one of a plurality of buffers of fabric ports. First identifiers are also received, each of which corresponds to a respective one of a first subset of the plurality of buffers. A subset of the first identifiers is selected based on one or more of the first values. Thereafter one of the first identifiers contained in the selected subset is selected. Ultimately the first frame is transmitted to the buffer that corresponds to the selected one of the first identifiers.

Abstract: A fabric login (FLOGI) in a Fibre Channel (FC) adapter is throttled by a system. The system includes a first tracking mechanism, a second tracking mechanism, a switch, and an FC adapter. The FC adapter comprises three or more FLOGIs and a controller.

Abstract: A method of handling random access procedure for a network in a wireless communications system is disclosed. The method comprises configuring a plurality of access points or a plurality of component carriers with at least one of a plurality of physical random access channel (PRACH) resources, a plurality of preamble formats, and a plurality of preamble sequences, whereby a mobile device of the wireless communication system uses at least one of the plurality of PRACH resources, the plurality of preamble formats, and the plurality of preamble sequences to access at least one of the plurality of access points or the plurality of component carriers when performing at least a random access procedure.

Abstract: A communication session is established, via a wireless communication link, with a mobile communication device that is connected to a computer system. The mobile communication device is enumerated by the computer system as a locally attached mass storage device. An authentication executable file is sent to the mobile communication device. A response generated by the computer system executing the authentication executable file is received from the mobile communication device. Based on the response generated by the computer system executing the authentication executable file, access to a data file that is stored by a mass storage system via a network is granted.

Abstract: A system determines a scheduling value based on a current length of a downstream queue in a network device. The system sends the scheduling value from the downstream queue to an upstream queue and schedules dequeuing of one or more data units, destined for the downstream queue, from the upstream queue based on the scheduling value.

Abstract: Described embodiments provide for arbitrating between nodes of scheduling hierarchy of a network processor. A traffic manager generates a tree scheduling hierarchy having a root scheduler and N scheduler levels. The network processor generates tasks corresponding to received packets. The traffic manager queues the received task in an associated queue of the scheduling hierarchy. The root scheduler performs smooth deficit weighted round robin (SDWRR) arbitration between each child node of the root scheduler. The SDWRR arbitration includes checking one or more status indicators of each child node of the given scheduler and selecting, based on the status indicators, a first active child node of the scheduler and updating the one or more status indicators corresponding to the selected child node. Thus, a task is scheduled for transmission by the traffic manager every cycle of the network processor.

Abstract: A band control apparatus including: a buffer memory configured to hold and output data units on a first-in first-out basis; a counter memory configured to hold a counter value; and a processor configured to add a value to the counter value on a basis of a rule, reduce, when a first one of the data units is output from the buffer memory, cause, when a first condition of a total size of the data units being smaller than a buffer threshold is satisfied, the first data unit to be output when a second condition that the counter value is larger than the size of the first data unit is satisfied and the counter value is larger than a counter threshold, and cause, when the first condition is not satisfied, the data units to be output in sequence with the first data unit first, until a third condition is satisfied.

Abstract: A system and method for communicating over a single virtual channel. The method includes reserving a first group of credits of a credit pool for a first traffic class and a second group of credits of the credit pool for a second traffic class. In addition, a first and second respective groups of tags are reserved from a tag pool for the first and second traffic class. A packet may then be selected from a first buffer for transmission over the virtual channel. The packet may include a traffic indicator of the first traffic class operable to allow the packet to pass a packet of the second traffic class from a second buffer. The method further includes sending the packet over the virtual channel and adjusting the first group of credits and the first group of tags based on having sent a packet of the first traffic class.

Abstract: A method, computer readable medium, and apparatus for managing server resources includes receiving at a traffic management device one or more requests in a message based protocol. The traffic management device determines a difference between a level of utilization of resources maintained by a server that handles the one or more received requests and a threshold level of utilization of resources that can be maintained by the server; and randomly delays the one or more requests based upon the determined difference.

Abstract: In a data transmission device and method provided with duplexed switches outputting frames in the order of input for continuing the communication without instantaneous interruptions even though one of the switches is faulted, input interfaces generate frames in which every time data is inputted, input order information indicating the input order is added to the data together with unique information of each input interface and providing the frame generated to the switches in parallel. At least one output interface sequentially stores the frames outputted from the switches for every unique information and selects a first arrived frame among the frames stored with same input order information.

Abstract: Example embodiments of a system and method for providing a congestion measurement in a network are disclosed. In an example embodiment information is received at an information transfer rate, from a source network device. A sample of the information may be taken before the information is transmitted to a destination network device. In an example embodiment, a congestion measurement value is computed that corresponds to the sample and represented with at least two bits. A multi-bit indicator of the congestion measurement value is then transmitted to control the information transfer rate of information arriving in the future.

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: A device may reserve a slot for a received packet in a packet ordering queue (POQ), convey the packet to one of a plurality of threads for processing, obtain the packet from the one of the plurality of threads after the packet has been processed, organize the packet in the POQ in accordance with a position of the reserved slot, and release the packet from the POQ if the reserved slot is a head of the POQ.

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 digital broadcast transmitting/receiving system and a method for processing data are disclosed. The method for processing data may enhance the receiving performance of the receiving system by performing additional coding and multiplexing processes on the traffic information data and transmitting the processed data. Thus, robustness is provided to the traffic information data, thereby enabling the data to respond strongly against the channel environment which is always under constant and vast change.

Abstract: A method for processing a Buffer Status Report (BSR) is provided, which includes: acquiring service data with a higher priority than all service data waiting to be sent in a sending buffer; and prohibiting a sending process of the BSR from being triggered, if scheduling resources are available. An apparatus for processing a BSR is further provided.

Abstract: Methods and apparatus for data switching are disclosed. An example method includes receiving a data traffic flow at a data ingress module and buffering the data traffic flow in a virtual output queue included in the data ingress module, where the virtual output queue being associated with a data egress module. The example method also includes communicating the data traffic flow to the data egress module via a fabric egress queue included in a data-switch fabric. The example method further includes monitoring data occupancy in the fabric egress queue and determining, based on the data occupancy, that a change in congestion state in the fabric egress queue has occurred. The example method still further includes, in response to the change in congestion state, communicating a flow control message to the data ingress module and, in response to the flow control message, modifying communication of the data traffic flow.

Abstract: An internet router is implemented as a network fabric of fabric routers and links. The internet router receives data packets from trunk lines or other internet links and analyzes header information in the data packets to route the data packets to output internet links. The line interface also analyzes the header to define a fabric path through the router fabric. The internet packets are broken into flits which are transferred through the router according to a wormhole routing protocol. Flits are stored in fabric routers at storage locations assigned to virtual channels corresponding to destination internet links. The virtual channels and links within the fabric define virtual networks in which congestion in one virtual network is substantially nonblocking to data flow through other virtual networks. Arbitration is performed at each fabric router to assign packets to virtual channels and to assign virtual channels to output fabric links.

Abstract: Methods and terminals can use Internet Protocol (IP) packets for waveform independent contention access in a hub-spoke network. In some embodiments, a spoke terminal can transmit a link allocation packet on an uplink when the uplink is available and the spoke terminal has data to transmit. The link allocation packet can be embedded within an IP packet. When the spoke terminal receives the link allocation packet on the downlink, the spoke terminal can transmit one or more IP packets with data, followed by a link release packet. The link release packet can be embedded within an IP packet.

Abstract: A source-based memory usage table is accessed to identify a source having a memory usage satisfying a predetermined memory usage threshold, the source-based memory usage table including a plurality of source records, each corresponding to a source from which packets are received. A first flow control signal is transmitted to the identified source that has a memory usage satisfying the corresponding predetermined memory usage threshold to control further packet transmission from the identified source. A priority-based memory usage table is accessed to identify a priority of which a memory usage satisfies a predetermined memory usage threshold of the priority. A second flow control signal is transmitted to one or more sources associated with the identified priority having a memory usage satisfying the corresponding predetermined memory usage threshold to control further packet transmission from the identified one or more sources.

Abstract: A system and method for communicating the current congestion state of a destination virtual output queue to a plurality of source queues in order to allow the source queues to adjust their data rates in real time for each class of service is disclosed. The preferred embodiment method comprises tracking the amount of data for one or more classes of service entering and leaving at least one destination queue associated with an output port; determining the amount of available space in the destination queue; creating a message based at least in part on the determined amount of available space; and transmitting the created message to a plurality of source queues at least one of which is providing data to the destination queue.

Abstract: A synchronized communication system is provided in which even when communication devices are connected in series to a transmission path, devices connected to the communication devices are synchronized so that a communication cycle can be reduced. A second communication device includes a relay path and a return path which do not pass through a storage device, and a path selection switch therefor. A first communication device instructs switching of the return path from the transmission path, measures a transmission path delay time, notifies the second communication device of it, and sends a reference time of the first communication device for each communication cycle. The second communication device corrects its reference time using the transmission path delay time and the reference time. When a new second communication device is found during synchronized communication, the first communication device also performs transmission path delay measurement using the remaining time in the communication cycle.

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: Packets are processed in a system that comprises a plurality of interconnected processor cores. The system receives packets into one or more queues. The system associates at least some nodes in a hierarchy of nodes with at least one of the queues, and at least some of the nodes with a rate. The system maps a set of one or more nodes to a processor core based on a level in the hierarchy of the nodes in the set and based on at least one rate associated with a node not in the set. The packets are processed in one or more processor cores including the mapped processor core according to the hierarchy.

Abstract: Network data switching includes receiving a cell; associating the cell with a destination port; selecting, based at least in part on a mapping of a plurality of output ports and a plurality of egress links, a selected egress link that has been soft configured to be associated with the destination port, wherein each of the plurality of egress links is configured to send data from a switch fabric to a corresponding access node; and switching the cell to the selected egress link.

Abstract: A method and an apparatus for managing an audio contention are disclosed. For example, the method receives a request by a device, and enters into a first state by the device, wherein the first state allows the device to use an audio channel in an upstream direction, wherein the device in the first state determines at least one of: a failure outcome for the request, a success outcome for the request or a continue outcome for the request.

Abstract: A scaling device or striper improves the lane efficiency of switch fabric. The striper controls or adjusts transfer modes and payload sizes of a large variety of devices operating with different protocols. The striper interfaces between network devices and the switch fabric, and the resulting switching system is configurable by a single controller. A source device sends a data packet to its corresponding striper for transmission across the switch fabric to a destination device. The corresponding striper parses the packet to determine its type and payload length, and divides the packet into numerous smaller segments when the payload length exceeds a predetermined length. The segments may be stored in the striper to adapt to the available bandwidth of the switch. The segments are sent across the switch fabric and reassembled at a destination striper. The packet as reassembled is forwarded to the destination device.

Abstract: A method of transforming an ordered list of nodes of a network into one of a plurality of elite ordered lists, the ordered list corresponding to a deloading sequence, the deloading sequence including a temporary capacity requirement, each of the elite ordered lists corresponding to an elite deloading sequence including an elite temporary capacity requirement by generating at least one intermediate ordered list corresponding to an intermediate deloading sequence including an intermediate temporary capacity requirement, selecting one of the intermediate ordered list and the ordered list based on a comparison of the intermediate temporary capacity requirement and the temporary capacity requirement and replacing one of the elite ordered lists with the one of the intermediate ordered list and the ordered list if a value corresponding to one of the intermediate temporary capacity requirement and the temporary capacity requirement is less than a lowest value of the elite temporary capacity requirements.

Abstract: A system that indicates which frame should next be removed by a scheduler from flow queues within a network device, such as a router, network processor, and like devices is disclosed. The system includes a search engine that searches a set of calendars under the control of a Finite State Machine (FSM), a current pointer, and input signals from an array and a clock line providing current time. Also included is a decision block that determines which of the searches are critical and which, during peak calendar search periods, can be postponed with minimal impact to the system. The postponed searches are then conducted at a time when there is available calendar search capacity.

Abstract: There is disclosed a method, apparatus and computer program for communicating messages between a first messaging system and a second messaging system. The messaging system comprises a set of source queues with each source queue owning messages retrievable in priority order. It is determined that a message should be transferred from the first messaging system to the second messaging system. A source queue is selected which contains a message having at least an equal highest priority when compared with messages on the source queues. A message having the at least equal highest priority from the selected source queue of the first messaging system is then transferred to a target queue at the second messaging system.

Abstract: The decision within a packet processing device to transmit a newly arriving packet into a queue to await further processing or to discard the same packet is made by a flow control method and system. The flow control is updated with a constant period determined by storage and flow rate limits. The update includes comparing current queue occupancy to a threshold. The outcome of the update is adjustment up or down of the transmit probability value. The value is stored for the subsequent period of flow control and packets arriving during that period are subject to a transmit or discard decision that uses that value.

Abstract: A First In First Out (FIFO) communication buffer for receiving data from a source and distributing the data to a first sink and a second sink is disclosed. The FIFO communication buffer includes a FIFO memory and a FIFO control circuit. The FIFO memory includes a first data port, a second data port, and a third data port. The FIFO control circuit provides the first address, the second address and the third address. The FIFO control circuit increments the first address toward the second address and the third address when valid data is received, and increments the second address and the third address when data is read out.

Abstract: A system for evaluating performance of a network providing communication services by means of a generalized processor sharing packet scheduling discipline. The services may include classes of services having real time and non real time (i.e. “elastic”) requirements, respectively, and the classes of services have relative priorities. The system includes a performance evaluation module configured for evaluating performance of a given class of services as a function of the load produced by other classes of services having a priority higher than or equal to the given class as well as of perturbation effect exerted on the given class by other classes having priority higher than the given class, and a computation module configured for determining the load and the perturbation effect as weighed sums of the contributions of each of the other classes to the load and the perturbation effect.

Abstract: A mobile communication device has a wireless transceiver and one or more processors for communicating data in a wireless communication system. The one or more processors are operative to receive a plurality of data packets of varying payload size in a queue; associate one or more of the data packets from the queue into a group, such that a total size of the group is at or near a maximum transmissible unit (MTU) size of a data frame; cause the one or more data packets associated into the group to be formatted into the data frame for data transmission via the wireless transceiver; and repeat, for a plurality of data frames, the associating and formatting, for communicating the data via the wireless transceiver in the wireless communication system. By associating the data packets into groups having the MTU size, data throughput of the data transmission is increased.

Abstract: A packet forwarding technique is presented that forwards data packets through a multi-hop wireless network employing multi-radio nodes. In each multi-radio node, an output buffer is shared among the radios. Outgoing packets are stored in this buffer. Whenever there is a transmission opportunity on the radios sharing the output buffer, the node examines the buffer and searches for packets that are scheduled to be transmitted to a neighboring node having an open communication link with the transmitting node. The packet in the discovered group that has the highest transmission priority is then transmitted to its next scheduled node.

Abstract: An on-chip bus includes a plurality of switch points including first and second switch points, a plurality of inter-switch links including at least one inter-switch link coupled between the first switch point and the second switch point and configured to communicate data between the first switch point and the second switch point, and a plurality of functional block cores including first and second functional block cores coupled directly to the first switch point and configured to communicate data through the first switch point. Data transmitted from the first functional block core to the second functional block cores may pass through the first switch point without traversing any of the plurality of inter-switch links. Methods for communicating data on an on-chip bus are also disclosed.

Abstract: In a two way cable system that includes a controller and a plurality of user terminals, a method of granting rights for upstream data transmission from the user terminals includes processing contention requests to generate contention grants and maintaining a list of connections, each connection having specified therefor a predetermined bit rate. The controller sends a downstream data stream to the user terminals and receives an upstream data stream from the user terminals. The downstream data stream includes a plurality of grant fields, and the upstream data stream includes upstream data slots and upstream control slots.