Abstract: A packet switching equipment and a switch control system employing the same performs operation of the switch core portion independent of content of decision of an arbiter portion and overall equipment can be constructed with simple control structure. The packet switching equipment includes input buffer portions temporarily storing packets arriving to the input ports and outputting packets with adding labels indicative of destination port numbers, a switch core portion for switching the packets on the basis of labels added to the input buffer portions, and an arbiter portion adjusting input buffer portions to provide output permissions for outputting to the output ports. A sorting network autonomously sorting and concentrating the packets on the basis of the labels added to the packets is employed in the switch core portion.

Abstract: The present invention relates to systems and methods of accelerating network traffic. The method includes receiving a plurality of network packets and setting a threshold for a buffer. The threshold indicates a low water mark for the buffer. The method further includes storing the plurality of network packets in the buffer at least until the buffer's capacity is full, removing packets from the buffer, and transmitting the removed packets via a downstream link to an associated destination. Furthermore, the method includes that in response to removing packets from the buffer such that the buffer's capacity falls below the threshold, receiving additional packets and storing the additional packets at least until the buffer's capacity is full.

Abstract: A packet classifier and a method for routing a data packet are provided. The packet classifier includes a content addressable memory, a translation table and a parameter memory. The method includes looking up a content addressable memory for a base address into a parameter memory using a header of the data packet. The base address is related to the routes under ECMP for forwarding the data packet. From among these addresses, using multiple headers of the data packet, an adjustment to the base address is computed. The adjustment specifies an actual address to the parameter memory corresponding to a selected route for forwarding the data packet. The parameter memory is then accessed using the actual address to obtain parameter values relevant to the selected route. The data packet is then forwarded according to the parameter values thus obtained.

Abstract: A system receives a set of datagrams and forms frames based on the datagrams, where at least one of the frames includes data associated with multiple ones of the datagrams. The system writes the frames to memory to form superframes in the memory, where each of the superframes includes multiple ones of frames. The system reads the superframes from the memory, recreates the datagrams based on the superframes, and outputs the datagrams.

Abstract: An apparatus and a method for constraining the delivery rate of a plurality of bitstreams, such as MPEG bitstreams using a single software process.

Abstract: A network device switches variable length data units from a source to a destination in a network. An input port receives the variable length data unit and a divider divides the variable length data unit into uniform length data units for temporary storage in the network device. A distributed memory includes a plurality of physically separated memory banks addressable using a single virtual address space and an input switch streams the uniform length data units across the memory banks based on the virtual address space. The network device further includes an output switch for extracting the uniform length data units from the distributed memory by using addresses of the uniform length data units within the virtual address space. The output switch reassembles the uniform length data units to reconstruct the variable length data unit. An output port receives the variable length data unit and transfers the variable length data unit to the destination.

Abstract: Methods and apparatus for a play-out buffer that may adjust offsets between clocks of two ends of a network link with an adaptive play-out buffer and adaptive clock control. The play-out buffer is a circular jitter buffer that permits the absorption of a frequency offset using controlled slips between two nodes of a network. The play-out buffer also accommodates some wander introduced by the time-delay variation across the network. The adaptive clock control reduces the frequency offset between the clocks of the two nodes. In this manner, even though some offsets between two nodes would render communication inefficient, embodiments of the present invention allow the effects of these offsets to be mitigated, thus providing for a better quality coupling.

Abstract: A methods, apparatus and computer memory are provided for packet scheduling. A processor polls queues in a round robin fashion and schedules for transmission onto a link a packet in each queue with no deficit before scheduling for transmission onto the link a packet in each queue with a deficit. A credit is allocated to each queue with the deficit based on a proportional weight, until each queue with the deficit has a credit.

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: A system for managing packets incoming to a data router has a local packet memory (LPM) mapped into pre-configured memory units, to store packets for processing, an external packet memory (EPM), a first storage system to store packets in the LPM, and a second storage system to store packets in the EPM. The system is characterized in that the first storage system attempts to store all incoming packets in the LPM, and for those packets that are not compatible with the LPM, relinquishes control to the second system, which stores the LPM-incompatible packets in the EPM.

