Abstract: A task obtained by a communications processor is decomposed into one or more requests that form a request group. The requests of the request group are sent to main memory and responses to those requests are expected. There may be requests for a plurality of request groups being processed concurrently. However, responses to the request groups are to be returned to the communications processor in the order in which the request groups were sent from the communications processor. To ensure this ordering, dependencies between the request groups are tracked by hardware coupled to the communications processor.

Abstract: A network can include a number of nodes that link a source node to a sink node. When a first node in a network sends a packet to its downstream node, this information is also received at its upstream node. In response to learning that the first node has sent a packet, the upstream node sends another packet to the first node. In essence, a pull-based transmission approach is used to mitigate congestion and address the funneling effect in data transmission networks such as wireless video sensor networks.

Abstract: In one embodiment, an apparatus comprises serializer/deserializer (SERDES) circuits. Each SERDES circuit is configured to transmit data on a respective lane to which the SERDES circuit is are coupled during use. The apparatus further comprises a transmit pipe coupled to the SERDES circuits. The transmit pipe comprises stages, and each stage is configured to process a maximum bandwidth unit (a maximum width of a port that is configurable on the lanes and smaller than a largest packet transmitted on the ports). In another embodiment, the apparatus comprises a transmit command queue; a transmit scheduler coupled to the transmit command queue; and a storage device coupled to the transmit scheduler that stores a scheduling calendar. The transmit scheduler is configured to schedule maximum bandwidth units for transmission on ports configured over the lanes on which packets are transmitted. The maximum bandwidth unit is smaller than a packet and is a maximum width of a port that is configurable on the lanes.

Abstract: According to an example embodiment, a total offered traffic load for a shared resource within a network switching system may be determined, the total offered traffic load may include, for example, a sum of offered traffic loads from one or more active virtual output queues (VOQs) of the network switching system. A capacity of the shared resource within the network switching system may be determined. A transmission rate from one or more of the active VOQs over the shared resource may be adjusted such that the total traffic load from the active VOQs does not exceed the capacity of the shared resource.

Abstract: Provided is a method and system for splitting a video stream into X minute video segments and further dividing those video segments into M multiplex files. Each multiplex file can have a Time to Live (TTL). This allows for part of the video to be deleted from disk by just removing a single multiplex file. The remaining multiplex files can be combined to play back the video at a reduced sample rate.

Abstract: Managing packet data network jitter is disclosed. A first call data associated with a mobile network communication session is received. A second call data that is older than the first call data is dropped from a buffer if required to make room in the buffer for the first call data.

Abstract: In a receiver apparatus of HSDPA (High Speed Downlink Packet Access) data transmission scheme, it is achieved to minimize the occurrence of the system performance degradation and problems caused by TSN flash execution. In the receiver apparatus, each of a plurality of reordering buffers that temporarily store received traffic data is ranked on the basis of QoS information of the traffic data. When it is determined that memory release of the reordering buffers is necessary, the memory release is performed from the lowest ranked reordering buffer.

Abstract: A switching node is disclosed for the routing of packetized data employing a multi-stage packet based routing fabric combined with a plurality of memory switches employing memory queues. The switching node allowing reduced throughput delays, dynamic provisioning of bandwidth and packet prioritization.

Abstract: A retransmission apparatus retransmits TS (Transport Stream) packets based on a received broadcast wave to a plurality of receiving apparatuses through a network. The retransmission apparatus has a TS packet determination unit for making a determination as to whether a number of received TS packets which include therein cyclic continuity counter values consecutive to each other is equal to or larger than a first predetermined threshold value N, and further configured to retransmit the received TS packets to the plurality of receiving apparatuses when the determination is true, and to drop the received TS packets when the determination is false.

