Abstract: Systems and methods for connecting devices via a virtual global network are disclosed. In one embodiment the network system may comprise an endpoint device including a tunnel manager and a first virtual interface, an access point server including at least one tunnel listener and a second virtual interface. One or more tunnels are formed connecting the tunnel managers and tunnel listeners. The virtual interfaces provide a logical point of access to the one or more tunnels.

Abstract: Apparatuses, methods, and systems for connecting a wireless hub across multiple wireless networks are disclosed. One system includes a state machine and a router. The state machine operates to maintain a network availability of each of a plurality of wireless networks for a hub, wherein each of the plurality of wireless networks include network characteristics, wherein the network characteristics include at least IP and non-IP protocols, satellite and non-satellite communication channels, and a connection status. The router operative to select a one of the plurality of wireless networks based on the network availability and the network characteristics as maintained by the state machine, process data packets according to the selected available wireless network based on the network characteristics of the selected available wireless network, and route the processed data packets to the hub through the selected one of the plurality of wireless networks.

Abstract: A high speed intelligent network recorder for recording a plurality of flows of network data packets into and out of a computer network over a relevant data time window is disclosed. The high speed intelligent network recorder includes a printed circuit board; a high speed network switching device mounted to the printed circuit board; and an X column by Y row array of a plurality of intelligent hard drives with micro-computers mounted to the printed circuit board and coupled in parallel with the high speed network switching device.

Abstract: A multi-layered parallel aggregation can be performed on large-scale metric streams using layers of independent host server computers that perform partial aggregations on results of a previous layer and pass a result of the partial aggregation to a next layer of host server computers, until a single host server computer in a last layer can calculate a final output, which is a combination of the partial aggregations. Because every layer is aggregating input streams, the quantity of data exchange lowers as the layer number increases. The number of layers is chosen so as to ensure that data ingested by a last layer is sufficiently manageable that a single host server computer in the last layer can aggregate all of the partial aggregates into a final result.

Abstract: Provided herein is a method for a router to process time-sensitive packets, the method comprising: receiving a time-sensitive packet comprising a stack containing at least one local deadline, the stack being comprised within a header of the time-sensitive packet; retrieving a local deadline from the at least one local deadline comprised within the header; and scheduling transmission of the time-sensitive packet based on the local deadline. Also provided is a method for a router to process time-sensitive packets, the method comprising: receiving a time-sensitive packet comprising a stack containing at least one entry, each entry of the at least one entry respectively comprising, as sub-entries, a forwarding instruction and a local deadline; retrieving an entry from the stack; forwarding the time-sensitive packet according to the forwarding instruction comprised in the retrieved entry; and scheduling transmission of the time-sensitive packet based on the local deadline comprised in the retrieved entry.

Abstract: A memory controller that controls a nonvolatile memory in response to commands from a host, includes a normal transfer queue and a priority transfer queue, a transfer packet priority determination unit, a transfer queue selector, and a transfer packet selector. The transfer packet priority determination unit determines whether a transfer packet is a priority packet based on transmission information of the transfer packet. The transfer queue selector selects the priority transfer queue and stores the transfer packet in the priority transfer queue when the transfer packet is determined as the priority packet, and selects the normal transfer queue and stores the transfer packet in the normal transfer queue when the transfer packet is not determined as the priority packet. The transfer packet selector transfers to a host a priority packet stored in the priority transfer queue preferentially with respect to a normal packet stored in the normal transfer queue.

Abstract: The present invention discloses a data output dispatching device and method capable of reducing the probability of packets from the same queue being transmitted sequentially. An embodiment of the method comprises the following steps: providing a plurality of buffers capable of storing the data of Q queues respectively while each queue is associated with a weighting and the sum Ws of all the weightings is between 2(M?1) and 2M and not greater than a maximum sum in which Q is an integer greater than 1, M is a positive integer and N is an integer not less than M; providing a binary bit reverse count value not greater than 2N; and assigning a token to one of the Q queues for data output according to the reverse count value.