Abstract: A system manages a buffer having a group of entries. The system receives information relating to a read request for a memory. The system determines whether an entry in the buffer contains valid information. If the entry is determined to contain valid information, the system transmits the information in the entry in an error message. The system may then store the received information in the entry. In another implementation, the system stores data in one of the entries of the buffer, removes an address corresponding to the one entry from an address list, and starts a timer associated with the one entry. The system also determines whether the timer has exceeded a predetermined value, transferring the data from the one entry when the timer has exceeded the predetermined value, and adds the address back to the address list.

Abstract: A method, system, and apparatus are directed towards selectively concatenating data into a packet to modify a number of packets transmitted over a network based on a combination of network and/or send-queue metrics. In one embodiment, Nagle's algorithm is used for concatenating data into a packet. The concatenation may be selectively enabled based on heuristics applied to the combination of metrics. In one embodiment, the result may indicate that there should be a concatenation, or that data should be sent immediately, or that a current state for whether to concatenate or not should be maintained. The heuristics may include an expert system, decision tree, truth table, function, or the like. The heuristics may be provided by a user, or another computing device. In another embodiment, the concatenation may be enabled based on a conditional probability determined from the combination of metrics.

Abstract: A computer-implemented method, system and computer program product for arbitrarily aligning vector operands, which are transmitted in inter-thread communication buffer packets within a highly threaded Network On a Chip (NOC) processor, are presented. A set of multiplexers in a node in the NOC realigns and extracts data word aggregations from an incoming compressed inter-thread communication buffer packet. The extracted data word aggregations are used as operands by an execution unit within the node.

Abstract: A system is provided for managing timely delivery of electronic messages, such as short message service (SMS) messages sent by the short message peer to peer (SMPP) protocol. In particular, the system determines an expected delay for the delivery of electronic messages, so that a sender can avoid sending messages when they will take an excessive amount of time to deliver. In one embodiment, a sender of electronic messages, such as a news service provider, sends a session initiation protocol (SIP) “subscribe” message to a delay manager. The delay manager determines when the expected delay of message delivery at a bulk message gateway falls below a threshold delay. When the expected delay falls below the threshold, the delay manager informs the sender, and the sender may create and send an electronic message.

Abstract: A method of, and system for, asynchronous data transmission are disclosed which have application in the transmission of stock exchange data or replicated memory data. Later transmitted data is used to overwrite earlier transmitted and received data. However, earlier transmitted data which is received later than later transmitted data (for example due to network latency) does not overwrite the later transmitted data. Transmitted data packets include a count value indicative of the sequence position of each data packet in a transmitted sequence of data packets. A transmitter and receiver for asynchronous data transmission and reception, and a packet signal structure are also disclosed.

Abstract: A method and apparatus for out-of-order processing of packets are described. In one embodiment, the method includes receiving packets in a global order, the packets being designated for different ones of a plurality of reorder contexts. The method also includes, for each of the plurality of reorder contexts, assigning reorder context sequence numbers indicating an order relative to the global order of the packets designated for that reorder context. The method also includes storing packet descriptors for each of the packets in a shared reorder buffer, and completing processing of at least certain of the packets out of the global order. The method also includes, for each of the plurality of reorder contexts, maintaining a first indication of the one of the sequence numbers assigned the one of the packets that is next to be retired for that reorder context.

Abstract: A system and method for preferred service flow of high priority messages between electronic devices is provided. The preferred service flow system includes preferred service flow queues, standard service flow queues, request/grant state machines and a controller. The method includes determining whether the standard processing rate of messages is acceptable, creating a preferred service flow queue and processing a high priority message through the preferred service flow queue. A preferred service flow queue will be created and the message processed using that queue when the standard processing rate is unacceptable and resources are available for the preferred service flow queue. If the standard processing rate is acceptable or resources are unavailable, a preferred service flow queue will not be created and the high priority message will be processed using the standard procedure for processing a message.