Abstract: A packet forwarding apparatus identifies the class of the received packet, determines whether there is a capacity for storing the received packet, spending a dedicated free capacity corresponding to the identified class, stores the packet in the buffer, spending the corresponding dedicated free capacity if there is the capacity for storing the packet, determines whether the packet may be stored spending a jointly owned free capacity if the packet may not be stored spending the dedicated free capacity, stores the packet in the buffer, spending the corresponding jointly owned free capacity if there is the capacity for storing the packet, discards the packet if the packet may not be stored spending the jointly owned free capacity, and selects a predetermined class according to a priority control and reads out the packet from the buffer for transmission.

Abstract: In one aspect of the present invention, a network gateway is configured to facilitate on line and off line bi-directional communication between a number of near end data and telephony devices with far end data termination devices via a hybrid fiber coaxial network and a cable modem termination system. The described network gateway combines a QAM receiver, a transmitter, a DOCSIS MAC, a CPU, a voice and audio processor, an Ethernet MAC, and a USB controller to provide high performance and robust operation.

Abstract: A pipeline scheduler provides a minimum bandwidth guarantee by transporting cells from an input port to an output port in a two-phased approach. Cells that conform to a minimum cell rate (MCR) are selected from queues at the input port and arranged into supercells for transport to the output port, followed by nonconforming cells, to guarantee fairness by using scheduling modules to build the supercells first for conforming cells, and then for nonconforming cells. Reservation vectors are used to permit the same time slot of the next frame to be reserved by a first queue, and the same time slot of the following time frame to be held for reservation by a second queue, to ensure equal time slot access by the first and second queues over successive time frames.

Abstract: Systems and methods are disclosed for utilizing large packet sizes to reduce unpredictable network delay variations in delivering timing packets across networks for use with respect to network timing protocols. By increasing the size of the timing packets, the disclosed embodiments reduce or eliminate the blocking effect caused by size differences between timing packets and relatively large packets carried through a packet network. By reducing or eliminating this blocking effect, the disclosed embodiments provide significant advantages in reducing the complexity of implementing robust timing protocols for handling unpredictable delays in the communication of timing packets. The size of timing packets can be increased, for example, by adding fill data to timing data to form large timing packets. A variety of large packet sizes can be used for the timing packets, and timing packets can preferably be made to be equal to the maximum transmission unit (MTU) for the network.

Abstract: Simulating a large number of users is described. A method may include receiving a test script including a plurality of commands and invoking a script interpreter. An application thread may be launched to execute the test script. A protocol engine may be invoked for each of the commands in the test script such that each protocol engine has an associated command. Each protocol engine may execute its associated command. A system on which the method may be executed may include one or more chassis or computing devices having one or more network cards. The chassis and/or computing devices may be connected to one or more networks.

Abstract: A node in a mobile ad-hoc network or other network classifies packets (a) in accordance with a first set of priority levels based on urgency and (b) within each priority level of the first set, in accordance with a second set of priority levels based on importance. The node: (a) queues packets classified at highest priority levels of the first and/or second sets in high-priority output queues; (b) queues packets classified at medium priority levels of the first set in medium-priority output queue(s); and (3) queues packets classified at low priority levels of the first and/or second set in low-priority output queue(s). Using an output priority scheduler, the node serves the packets in order of the priorities of the output queues. In such manner, orthogonal aspects of DiffServ and MLPP can be resolved in a MANET or other network.

Abstract: The invention relates to a scheduler for a TCP/IP based data communication system and a method for the scheduler. The communication system comprises a TCP/IP transmitter and a receiving unit (UE). The scheduler is associated with a Node comprising a rate measuring device for measuring a TCP/IP data rate from the TCP/IP transmitter and a queue buffer device for buffering data segments from the TCP/IP transmitter. The scheduler is arranged to receive information from the rate measuring device regarding the TCP/IP data rate and is arranged to adapt the permitted queue latency to a minimum value when the TCP/IP transmitter is in a slow start mode and to increase the permitted queue latency when the TCP/IP rate has reached a threshold value.