Abstract: In one embodiment, primary circuits may be established on a network link, where each primary circuit individually allocates primary bandwidth of the network link and is assigned to one of either a respective primary weighted queue of the network link corresponding to a size of the respective primary circuit or a shared primary weighted queue of the network link corresponding to a total size of the individually allocated primary bandwidth for the network link. In addition, protection circuits may also be established on the network link, where the protection circuits collectively allocate shared backup bandwidth of the network link and are assigned to a shared backup weighted queue of the network link corresponding to a size of the shared backup bandwidth for the network link. As such, primary and backup packets may be forwarded on the network link according to the primary and backup weighted queues (e.g., allowing 1:1 protection).

Abstract: In one embodiment, method of photonic packet switching includes receiving, by a photonic switching fabric from a first top-of-rack (TOR) switch, a destination port request corresponding to a first photonic packet and a first period of time, where the destination port request includes a first output port and determining whether the first output port is available during the first period of time. The method also includes receiving, by the photonic switching fabric from the first TOR switch, the first photonic packet and routing the first photonic packet to the first output port when the first output port is available during the first period of time. Additionally, the method includes routing the first photonic packet to an alternative output port when the first output port is not available.

Abstract: Various embodiments of the present disclosure provide techniques and mechanisms for providing a fast multi-level scheduler, implemented using a plurality of smaller schedulers, the plurality of smaller schedulers together performing the functions of a single conventional scheduler.

Abstract: In a method for making an on-chip interconnect for conveying between a set of initiators and a set of targets in which traffic is organized in classes of service, priority values representing the classes of service are associated with the traffic. The method further includes propagating the priority values towards the points of the network where an arbitration is performed between two classes of service of the traffic, and providing arbitration as a function of the priority values.

Abstract: A video input section acquires a video signal formed of a plurality of frames. A frame separator separates the video signal acquired by the video input section on a frame basis and distributes the separated video signals. A plurality of parallel processors perform video processing in parallel on the separated video signals corresponding to the frames separated and distributed by the frame separator. A frame combiner combines the separated video signals on which the plurality of parallel processors have performed the video processing.

Abstract: A method of policing network traffic based on congestion on a flow-based programmable switch, such as an OpenFlow switch is provided. The method polices congestion-causing flows in a network by detecting congestion at a flow-based programmable switch on the network. Once congestion has been detected, the method identifies one or more flows that are causing the congestion at the flow-based programmable switch, and penalizes the flows that were identified as causing congestion. A flow-based programmable switch including a data plane having input ports, output ports, and forwarding rules that map packets received on an input port to an output port based on a packet matching a rule in the forwarding rules is also described.

Abstract: One method includes: (a) providing a memory storage device having a plurality of storage locations for storing information received by a plurality of sub-ports of a base port of the network device, where the memory storage device is shared among the plurality of sub-ports such that each sub-port is given access to the memory storage device at a certain phase of a system clock cycle; (b) storing a packet or a portion thereof at one of the storage locations when a sub-port that receives the packet has access to one or more of the storage locations; and (c) scrambling addresses for the memory storage locations such that a different one of the storage location is available to the sub-port of step (b) for a next write operation in a next phase when the sub-port of step (b) is given access to the memory storage device.

Abstract: A network element includes an ingress interface, a VSP queue, and a switch fabric (SWF). The ingress interface includes a first virtual subport (VSP) and a second VSP. The first VSP is configured to receive data traffic. The VSP queue is coupled to the second VSP such that data traffic transmitted to the VSP queue is transmitted from the network element via the second VSP. The SWF is configured to receive data traffic from the first VSP, determine whether an intended recipient of the data traffic is associated with the second VSP, and hairpin the data traffic to the VSP queue when the SWF determines that the intended recipient is associated with the second VSP.

Abstract: Disclosed is a packet forwarding device which can reduce a development cost and realize desired QoS control. The packet forwarding device includes a second scheduler 2 including a second packet queue corresponding to each first packet queue included in a first scheduler, a second packet classification unit 22 which sorts a packet data to each second packet queue based on a second classification different from the classification set by the first scheduler, a throughput estimation unit 24 which estimates a throughput indicating an amount of the packet data forwarded to an information processing terminal from the first packet queue corresponding to the second packet queue, and a second packet scheduling unit 25 which forwards the packet data accumulated in each second packet queue based on the throughput and the priority of each second packet queue.