Abstract: Discloses a switching arrangement for packets of data, with several input ports and several output ports and which is determined for the transportation of incoming packets to one or more designated of the output ports and from there to a subsequent device. More particularly it relates to a switching arrangement and method wherein for each input port a set of output buffers is arranged, each set comprising an output buffer for each output port.

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

Abstract: An egress traffic management system for a data communication system is disclosed. The egress traffic management system makes use of a hierarchical queue ID header paradigm that enables data packets to be directed for egress traffic management to either one of a plurality of assignable queues in a main egress queue module or to one of a plurality of distributed queue modules via a common queue of the main egress queue module. This behavior enables egress traffic management functionality and scale to be varied independently and in a cost-effective manner to meet evolving requirements of a data communications system.

Abstract: According to an embodiment, a method includes a Delay Tolerant Network (DTN) software overlay residing in a first plane of a node of the network is used to define hierarchical forwarding behavior for data being generated in the first plane. In a second plane of the network, local buffering and data retransmission is performed in response to at least one intermittent network outage. Communication between the first and second planes is performed to manage the transmission of data between the first and second planes as needed in the event of at network outage that is longer in duration than the at least one intermittent network outage, to thus prevent the loss of data.

Abstract: A network switch includes an input layer to receive a data stream with a set of cells. Each cell includes data and a header to designate a destination device. The input layer includes a set of input layer circuits. A selected input layer circuit of the set of input layer circuits receives the data stream. The selected input layer circuit includes a set of queues corresponding to a set of destination devices. The selected input layer circuit is configured to assign a selected cell from the data stream to a selected queue of the set of queues. The selected queue corresponds to a selected destination device specified by the header of the selected cell. An intermediate layer includes a set of intermediate layer circuits, each intermediate layer circuit has a set of buffers corresponding to the set of destination devices.

Abstract: In one embodiment, the present invention includes a method for receiving a first packet associated with a first network flow in a first descriptor queue associated with a first hardware thread, receiving a marker in the first descriptor queue to indicate migration of the first network flow from the first hardware thread to a second hardware thread, and processing a second packet of the first network flow following the first packet in order in the second hardware thread.

Abstract: Methods and systems are provided for intelligently managing on-demand content in a cable services system. High demand video programs (e.g., movies, documentaries, mini-series, educational films, and the like) are stored at cable system hubs that service a number of individual cable customers. When a given video program is requested, the requested title is steamed from the hub servicing the requesting customer rather than streaming the requested program from the cable system head end. The video programs cached at the cable system hubs are determined based on attributes associated with individual video programs including time since initial release, association with other programs, association with hub locations, association with current events, and the like.

Abstract: The present invention relates to a buffered crossbar switch which provides a step of changing the size and/or number of queuing buffer entries to ensure optimum buffer memory usage independent of the size of data packets processed.

Abstract: A switch including: (i) a processor, adapted to dequeue a multicasting descriptor from a multicasting link-list in response to: (a) a requested number of duplications; (b) a duplications counter; and (c) a rejected duplications counter; and (ii) a memory unit, connected to the processor, adapted to maintain the multicasting link-list.

Abstract: A network interface circuit or card has a memory and a medium control module for transmitting data stored in the memory to a network. The method includes: when a packet data is transmitted (such as completely transmitted) from the memory to the medium control module, making the memory send an interrupt request such that a new packet data can be read into the memory. This results in increased data transmission efficiency in the network interface circuit.

Abstract: A first interface for receiving downlink data packets from a core network, a second interface for transmitting data packets to user entities, a processor comprising a scheduler, a first memory partition comprising and parameter data pertaining to a first subset of allocated priority queues, a second memory partition comprising parameter data pertaining to a second subset of allocated priority queues, is provided. The processor is transferring parameter data between the first and second memory partitions, and vice versa, whereby parameter data for priority queues having no data packets in corresponding buffers is prioritized for being transferred to the first memory partition, parameter data for priority queues having data packets in corresponding buffers is prioritized for being transferred to the second memory partition, the processor performing scheduling based on a selection of priority queues whose parameter data is residing in the second memory partition.