Abstract: One or more flow control modules, implemented on various types of network topologies, provide a number of functionalities for controlling the flow of IP packets (such as TCP/IP packets) over a network connection. The flow control modules may be implemented within a sender and/or receiver or may be deployed into a network as a separate device without requiring significant additional resources.

Abstract: In one embodiment, a method is provided. The method of this embodiment provides storing a packet header at a set of at least one page of memory allocated to storing packet headers, and storing the packet header and a packet payload at a location not in the set of at least one page of memory allocated to storing packet headers.

Abstract: A control unit assigns a plurality of data signals in a manner that, of the plurality of data signals, data signals of higher data rate are assigned anteriorly. Of terminal apparatuses to which the plurality of data signals are to be transmitted respectively, the control unit specifies a terminal apparatus to which a training signal is to be transmitted. If the data signal to be sent to the specified terminal apparatus is contained in an anterior part of the packet signal, the control unit will append a training signal to a front part preceding a leading data signal. If the data signal to be sent to the specified terminal apparatus is not contained in an anterior part of the packet signal, the control unit will move this data signal to a posterior part of the packet signal and then append a training signal to a front part preceding this moved data signal.

Abstract: Techniques and systems for managing transmissions from a TCP source by regulating the flow of acknowledgement signals to the TCP source are described. An acknowledgement signal regulator monitors a data queue used to buffer data packets received from the TCP source and an acknowledgement signal queue used to store acknowledgement signals to be transmitted to the TCP source. An acknowledgement signal release manager determines the available space in the data queue and the expected number of data packets arriving at the data queue, and manages the release of acknowledgement signals from the acknowledgement signal queue to the TCP source so as to prevent an undesired overflow of the data queue resulting from the arrival of an excessive number of data packets from the TCP source.

Abstract: A system including: (a) a processor, adapted to generate first type descriptors, second type descriptors and second type descriptor pointers; wherein the first type descriptors and the second type descriptors describe data entities received by the system, and wherein a size of a second type descriptor pointer equals a size of a first type descriptor; and (b) a memory unit, connected to the processor, adapted to maintain a queue that stores at least one first type descriptor and at least one second type descriptor pointer.

Abstract: Methods and apparatus to implement scalable routing in network communication systems are disclosed. A disclosed example method involves selecting a plurality of virtual private networks in a communication network and selecting a candidate hub router from a plurality of routers in the communication network. The example method also involves determining a plurality of least memory utilization costs associated with assigning different quantities of spoke routers to the candidate hub router. Each of the least memory utilization costs and corresponding quantity of spoke routers is associated with a corresponding one of the plurality of virtual private networks. For each of the least memory utilization costs, a bandwidth usage of a corresponding one of the quantities of spoke routers is identified.

Abstract: Methods and systems are provided for aging EV-DO pages in a queue based on latency-sensitivity. An access node receives data for access terminals, and responsively generates pages and adds them to the back of a queue. The access node associates a respective aging value with any latency-tolerant pages. The access node transmits the pages in the queue, which involves: (a) assessing the pages on a first-in, first-out basis; (b) transmitting latency-sensitive pages when those pages reach the front of the queue; (c) sending latency-tolerant pages to the back of the queue (and incrementing their aging values) when those pages reach the front of the queue with an aging value that is less than a maximum-delay parameter; and (d) transmitting latency-tolerant pages when those pages reach the front of the queue with an aging value that is greater than or equal to the maximum-delay parameter.

Abstract: A serial buffer monitors an incoming stream of packets to identify single missing packets and multiple consecutive missing packets. Upon detecting multiple consecutive missing packets, an interrupt is generated, thereby stopping the data transfer. Upon detecting a single missing packet, a single missing packet identifier is inserted into the packet header of the packet that resulted in identification of the single missing packet. The incoming packets, including any inserted single missing packet identifiers, are written to a queue. When the water level reaches the water mark of the queue, the stored packets are read to create an outgoing packet stream. When a packet read from the queue includes an inserted single missing packet identifier, a dummy packet (e.g., a packet having a data payload of all zeros) is inserted into the outgoing packet stream. As a result, real-time applications are capable of processing the outgoing packet stream in a constant fashion.