Abstract: A special rendering mode for the first few seconds of play out of multimedia data minimizes the delay caused by pre-buffering of data packets in multimedia streaming applications. Instead of pre-buffering all incoming data packets until a certain threshold is reached, the streaming application starts playing out some of the data packets immediately after the arrival of the first data packet. Immediate play out of the first data packet, for example, results in minimum delay between channel selection and perception, thereby allowing a user to quickly scan through all available channels to quickly get a notion of the content. The immediate play out is done at a reduced speed.

Abstract: A network device such as a router or switch, in one embodiment, includes a timing analyzer which is capable of providing timing analysis over one or more network circuits. The timing analyzer, in one aspect, receives a data packet traveling across a circuit emulation service (“CES”) circuit such as T1 or E1 circuit. Upon obtaining an arrival timestamp associated with the data packet, the arrival timestamp is stored in a timestamp buffer in accordance with a first-in first-out (“FIFO”) storage sequence. After identifying the oldest arrival timestamp in the timestamp buffer, an offset is generated based on the result of comparison between the arrival timestamp and the oldest timestamp. The timing analyzer can also be configured to generate timing reports on-demand based on generated offset(s).

Abstract: Multicasting network packets is disclosed. A total number of copies of a frame, t, to be sent is determined. A number of copies of the frame, m, which is less than a total number of copies of the frame, t, to be made during a current iteration is determined. M copies of the frame are made. The m copies of the frame are then sent to their destinations. The original input frame is provided as output with an indication that the frame should be returned for further processing. Processing of the frame is discontinued during an interval in which other frames are processed. The process is repeated until t copies have been sent.

Abstract: A system and method are disclosed for assigning incoming packets to receive queues of a virtual machine. In accordance with one embodiment, a hypervisor that is executed by a computer system receives a request from a virtual machine to transmit an outgoing packet to a destination, and an identification of a receive queue of a plurality of receive queues of the virtual machine, where the identification of the receive queue is provided to the hypervisor by the virtual machine along with the request. The hypervisor obtains a flow identifier from a header of the outgoing packet that identifies a flow associated with the outgoing packet, and the outgoing packet is transmitted to the destination. The computer system then receives an incoming packet whose header specifies the flow identifier, and the hypervisor inserts the incoming packet into the receive queue using the identification of the receive queue.

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: An apparatus and a method for flow control between a Packet Data Convergence Protocol (PDCP) layer and a Radio Link Control (RLC) layer in a communication system are provided. The method includes storing Service Data Units (SDUs) to be transferred to the RLC layer, receiving information on a capacity that is currently unused in a buffer of the RLC layer from the RLC layer, and generating Packet Data Units (PDUs) from SDUs, a capacity of which corresponds to the information, among packets stored in a buffer of the PDCP layer, and then transferring the generated PDUs to the RLC layer.

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 traffic manager includes an execution unit that is responsive to instructions related to queuing of data in memory. The instructions may be provided by a network processor that is programmed to generate such instructions, depending on the data. Examples of such instructions include (1) writing of data units (of fixed size or variable size) without linking to a queue, (2) re-sequencing of the data units relative to one another without moving the data units in memory, and (3) linking the previously-written data units to a queue. The network processor and traffic manager may be implemented in a single chip.