Abstract: A data queue controlling apparatus including a plurality of input interfaces and a method of controlling the data queue controlling apparatus is provided. The apparatus performs effective data queue controlling without use of a single common data queue and solves the problems in LSI yield, operation frequency and power consumption by providing a plurality of data queues which are less than the number of input interfaces and also providing a means for equally sharing the packet data inputted from each input interface to each data queue.

Abstract: A transmit packet generated by a CPU 1 is held in a buffer 100a (100b). From among packets received from Ethernet 820a (820b), a packet, a destination of which is a communication device 800, is held in the buffer 100a (100b). A packet which should be transmitted is transmitted from a transfer judging circuit 200 to Ethernet 820a or 820b through a MAC unit 300a or 300b. If a transfer judging circuit 200 judges a packet from the Ethernet 820a to be a packet, a destination of which is another communication device, with reference to a destination MAC address, this packet is transferred to the Ethernet 820b through MAC 300b. If a usage rate of a transferring FIFO buffer 130a (130b) exceeds a threshold value in the process of transmitting a packet held in a transmitting FIFO buffer 120a (130b) on a priority basis, the priority order of a transfer packet is made higher than that of a transmit packet so that the transfer packet is transferred to the Ethernet 820a or 820b in preference to the transmit packet.

Abstract: In a multinode data processing system in which nodes exchange information over a network or through a switch, a structure and mechanism is provided within the realm of Remote Direct Memory Access (RDMA) operations in which DMA operations are present on one side of the transfer but not the other. On the side in which the transfer is not carried out in DMA fashion, transfer processing is carried out under program control; this is in contrast to the transfer on the DMA side which is characteristically carried out in hardware. Usage of these combination processes is useful in programming situations where RDMA is carried out to or from contiguous locations in memory on one side and where memory locations on the other side is noncontiguous. This split mode of transfer is provided both for read and for write operations.

Abstract: These and other aspects of the present invention will be better described with reference to the Detailed Description and the accompanying figures. A method and apparatus for out-of-order processing of packets using linked lists is described. In one embodiment, the method includes receiving packets in a global order, the packets being designated for different ones of a plurality of reorder contexts. The method also includes storing information regarding each of the packets in a shared reorder buffer. The method also includes for each of the plurality of reorder contexts, maintaining a reorder context linked list that records the order in which those of the packets that were designated for that reorder context and that are currently stored in the shared reorder buffer were received relative to the global order.

Abstract: A method for allocating space among a plurality of queues in a buffer includes sorting all the queues of the buffer according to size, thereby to establish a sorted order of the queues. At least one group of the queues is selected, consisting of a given number of the queues in accordance with the sorted order. A portion of the space in the buffer is allocated to the group, responsive to the number of the queues in the group. A data packet is accepted into one of the queues in the group responsive to whether the data packet will cause the space occupied in the buffer by the queues in the group to exceed the allocated portion of the space.

Abstract: An embodiment is a technique to perform packet scheduling for QoS. A plurality of buffers is visited in a variable round robin manner. The buffers store packets having packet types associated with priority levels and having buffer types according to the packet types. The packets are generated for transmission from an application according to a network protocol in a multi-hop mesh network having a local node and a remote node. The buffers are dequeued according to the buffer types and using an amount dynamically weighted by the priority levels associated with the buffer types.

Abstract: A method of re-ordering packets receives packets having packet sequence numbers. The method then determines if a packet is an out of window packet and buffers out-of-window packets having a sequence number more than a first number. The method delivers a packet when the packet sequence number matches a first number. It delivers all buffered packets when a timeout occurs. A communication system having at least one network device that performs this method is also disclosed.

Abstract: A packet communication apparatus includes a frame buffer of a linked list method and holds chain information and buffer size information, for structuring a linked list buffer for each user flow, in two areas consisting of an operation area and an update area. While usually in service, the buffer is structured by using the chain information in the operation area and the buffer size information in the same area such that the frame is read/written in the frame buffer. When the chain information in the update area and the buffer size information in the same area have been changed, a queue size is changed by reflecting the updated chain information and the updater buffer size information into the operation area, when both the read pointer and the write pointer respectively have gone around the buffer, or when there is no frame stored in the buffer.