Abstract: In an embodiment, an apparatus is provided that may include circuitry to generate, at least in part, and/or receive, at least in part, at least one request that at least one network node generate, at least in part, information. The information may be to permit selection, at least in part, of (1) at least one power consumption state of the at least one network node, and (2) at least one time period. The at least one time period may be to elapse, after receipt by at least one other network node of at least one packet, prior to requesting at least one change in the at least one power consumption state. The at least one packet may be to be transmitted to the at least one network node. Of course, many alternatives, modifications, and variations are possible without departing from this embodiment.

Abstract: A method and apparatus control effects of packet transmission delay on recorded audio information by determining if received audio information is to be used for a real time conversation or to be recorded; using a first size of jitter buffer upon the determined use being for the real time conversation; and using a second size of jitter buffer upon the determined use being to record the audio information whereby the second size of jitter buffer is larger than the first size of jitter buffer.

Abstract: Methods and systems for a personal video recorder (PVR) software buffer management to support the software passage are disclosed. A first plurality of receive buffer descriptors may be allocated for recording at least one received packet in at least a portion of a shared memory. The received packet may be recorded in the shared memory utilizing at least one of the allocated first plurality of receive buffer descriptors. A plurality of playback buffer descriptors may be allocated for playback of the recorded received packet from the shared memory. A first portion of the received packet may be simultaneously played back from the shared memory while recording a second portion of the received packet in the shared memory. If at least one of the recorded received packet is consumed, the playback buffer descriptors corresponding to a number of the consumed received packet may be de-allocated.

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: A packet processing apparatus includes a packet buffer with a queue for storing packets. An actual queue length/position discriminator acquires, at every sampling period, the latest actual queue length indicating the occupancy status of the queue, determines the positional relationship of the actual queue length to a random early detection interval, and outputs the positional relationship as position information. A discard probability computation processor calculates, at every sampling period, a packet discard probability based on the position information. A packet discard processor discards, at every sampling period and in accordance with the discard probability, packets that are not yet stored in the queue. If it is judged from the position information that the actual queue length is within the random early detection interval, the discard probability computation processor calculates an average queue length, and then calculates the discard probability from the ratio of a discard target to a reception target.

Abstract: An embodiment is a technique to perform QoS. An interface between an upper layer and a lower layer in a multi-hop mesh network receives and transmits packets from and to a local node and a remote node. A classifier classifies the received packets into a plurality of packet types having different priority levels. A queue manager manages a plurality of buffers organized according to the packet types. The plurality of buffers stores the classified packets based on the packet types. A scheduler schedules distributing the packets from the plurality of buffers based on the priority levels according to a scheduling policy.

Abstract: Computer-readable media, systems, and methods for dynamic overflow pool allocation are described. In embodiments, a new session registration request is monitored for and, upon receiving the new session registration request, it is determined whether an existing pool associated with a home agent has crossed below a minimal threshold. In various embodiments, if it is determined that the existing pool has crossed below a minimal threshold, an overflow is obtained. In various other embodiments, it is determined whether an existing home agent pool has crossed a maximum threshold and, if so, it is determined whether at least one session remains using the overflow pool. In various other embodiments, if no sessions remain using the overflow pool, the overflow pool is returned.

Abstract: An apparatus includes an input part, a plurality of output parts, and a switching part. The input part inputs a packet and builds at least one forwarding data block including a predetermined destination identifier and packet data extracted from the inputted packet. The switching part includes a forwarding destination storing section for storing, in association with a predetermined destination identifier, a forwarding destination identifier identifying one of the plurality of output parts, and receives the at least one forwarding data block from the input part, and forwards it to one of the plurality of output parts on the basis of forwarding destination storing section which is updated in response to a change in the operating state of the plurality of output parts.