Abstract: A switching network includes an upper tier having a master switch and a lower tier including a plurality of lower tier entities. The master switch, which has a plurality of ports each coupled to a respective lower tier entity, implements on each of the ports a plurality of virtual ports each corresponding to a respective one of a plurality of remote physical interfaces (RPIs) at the lower tier entity coupled to that port. Data traffic communicated between the master switch and RPIs is queued within virtual ports that correspond to the RPIs with which the data traffic is communicated. The master switch applies data handling to the data traffic in accordance with a control policy based at least upon the virtual port in which the data traffic is queued, such that the master switch applies different policies to data traffic queued to two virtual ports on the same port of the master switch.

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 relay device relays between two TCP communication items of a LAN side and a WAN side. When a line bandwidth of the WAN side is smaller than a line bandwidth of the LAN side, buffer overflow in a LAN side reception buffer and a WAN side transmission buffer of the relay device is prevented, and a connection is prevented from being forced to be canceled. A value of a reception window size (rwnd) described in an ACK packet returned to a transmission terminal of the LAN side is controlled based on a transmission throughput, a discarding rate, and an RTT measured in TCP communication of the WAN side, and a total size of unarranged data and a size of arranged data in a reception buffer of the LAN side and a size of untransmitted data and ACK awaiting data in a transmission buffer of the WAN side.

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 audio-on-demand communication system provides real-time playback of audio data transferred via telephone lines or other communication links. One or more audio servers include memory banks which store compressed audio data. At the request of a user at a subscriber PC, an audio server transmits the compressed audio data over the communication link to the subscriber PC. The subscriber PC receives and decompresses the transmitted audio data in less than real-time using only the processing power of the CPU within the subscriber PC. According to one aspect of the present invention, high quality audio data compressed according to lossless compression techniques is transmitted together with normal quality audio data. According to another aspect of the present invention, metadata, or extra data, such as text, captions, still images, etc., is transmitted with audio data and is simultaneously displayed with corresponding audio data.

Abstract: A mechanism for combining plurality of point-to-point data channels to provide a high-bandwidth data channel having an aggregated bandwidth equivalent to the sum of the bandwidths of the data channels used is provided. A mechanism for scattering segments of incoming data packets, called data chunks, among available point-to-point data channel interfaces is further provided. A decision as to the data channel interface over which to send a data chunk to can be made by examining a fullness status of a FIFO coupled to each interface. An identifier of a data channel on which to expect a subsequent data chunk can be provided in a control word associated with a present chunk of data. Using such information in control words, a receive-end interface can reassemble packets by looking to the control word in a currently processing data chunk to find a subsequent data chunk.

Abstract: A system selectively drops data from queues. The system includes a drop table that stores drop probabilities. The system selects one of the queues to examine and generates an index into the drop table to identify one of the drop probabilities for the examined queue. The system then determines whether to drop data from the examined queue based on the identified drop probability.

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: A switch includes a reserved pool of buffers in a shared memory. The reserved pool of buffers is reserved for exclusive use by an egress port. The switch includes pool select logic which selects a free buffer from the reserved pool for storing data received from an ingress port to be forwarded to the egress port. The shared memory also includes a shared pool of buffers. The shared pool of buffers is shared by a plurality of egress ports. The pool select logic selects a free buffer in the shared pool upon detecting no free buffer in the reserved pool. The shared memory may also include a multicast pool of buffers. The multicast pool of buffers is shared by a plurality of egress ports. The pool select logic selects a free buffer in the multicast pool upon detecting an IP Multicast data packet received from an ingress port.

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 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 and apparatus for processing message is described. In one embodiment, an application programming interface is configured for receiving and sending messages. A multiplexer receives messages from different servers. A service name is coupled to each message with the corresponding destination service. A single shared channel is formed. The messages are processed over the single shared channel.

Abstract: A system and method for sharing a WAN TCP tunnel between multiple flows without having head of the line blocking problem is disclosed. When a complete but out of order PDU is stuck behind an incomplete PDU in a TCP tunnel, the complete but out of order PDU is removed from the tunnel. To do that, first the boundaries of the PDUs of the different flows are preserved and the TCP receive window advertisement is increased. The receive window is opened when initially receiving out-of-order data. As out-of-order complete PDUs are pulled out of the receive queue, to address double counting, place holders are used in the receive queue to indicate data that was in the queue. As out-of-order data PDUs are pulled out of the queue the window advertisement is increased. This keeps the sending side from running out of TX window and stopping transmission of new data.

Abstract: Systems, methods, devices, and processors are described for packet clustering and frame formation in ACM systems. A stream of packets may be received at a gateway. During each cycle, a group of packets from the stream may be fetched according to QoS parameters. The group of packets may be clustered according to modcode to produce a packet list. In some embodiments, packets may be arranged and grouped according to transport steam identifier and modcode to produce a packet list. The packet lists may be clustered sequentially from lower order modcode to higher order modcode. Various frame packing techniques are also described.