Abstract: A high speed multi-lane serial interface and method for constructing frames for such an interface are provided. Frames are constructed for transmission on a multi-lane serial interface. For each of a plurality of transmit channels, packets are fragmented into fragments. Meta-frames are generated having a size defined by a constant meta-frame length×number of lanes, each frame having a meta-frame separator and a payload. Per-transmit channel flow control information is received. Each payload has a plurality of bursts, each burst comprising a burst control word and an associated data burst, the burst control word identifying one of said transmit channels to be transmitted on the associated data burst, each data burst comprising one of the fragments for the transmit channel identified in the associated burst control word. The channels to transmit in a given meta-frame are selected as a function of the received flow control information.

Abstract: An information processing apparatus that processes a multiplexed stream including a frame having multiple slots, which is obtained by multiplexing multiple streams containing time information describing times is disclosed. The apparatus includes extracting means for extracting predetermined one or more slots from the frame of the multiplexed stream, storage means for storing data of the slot(s), and frequency dividing means for generating a second clock signal by frequency-dividing a first clock signal by a frequency division ratio N:M based on the number of clocks N corresponding to the time for one frame in the multiplexed stream and the number of clocks M for reading the data of the slot(s) extracted from the one frame from the storage means in the time for the one frame. The data of the slot or slots stored in the storage means is read in synchronization with the second clock signal.

Abstract: A router, comprising: a core controller; a plurality of egress edge units coupled to said core controller, said plurality of egress edge units including at least one egress port; and a plurality of ingress edge units coupled to said core controller and in communication with said plurality of egress edge units, wherein each ingress edge unit comprises: a plurality of ingress ports; an ingress interface associated with each ingress port, each ingress interface operable to segregate incoming optical data into a plurality of subflows, wherein each subflow contains data intended for a particular destination port; and a TWDM multiplexer operable to: receive subflows; generate a micro lambda from each subflow; time multiplex each micro lambda according to a schedule pattern; wavelength multiplex each micro lambda; and transmit each micro lambda to a switch fabric according to the schedule pattern.

Abstract: The invention discloses a new protocol to minimize data loss, reduce overhead transmissions on the system, reduce time delays and signal interruption during a handover in a Mobile IP system. Prior art Mobile IP systems transfer policy and charging rules for a particular mobile user device from a server to a gateway after the handover occurs. The invention allows for the transfer of the policy and charging rules during the handover procedure so that the system does not need to wait on a subsequent transmission of the policy and charging rules in order to process the transmissions sent by or to the mobile user, which results in minimized data loss, reduced overhead, and reduced time delays and signal interruption.

Abstract: A system and method for complex determination of a user's busy state and for assigning a do not disturb (DND) filter. A first electronic device is configured to house a DND recognizer module. The first electronic device is further configured to store and execute a plurality of applications. A second electronic device operably associated with the first electronic device. The second electronic device having another DND recognizer module, a DND filter module, and a DND propagator module. The DND filter module is configured to determine whether a particular DND filter is associated with the current busy state of the user and to adjust the DND status provided a DND filter does exist. The DND propagator configured to propagate the DND status to all at least one device operably associated with the system provided a DND status exists for the current busy state of the user.

Abstract: A scheduler is adapted to schedule packets or other data blocks for transmission from a plurality of transmission elements in timeslots in a communication system. The scheduler determines scaled capacity measures for respective ones of the transmission elements, with each of the scaled capacity measures being scaled by a combination of a waiting time and an occupancy for a corresponding one of the transmission elements. The scheduler selects one or more of the transmission elements for scheduling in a given one of the timeslots based on the scaled capacity measures. The scheduler in an illustrative embodiment may be implemented in a network processor integrated circuit or other processing device of the communication system.