Abstract: A linking list transmit queue system includes a queue, packet buffer and buffer tag with one-to-one mapping between them. The packet buffer stores packet data, the buffer tag stores packet data length and the queue stores a linking list of addresses corresponding to the packet data in the order in which the packet data was received from a transmitting network node. The system transmits the stored packet data in the order it was received from the transmitting network node to a destination network node.

Abstract: A network processor of an embodiment includes a packet classification engine, a processing pipeline, and a controller. The packet classification engine allows for classifying each of a plurality of packets according to packet type. The processing pipeline has a plurality of stages for processing each of the plurality of packets in a pipelined manner, where each stage includes one or more processors. The controller allows for providing the plurality of packets to the processing pipeline in an order that is based at least partially on: (i) packet types of the plurality of packets as classified by the packet classification engine and (ii) estimates of processing times for processing packets of the packet types at each stage of the plurality of stages of the processing pipeline. A method in a network processor allows for prefetching instructions into a cache for processing a packet based on a packet type of the packet.

Abstract: Class-based bandwidth partitioning of a sequence of packets of varying packet classes is performed, such as, but not limited to determining whether or not to admit a packet to a queue based on a probability corresponding to a class of packets associated with the packet, with this probability being based on measured arrival traffic and a fair share based on the length of the queue. Data path processing is performed on each packet to determine whether to admit or drop the packet, and to record the measured received traffic. Control path processing is periodically performed to update these probabilities based on determined arrival rates and fair shares for each class of packets. In this manner, a relatively small amount of processing and resources are required to partition bandwidth for a scalable number of classes of packets.

Abstract: It is determined whether a mobile user device is within transmission range of one or hidden networks. A list of known networks may be accessed, the list including broadcast and hidden networks. For the hidden networks, the network connection component may instruct a network interface to actively probe for the hidden networks. If the response is received for a communication corresponding to a particular network, then it may be considered that the mobile user interface is within transmission range of the hidden network. If auto-connection logic is activated, a preference order may be applied to select which of the detected broadcasts and/or hidden networks to connect. A user interface displays broadcast and hidden networks determined to be within transmission range of the mobile user device. The user device also displays hidden networks for which it has not yet been attempted to determine whether the hidden networks are in range.

Abstract: A method for calculating message queue times. The method includes queuing a message into a buffer at a first time, generating a time stamp message representative of a number of messages in the buffer at the first time, transmitting the message to another device, transmitting the time stamp message to a trace device, and calculating the message queue time based upon the time stamp message, the first time, and an amount of data in the buffer.

Abstract: A method to be used with first and second devices where the first device communicates with the second device via numbered data packets where the second device needs to know the number of each received packet upon reception, the method comprising the acts of at the first device, forming a plurality of separate initial data packets, for each initial data packet, associating a unique number with the initial data packet, combining the initial data packet with its associated unique number to form a numbered packet, calculating a checksum for the numbered packet, combining the checksum with the initial data packet to form a transmission packet that fails to include the associated unique number and transmitting the transmission packet to the second device.

Abstract: Smart routing packet handling across multiple networks achieves end-to-end (ETE) quality of service (QOS) when complementing or replacing conventional priority-based scheduling algorithms. Packets are “tagged” with a time code that indicates a time is allotted for the packet to transmit from a source to a destination and/or a measure of transmission time. Buffers at routers and/or switches utilize this information to order a transmission queue. In this way, queues may be intelligently scheduled to achieve a maximum ETE QOS.

Abstract: Techniques are provided for assisting in the processing of failure detection protocol (FDP) packets. Techniques are provided that assist a CPU of a network device in processing incoming FDP packets. In one embodiment, only a subset of FDP packets received by the network device is forwarded to the CPU for processing, the other FDP packets are dropped and not forwarded to the CPU. The processing is performed using dual memory structures that enable receipt of FDP packets by the network device to be decoupled from the processing of FDP packets by the CPU of the network device.