Abstract: A device may include a first line card and a second line card. The first line card may include a memory including queues. In addition, the first line card may include a processor. The processor may identify, among the queues, a queue whose size is to be modified, change the size of the identified queue, receive a packet, insert a header cell associated with the packet in the identified queue, identify a second line card from which the packet is to be sent to another device in a network, remove the header cell from the identified queue, and forward the header cell to the second line card. The second line card may receive the header cell from the first line card, and send the packet to the other device in the network.

Abstract: The present invention concerns a method of calculating a filtered filling level of the input buffer of a gateway generating a data stream from a received data stream resisting the jitter of the stream received. It applies more particularly to a gateway receiving an MPEG (Moving Picture Experts Group) transport stream received according to the IP protocol (Internet Protocol) and retransmitted over an ASI interface (Asynchronous Serial Interface). The invention proposes a method of calculating a filtered filling level of the input buffer resisting the jitter of the stream received. The received stream passing through an input buffer, the method is based on a regulation as a function of the maximum level of the buffer evaluated over a period of time, making it possible to protect against the effects of the jitter introduced into the received stream.

Abstract: A packet is classified into a class. A priority value is assigned to the packet wherein packets in a flow are assigned priorities according to some probability distribution within some band. A determination is made, at a network device for a highest latency class, whether a sum of queued packet sizes of previously received packets having an equal or smaller latency class than the packet and larger or equal priority than the packet is larger than a threshold value. When the sum is larger, the packet is dropped, otherwise a determination is made whether a latency class of the packet is less than the latency class of the network device. When the latency class is not less, the packet is stored in a queue for the latency class. When the latency class is less, then the process is repeated until the packet is dropped or stored in a queue.

Abstract: A system, method, and computer program product are provided for processing different content each stored in one of a plurality of queues. In use, a plurality of different content is identified for processing. Additionally, each of the different content is stored in one of a plurality of queues based on a classification thereof. Furthermore, the plurality of different content stored in the plurality of queues is processed.

Abstract: A system, method, and computer program product are provided for optimal packet flow in a multi-processor system on a chip. In operation, a credit is allocated for each of a plurality of agents coupled to a messaging network, the allocating including reserving one or more entries in a receive queue of at least one of the plurality of agents. Additionally, a first credit is decremented in response to a first agent sending a message to a second agent, the plurality of agents including the first and second agents. Furthermore, one of the first credit or a second credit is incremented in response to a signal from the second agent.

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: 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: A method for providing ordered data packets to a processor is provided. The method comprises receiving a plurality of data packets, each comprising an order identifier. At least one out-of-order data packet of the plurality of data packets is placed in a priority queue. One or more correction packets are received. One or more missing data packets or corrupted data packets of the plurality of data packets are detected based on the one or more correction packets. The one or more missing data packets or corrupted data packets of the plurality of data packets are corrected based on the one or more correction packets. The one or more corrected data packets are provided to the processor. The at least one out-of-order data packet in the priority queue is provided to the processor.

Abstract: A method for controlling uplink IP packet filtering in a mobile terminal in a 3GPP Evolved Packet System (EPS) is provided, including an information receiving operation of receiving IP address information allocated to user equipment, and filtering information required for delivering an uplink IP packet received from the user equipment; and a filtering operation for determining which packet data network and a bearer the IP packet is delivered to, based on the IP address information and the filtering information. In a 3GPP evolved packet system supporting a default bearer function, a packet data network to which an uplink IP packet is delivered and a bearer identifier can be efficiently determined when the user equipment simultaneously accesses one or more packet data networks and is allocated several IP addresses, resulting in effective uplink packet filtering.

Abstract: An apparatus and method for scheduling data transmissions in a wireless network is disclosed. A first value related to a buffer is transmitted to a user equipment (UE) by a network. The network also transmits an allocation message for an uplink transmission and receives data in response. The data is selected from the plurality of buffers of the UE in response to the transmitted first value and based on a second value.

Abstract: The present invention provides a preemptive priority scheduling system and method for optimal load balancing of messages and preserving the lightweight allocation resources in an intersystem communication. The invention also provides a system and method for scheduling of messages of a plurality of classes in an intersystem communication.