Abstract: If an input word bit includes overhead data, the input word bit is ignored. If the input word bit includes non-overhead data and the corresponding bit position in a first buffer is empty, the non-overhead data is stored in the corresponding bit position in the first buffer, and the corresponding bit position in the first buffer is marked as full. Otherwise, the non-overhead data is stored in the corresponding bit position in a second buffer, and the corresponding bit position in the second buffer is marked as full. When all bit positions in the first buffer are marked as full, the data is shifted out of the first buffer, rotated to be in data arrival sequence, and made available for further processing. Then, the data in the second buffer is transferred to the first buffer, and the bit positions in second buffer are reset to be marked as empty.

Abstract: A method and apparatus for distribution of electronic media replace the display of printed employee communications with a method and apparatus for distribution of electronic media. In a typical embodiment of the invention, electronic media replaces the posters and printed materials and the conventional bulletin board is replaced by an electronic display. Maintaining the employee communications in electronic form from creation to display significantly reduces and cost while dramatically improving the flexibility of an employee communications program.

Abstract: A method of content-related processing of a data flow compares the data flow with a list of known data flows, and determines whether the data flow is recognized as a known data flow. When the data flow is recognized as a known data flow, the data flow is processed as specified in the list. When the data flow is not recognized as a known data flow, successively analyzing the data flow until a content type of the data flow is sufficiently recognized in order to decide how to process the data flow.

Abstract: Methods and systems are provided for intelligently managing on-demand content in a cable services system. High demand video programs (e.g., movies, documentaries, mini-series, educational films, and the like) are stored at cable system hubs that service a number of individual cable customers. When a given video program is requested, the requested title is steamed from the hub servicing the requesting customer rather than streaming the requested program from the cable system head end. The video programs cached at the cable system hubs are determined based on attributes associated with individual video programs including time since initial release, association with other programs, association with hub locations, association with current events, and the like.

Abstract: Certain embodiments of the present invention provide systems and methods for enqueuing transport protocol commands with data in a low-bandwidth network environment. The method may include receiving data for transmission via a network connection, enqueuing the data, enqueuing a transport protocol command related to the network connection, transmitting the data via the network connection, and transmitting the transport protocol command after transmission of the data. In certain embodiments, the data and the transport protocol command are enqueued based at least in part on manipulating a transport protocol layer of a communication network, such as a tactical data network. In certain embodiments, the data is prioritized based on at least one rule, such as a content-based rule and/or a protocol-based rule. In certain embodiments, the transport protocol command includes a close connection command, for example.

Abstract: A packet switching equipment and a switch control system employing the same performs operation of the switch core portion independent of content of decision of an arbiter portion and overall equipment can be constructed with simple control structure. The packet switching equipment includes input buffer portions temporarily storing packets arriving to the input ports and outputting packets with adding labels indicative of destination port numbers, a switch core portion for switching the packets on the basis of labels added to the input buffer portions, and an arbiter portion adjusting input buffer portions to provide output permissions for outputting to the output ports. A sorting network autonomously sorting and concentrating the packets on the basis of the labels added to the packets is employed in the switch core portion.

Abstract: In a wireless network, access points communicate with each other by transmitting and receiving data in first units and with client devices by transmitting and receiving data in second units over wireless links. A first unit encapsulates one or more second units addressed to client devices served by the same access point. Multiple second units encapsulated in a single first unit are transmitted with a single first-unit header. This scheme enables more payload data to be delivered with less overhead than would be required if every second unit were to be encapsulated in a separate first unit.

Abstract: A switch in a data communications network for performing traffic generation in addition to standard switching and routing operations is disclosed. The switch uses a fixed number of test packets retained in a conventional switch buffer to produce one or more infinite packet streams transmitted to a router under test (RUT). The switching device enqueues packets in the priority queues, dequeues the packets from the priority queues, transmits the dequeued packets to the RUT, and re-enqueues a copy of the dequeued packets into the priority queues from which they were dequeued. The enqueued packets and associated pointers to packets are organized into linked lists. By re-writing a copy of each dequeued packet to the tail of a linked list and updating the pointers, the switch produces repeatable streams of test packets. The priority buffers, without the re-write operation, may also be used for conventional egress traffic.