Abstract: In many aspects, the invention relates to systems and methods for synchronizing a communication network, particularly a slotted communication network, having a plurality of nodes. In slotted communication networks, the nodes are configured to transmit or receive data during selected time slots. During a selected time slot, each node transmits a synchronization message that is received by a neighboring node. The neighboring node adjusts its time slot boundary to coincide with the time of receipt of the synchronization message, thereby synchronizing each node with a neighboring node. Such systems and methods are energy efficient, accurate, fast, fault tolerant and easy to implement.

Abstract: In method of providing assured message delivery across a distributed message delivery system with low delivery latency and network traffic, a set of destinations is first identified for a set of destinations for a message received at an ingress router to the network. The received message is stored in persistent storage along with meta-data about each destination for the message before the message is routed to each identified destination. The message is only removed from persistent storage when an acknowledgement has been received from each destination indicating that the message has been successfully received.

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: 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 method and system for rerouting data over a local area network is provided. The method comprises defining at least one port group associated with a bridging device, each port group including interfaces linked to the bridging device. A plurality of statuses for each port group is defined, the status being dependent on the individual statuses of the interfaces linked to the bridging device. At least one target port associated with each port group, each target port relating to a path for data. The method further comprises defining an action for each status of a port group and monitoring the status of the interfaces forming part of each port group. In response to determining the status of a port group, triggering the predefined action associated with the port group status at one of the port group's target ports.

Abstract: Methods and systems are provided for prioritized EV-DO paging based on type of packet flow. In an embodiment, an access node provides service to a plurality of access terminals in a wireless coverage area. The access node receives data addressed to a particular access terminal, where the data is associated with a packet flow such as a VoIP call. The access node determines that the access terminal does not have a traffic channel, and responsively generates a page for transmission to the access terminal, where the page is associated with the packet flow. The access node determines whether the packet flow is latency-sensitive or rather is latency-tolerant. If the packet flow is latency-sensitive, the access node responsively prioritizes the page over one or more pages respectively associated with one or more latency-tolerant packet flows, where the prioritizing is with respect to order of transmission in the wireless coverage area.

Abstract: The present invention generally provides a packet buffer random access memory (PBRAM) device including a memory array, a plurality of input ports, and a plurality of serial registers associated with the input ports. The plurality of input ports permit multiple devices to concurrently access the memory in a non-blocking manner. The serial registers enable receiving data from the input ports and concurrently packet data to the memory array. The memory performs all management of network data queues so that all port requests can be satisfied within the real-time constraints of network packet switching.

Abstract: In one embodiment, an apparatus includes a shared memory buffer including a lead memory bank and a write multiplexing module configured to send a leading segment from a set of segments to the lead memory bank. The set of segments includes bit values from a set of variable-sized cells. The write multiplexing module further configured to send each segment from the set of segments identified as a trailing segment to a portion of the shared memory mutually exclusive from the lead memory bank.

Abstract: A Pipelined-based Maximal-sized Matching (PMM) scheduling approach for input-buffered switches relaxes the timing constraint for arbitration with a maximal matching scheme. In the PMM approach, arbitration may operate in a pipelined manner. Each subscheduler is allowed to take more than one time slot for its matching. Every time slot, one of them provides the matching result. The subscheduler can adopt a pre-existing efficient maximal matching algorithm such as iSLIP and DRRM. PMM maximizes the efficiency of the adopted arbitration scheme by allowing sufficient time for a number of iterations. PMM preserves 100% throughput under uniform traffic and fairness for best-effort traffic.

Abstract: A pipeline-based matching scheduling approach for input-buffered switches relaxes the timing constraint for arbitration with matching schemes, such as CRRD and CMSD. In the new approach, arbitration may operate in a pipelined manner. Each sub-scheduler is allowed to take more than one time slot for its matching. Every time slot, one of them provides a matching result(s). The sub-scheduler can use a matching scheme such as CRRD and CMSD.