Abstract: A method and an apparatus for managing and scheduling tasks in a many-core system are presented. The method improves process management efficiency in the many-core system. The method includes, when a process needs to be added to a task linked list, adding a process descriptor pointer of the process to a task descriptor entry corresponding to the process, and adding the task descriptor entry to the task linked list; if a process needs to be deleted, finding a task descriptor entry corresponding to the process, and removing the task descriptor entry from the task linked list; and when a processor core needs to run a new task, removing an available priority index register with a highest priority from a queue of the priority index register.

Abstract: A reception buffer of a packet reception apparatus includes a plurality of storage addresses. A packet determination unit receives a packet from a plurality of lines including a main system and an auxiliary system. The packet determination unit obtains a storage address corresponding to a unique number assigned to the packet, and overwrites and stores data of the packet onto the storage address. A packet extraction/transmission unit extracts and transmits the data stored in the reception buffer.

Abstract: Provided are a method and device for processing packet congestion. The method includes: receiving a packet fragment of a packet and fragment parameters and acquiring congestion parameters required for processing packet congestion according to the fragment parameters; when the packet fragment is an SOP fragment in the packet, acquiring an average queue size and a size threshold of the packet according to the fragment parameters and the congestion parameters and processing the packet. By acquiring the average queue size and the size threshold of the packet according to the fragment parameters and congestion parameters received and processing the packet according to the relationship between the average queue size and the size thresholds when a packet fragment received is an SOP fragment, the solution effectively eliminate the packet congestion in a communication network, accelerate the operation speed of processing the packet congestion and greatly save an internal cache space.

Abstract: A system is described that improves network function virtualization. The system facilitates an access point, such as a customer premises equipment, to utilize functionality of another access point when providing communication service to a device at a customer premises. The other access point may be a customer premises equipment at a neighboring premises. The access point may utilize the neighboring access point in case the access point is in a power saving state. Alternatively or in addition, the access point may use the other neighboring access point based on bandwidth availability, processing capability, memory capacity, or other attributes, or a combination thereof of the neighboring access point. In yet another example, the access point may utilize the neighboring access point in case of a failure in connection between the access point and a network provider.

Abstract: A receiving terminal (400) has: a reception stack unit (410) which connects to a communication network; an issuance management unit (440) which transmits a data request packet; and an H-RTT measurement unit (450) which determines a timeout period until retransmission of the data request packet, and in accordance with the determined timeout period, performs retransmission of the data request packet until data is received by the reception stack unit (410). The reception stack unit (410) connects to the communication network via a plurality of communication interfaces. The issuance management unit (440) transmits the data request packet from each of the plurality of communication interfaces. The H-RTT measurement unit (450), for each of the communication interfaces, measures the RTT between the communication interface and a data-bearing node, and on the basis of the RTT, determines a timeout period.

Abstract: A method implemented in a content node configured to operate in an information centric network (ICN) comprising allocating each of a plurality of memory spaces coupled to a processor exclusively to a particular thread from a plurality of threads allocated in the processor, wherein the processor is in a content node; assigning each of a plurality of namespaces at a defined level exclusively to one of the particular threads from the plurality of threads based on an assignment algorithm; and partitioning entries from a Forwarding Information Base (FIB) table, wherein the entries map content names to ports on the content node, wherein each entry is partitioned in a FIB sub-table to the memory space allocated to the one of the particular threads associated with the namespace corresponding to the content name contained within the entry.

Abstract: Apparatus and method to facilitate power consumption reduction in one or both of a first and second device are disclosed herein. In some embodiments, the first device may include one or more antennas that is to receive first audio data captured by the second device; and one or more processors in communication with the one or more antennas. The one or more processors is to identify a first energy level associated with the first audio data, determine, in accordance with the first energy level, a size of a buffer to be updated in the second device to capture second audio data, and detect whether one or more key phrases is included in the first audio data, which may be repeated depending on the no, one, or more key phrases detected.

Abstract: Disclosed are a method and an apparatus for operating based on a power save mode in a wireless LAN. The method for operating based on the power save mode in a wireless LAN may comprise the steps of: an AP receiving, from a first STA, a first trigger frame for triggering the transmission of first downlink data which has been buffered for the first STA; the AP determining a temporary halt of the transmission the first downlink data, which is transmitted as a response to the first trigger frame, based on a first priority rank of the first downlink data which has been buffered for the first STA, a second priority rank of second downlink data which has been buffered for a second STA, and a point when the second STA is switched to an awake state; and the AP transmitting, to the first STA, a temporary halt setting frame for indicating the temporary halt.

Abstract: A terminal device is provided. The terminal device includes a communication interface unit configured to receive image data of an application installed in another terminal device that is streamed from the another terminal device, a display unit configured to display the image data, a control unit configured to receive an installation file associated with the application through the communication interface unit while the image data is being displayed, and to execute the received installation file when authentication of the installation file is completed, and a storage unit configured to allow the application to be installed therein according to execution of the installation file.

Abstract: A method of re-dispatching packets at a packet forwarding element that includes a hardware dispatch unit and a multi-core processor. The method, at a first core of the multi-core processor, receives a packet of a particular packet flow from the hardware dispatch unit. The packet is dispatched from the hardware dispatch unit to the first core based on hardware implemented hashing algorithm. The first core identifies the plurality of header fields of the packet that uniquely identifies the particular packet flow. The first core performs a software implemented hashing algorithm on the identified plurality of header fields of the packet to calculate a hash value. The first core re-dispatches the packet from the first core to a second core of the multi-core processor based on the calculated hash value.

Abstract: A method for use in a data processing system connected to a network in accordance with a data transfer protocol, the data processing system having one or more event queues for holding network events, and being capable of responding to interrupts issued in response to the presence of a network event in the data processing system by invoking a stack to cause processing in accordance with the data transfer protocol of network events on the event queues; the method comprising: deciding whether to permit the interrupts to be enabled, in dependence on the result of a determination as to the presence of current indications that the stack will be invoked by an entity in the data processing system to cause processing in accordance with the data transfer protocol of network events on the event queues.

Abstract: A method of re-dispatching packets at a packet forwarding element that includes a hardware dispatch unit and a multi-core processor. The method, at a first core, receives a packet of a particular packet flow from the hardware dispatch unit. The packet is dispatched from the hardware dispatch unit to the first core based on a hardware implemented hashing algorithm. The first core identifies a plurality of header fields of the packet that uniquely identifies the particular packet flow when the packet includes overlay network encapsulation. The first core performs a software implemented hashing algorithm on the identified plurality of header fields of the packet to calculate a hash value. The hardware implemented hashing algorithm and the software implemented hashing algorithm generate the same hash value when performed on the same plurality of values. The first core re-dispatches the packet to a second core based on the calculated hash value.

Abstract: Particular systems, methods, and program products for web-based security systems for user authentication and processing in a distributed computing environment are disclosed. A computing sub-system may receive an electronic processing request and a first signed data packet having a first payload that was hashed and encrypted using a first private key. The first payload may comprise first processing output and a first timestamp. The sub-system may verify the first signed data packet by decrypting it using a first public key. The sub-system may execute computing operations to satisfy the electronic processing request, producing second processing output. The sub-system may configure a data packet with a second payload comprising at least the second processing output and a second timestamp. The sub-system may encrypt the second payload using a second private key producing a second signed data packet. The sub-system may transmit to a second sub-system the second signed data packet.

Abstract: An operation unit detects that a received first ACK packet is an ACK packet transmitted in response to a single data packet. The operation unit determines whether to calculate a round trip time by using reception time of the first ACK packet on the basis of a window size included in the first ACK packet and a window size included in a second ACK packet acquired immediately before the first ACK packet. If the operation unit determines to calculate the round trip time, the operation unit outputs the round trip time calculated by using the reception time of the first ACK packet.

Abstract: A method of preventing priority inversion in power line communication includes generating a priority notification signal of each node in order to prioritize a packet transmitted by each of the nodes, decreasing carrier detection threshold value of a prioritization section in the priority notification signal of each of the nodes, increasing transmission power level of the prioritization section in the priority notification signal of each of the nodes, transmitting the priority notification signal generated by each of the nodes, prioritizing the nodes by comparing the prioritization sections of the priority notification signals, and preferentially transmitting a packet of a node with a higher priority. This can solve a priority inversion problem between signals in a network to safely transmit signals without collisions and latency.

Abstract: One embodiment of the present invention sets forth a technique for adapting playback bit rate in a content delivery system based on scene complexity of the video content as well as network conditions and other performance factors. A scene complexity map of the video content indicates the complexity levels of different scenes within the video content. Using the scene complexity map, a content player may download scenes of lower scene complexity levels from video streams encoded to lower bit rates to manage the bandwidth consumed to download the video content and allow for the downloading of scenes of higher complexity levels from video streams encoded to higher bit rates.

Abstract: An individual score is generated for a first combination of a transmitter configuration value and a receiver configuration value. The transmitter configuration is used to configure a first physical layer circuit and the receiver configuration is used to configure a second physical layer circuit. The individual score is based on measured characteristics observed by the second physical layer circuit in response to the first configuration combination. A neighbor weighted score is then generated for the first configuration combination. The neighbor weighted score is based on measured characteristics observed by the second physical layer circuit in response to a second configuration combination that is within a first distance from the first configuration combination within a multidimensional array of configuration combinations. The individual score is summed with the neighbor weighted score to generate a final neighbor weighted score for the first configuration combination.

Abstract: Provided are a computer program product, system, and method for indicating a sending buffer and receiving buffer in a message to use to validate the message in the receiving buffer. A receiving node includes a receive buffer for each of a plurality of external adaptors in external nodes. The receive buffers store messages from the external adaptors. Each of the messages includes an indicated receiving adaptor to receive the message and an indicated sending adaptor that sends the message. A determination is made as to whether the sending adaptor that sent the message comprises the indicated sending adaptor and that a receiving adaptor that received the message comprises the indicated receiving adaptor. An error is indicated for the message in response to determining that at least one of the sending and receiving adaptors that sent and received the message, respectively do not comprise the indicated sending and receiving adaptors, respectively.

Abstract: The present invention provides a better solution to the problem of reporting to the transmitter the data received by a receiver in the field of data communications. This is achieved by reporting the status of the receivers' window. The cumulative sequence number is placed in the first field of the acknowledgement report as per the present invention. As per prior negotiation, the optional field of missing and received span pairs is placed after that. The first missing span length occurs after that. The next received span length is placed after that. Thereafter, the next missing span length and the received span lengths are placed one after the other. The last received data span is acknowledged in the last field. One optional field can occur either before or after this layout to represent the receiver open window status.

Abstract: A method for performing a bandwidth test for communications from a first network station to a second network station of a communication network is based on the probe rate model (PRM) in which iteratively a train of probe sample packets is transmitted from the first station to the second station with a constant packet rate per iteration. The packet rate is adapted to the available bandwidth on the data pipe per iteration. According to the disclosure the number of probe packets per train of probe sample packets is varied with the available bandwidth per iteration. This increases the accuracy of the test, in particular, in the range where a high data rate is available on the data pipe. A step decreasing factor (SDF) is applied with which the performance test is improved. Such step decreasing factor is dependent on the network jitter and further improves the performance of the test.

Abstract: A method for classifying packets includes determining an execution indication indicating at least one amongst a service and application being executed on a user terminal and generating uplink packets; determining a marker on the basis of PCC rules available at the user terminal and at least one execution indication, the marker for identifying at least one of a service and an application associated to uplink packets; transmitting the marker and the uplink packets, to a PCEF network entity; determining an uplink classification, at the PCEF network entity, for received uplink packets based on the marker; storing, at said PCEF network entity, an association between information related to an uplink flow corresponding to the uplink packets and uplink classification; receiving, at said PCEF network entity, downlink packets corresponding to the uplink packets; determining a downlink classification, at the PCEF network entity, for received downlink packets based on the stored association.

Abstract: An I/O circuit includes buffers, a storage module, accumulators, timers, and an arbiter. Each buffer corresponds to a respective virtual channel. Each buffer corresponds to a respective token bucket, and outputs a normal transmission request according to the amount of tokens and an accumulating signal. The storage module stores a lookup table including a plurality of weightings. Each accumulator corresponds to a respective buffer, accumulates a data volume according to the corresponding weighting, and outputs the accumulating signal. Each timer corresponds to a respective buffer, times waiting period after the corresponding buffer outputs the normal transmission request, and outputs a time-out transmission request when the waiting period exceeds a predetermined period. The arbiter receives the time-out transmission requests and the normal transmission requests, and selects one of the buffers from all of the time-out transmission requests and the normal transmission requests.

Abstract: A transmission of information from a secondary to a primary node occurs in a plurality of transmission instances which are logical time durations. A secondary node receives an allocation of periodic transmission instances for a scheduling request indicator (SRI) and an allocation if periodic transmission instances for a sounding reference signal (SRS). In a particular transmission instance allocated for the transmission of both SRS and SRI, the secondary node transmits the SRI without transmitting the SRS if the SRI indicates a pending scheduling request; otherwise, the secondary node transmits the SRS without transmitting the SRI.

Abstract: A memory access request associated with a data unit is received from a first thread of a pixel shader. A processing status associated with the data unit is obtained from a window buffer. It is determined whether the data unit is being processed by a second thread. If so, a rejection procedure is performed to avoid the first thread gaining to access an attribute value associated with the data unit from/to a DRAM (Dynamic Random Access Memory). Otherwise, an acknowledgement procedure is performed to grant the first thread to access the attribute value associated with the data unit from/to the DRAM.

Abstract: A system for determining a worst case latency for a specific information flow that is part of a plurality of information flows and a worst case backlog for a specific queue that is part of a plurality of queues is disclosed. The plurality of information flows and plurality of queues are part of a configuration. The system performs operations including determining a maximum busy period length for the configuration. The operations include determining a set of candidate starting times for the configuration based on the maximum busy period length. The operations further include determining a maximum layout for a plurality of information flows within the configuration. The operations include updating the worst case latency and the worst case backlog based on the maximum layout. Finally, the operations include determining the worst case latency for the specific information flow and the worst case backlog for a specific queue.

Abstract: As one example, a method includes analyzing profile metadata for each of a plurality of ABR program streams within a lookahead window from a current chunk boundary to identify at least one target event at a chunk boundary. ABR profiles for chunks at the target event chunk boundary are allocated to fit within the channel bandwidth and achieve a predetermined target quality level for the chunks at the target event chunk boundary. In response to each target event, ABR profiles for each of the unallocated chunks within the lookahead window are selected by adjusting the ABR profiles for each of the unallocated chunks to fit within the predetermined bandwidth constrained by the ABR profiles allocated for the chunks at the target event chunk boundary. An ABR profile for a given chunk at the current chunk boundary is allocated based on the selected ABR profiles.

Abstract: A system for sending a command stream comprises a first input interface, a processor, and an output interface. The first input interface is configured to receive a call. The processor is configured to determine one or more packets for the call. The one or more packets are able to be reassembled to form the call. The processor is configured to assign a first packet of the one or more packets to a first output queue and assign the second packet to a second output queue in the event there is a second packet of the one or more packets for the call. The output interface configured to send the first packet from the first output queue.

Abstract: A transmission apparatus includes a first storage configured to store data received from external into a write enable area, a second storage configured to store the data in accordance with a write request and output a retry request in response to occurring an error of writing a first data included in the data, and a controller configured to read the data from the first storage and send the write request to the second storage, set an area of the first storage storing the first data to a write disable area in combination with stop sending the retry request to external when receiving the retry request from the second storage, and send the first data reading from the write disable area of the first storage to external in response to a read request from external.

Abstract: A first packet and a first direction associated with the first packet are received. The first packet is forwarded to an output port of a plurality of output ports of the first router based on the first direction associated with the first packet. A second direction associated with the first packet is determined. The second direction is based at least on an address of the first packet. The first packet and the second direction are forwarded through the output port of the first router to a second router.

Abstract: A method of the present invention includes: determining, when packet congestion occurs or network bandwidth decreases, at least one to-be-discarded packet in a packet buffer; and discarding the at least one to-be-discarded packet so that at least one unbuffered packet enters the packet buffer to prevent discarding too many unbuffered packets, where the unbuffered packet is a packet that has not entered the packet buffer. The present invention is primarily applied in a packet buffering process.

Abstract: Provided are a computer program product, system, and method to allocate a segment of a buffer to each of a plurality of threads to use for writing data. Each of a plurality of threads are assigned to one of a plurality of segments in a buffer, wherein the threads write to the segment to which they are assigned. A free segment list indicates segments which are not assigned to one of the threads. In response to one of the segments assigned to one of the threads becoming a full segment having less than a threshold amount of free space, indicating the full segment assigned to the thread in the free segment list and assigning one of the segments in the free segment list to the thread different from the full segment.

Abstract: A computer network system configured with disaggregated inputs/outputs. This system can be configured in a leaf-spine architecture and can include a router coupled to a network source, a plurality of core switches coupled to the router, a plurality of aggregator switches coupled to each of the plurality of core switches, and a plurality of rack modules coupled to each of the plurality of aggregator switches. The plurality of rack modules can each include an I/O appliance with a downstream aggregator module, a plurality of server devices each with PCIe interfaces, and an upstream aggregator module that aggregates each of the PCIe interfaces. A high-speed link can be configured between the downstream and upstream aggregator modules via aggregation of many serial lanes to provide reliable high speed bit stream transport over long distances, which allows for better utilization of resources and scalability of memory capacity independent of the server count.

Abstract: The subject matter disclosed herein relates to a frame switch of an AFDX network in which the data acquisition application is decentralized. When the switch has to acquire the data transmitted on a virtual link, the switching table contains, apart from the input port and the output port (s) taken by this link, an ID representing the MAC address of the switch. The frames of this link are then not only switched but also transmitted to the network interface of the switch and processed by a dedicated application (DDA), hosted inside the switch. This application can be interrogated by a remote server and transfer the data that it has stored locally.

Abstract: The present invention relates to a data processor and data processing method that facilitate properly processing a stream. An input stream is formed by a plurality of packets. Each of the packets of the input stream is distributed to one of a plurality of channels and null packets (NP) are distributed to the other channels. This divides the input stream into divided streams on a plurality of channels including the packets of the input stream at a predetermined density. The present invention can be used, for example, for a channel bonding (CB) technique in which an input stream is divided into a plurality of channels and transmitted.

Abstract: A method and a network entity for evaluating a link between a first and a second network node are disclosed. The link is configured to carry data packets between the network nodes via a third network node. The link comprises a first segment and a second segment. The network entity obtains an indication of a measurement tool to be used in a measurement session for evaluation of the link. The network entity selects a mathematical model based on the indication. The network entity generates measurement values by executing the measurement session. The network entity determines a first and a second value relating to lost data packets of the first and second segments, respectively, based on the measurement values and the selected mathematical model. The network entity identifies at least one of the first and second segments based the first and second values.

Abstract: A self-configuring router includes a resource allocator that automatically assigns processors to queues, such that queue workload is distributed as evenly as possible among the processors, and the processors are as fully utilized as possible. Consequently, packets do not remain on queues longer than necessary, thereby decreasing latency of packets traversing the router, and available and expensive resources, namely the processors, are kept busy. The router automatically allocates its own resources (processors) to its own queues.

Abstract: Provided are a method and system for improving bandwidth allocation efficiency, relating to optical communication field. In a PON system, an ONU detects each TCONT of the ONU in real time, and sends to an OLT a private message used for reporting buffer overflow when detecting that buffer overflow occurs on a TCONT; the OLT sends, according to the received private message used for reporting the buffer overflow, to the ONU a private message used for instructing the ONU to activate an overflow allocation mechanism; after receiving the private message used for instructing the ONU to activate the overflow allocation mechanism, the ONU activates the overflow allocation mechanism, calculates an actual traffic of a buffer of the TCONT, and sends the actual traffic of the buffer of the TCONT to the OLT; and the OLT dynamically allocates bandwidth to the TCONT according to the actual traffic of the buffer of the TCONT.

Abstract: A method for classifying packets includes determining an execution indication indicating at least one amongst a service and application being executed on a user terminal and generating uplink packets; determining a marker on the basis of PCC rules available at the user terminal and at least one execution indication, the marker for identifying at least one of a service and an application associated to uplink packets; transmitting the marker and the uplink packets, to a PCEF network entity; determining an uplink classification, at the PCEF network entity, for received uplink packets based on the marker; storing, at said PCEF network entity, an association between information related to an uplink flow corresponding to the uplink packets and uplink classification; receiving, at said PCEF network entity, downlink packets corresponding to the uplink packets; determining a downlink classification, at the PCEF network entity, for received downlink packets based on the stored association.

Abstract: A video-on-demand server includes interface modules each providing a communication interface between the video-on-demand server and a switching network; an interface to a management module to monitor and provide to the video-on-demand server information on video-on-demand bandwidth utilization of network resources allocated to particular service groups, each service group including video-on-demand customers sharing a same fixed network bandwidth allocation; each interface module communicatively coupled to service groups simultaneously via service gateways; a total bandwidth of the server is an aggregate bandwidth of all the interface modules, and is less than an aggregate bandwidth of all service groups assigned to be serviced by the server, the switching network configured to make the server available for receiving video on demand service requests from all of the service group customers simultaneously; the server adapted to dynamically assign bandwidth of the server to service groups, by adapting the switchi

Abstract: An approach to adaptively positioning a set of mobile routers to provide communication services to a set of clients makes use of estimated direction profiles of communication between routers and clients. The approach does not rely on a Euclidean model in which communication characteristics (e.g., signal strength, data rate, etc.) depend on distance between communicating nodes, and does not necessarily require sampling of communication characteristics in unproductive directions in order to move the routers to preferable locations.

Abstract: Some embodiments provide a method for reducing congestion in a network stack that includes a series of components that send data packets through the network stack to a network. At a first component of the network stack, the method receives a data packet from a second component of the network stack. The method identifies a usage indicator value for a flow to which the data packet belongs. The usage indicator value is based on a comparison of a size of the flow to a size of a queue for a third component of the network stack. The method determines whether to send the data packet based on a comparison of the usage indicator value to a threshold usage value. The method sends the data packet to a next component of the network stack only when the usage indicator value is less than the threshold usage value.

Abstract: A receiving network node (210) configured to select from received packets differing by time of initial transmission from a sending network node (230), and accepting for transmission, based on initial transmission time, the selected packets to an application layer (740). An internetworked processor node configured to: (a) read a sequence number and an originator identifier of a received packet message (810); (b) compare a stored highest sequence number associated with the originator identifier with the received packet sequence number (820); (c) if the received packet sequence number is less than or equal to the stored highest sequence number associated with the originator identifier, then discard (840) the received packet; and (d) if the received packet sequence number is greater than the stored highest sequence number associated with the originator identifier, then deliver (860) the message of the received packet to an application based on an upper layer protocol.

Abstract: A service switching method, device and system for a local communication network are described. The method includes that: a current terminal receiving a service switching starting instruction sends running service information to a selected target terminal, and sends a service switching request message to a server; the server receiving the service switching request message sends service information to the target terminal; the target terminal extracts service progress time from the service information sent by the current terminal and the service information sent by the server respectively, calculates a time difference according to the extracted service progress time, and sends the time difference to the server; and the server regulates a progress of the service information sent to the target terminal according to the time difference to make the progress consistent with a progress of the service information sent to the selected target terminal by the current terminal.

Abstract: Systems and methods of recommending that two people form a link on a social networking system uses activities conducted by a first person on a telephony system to determine the names of individuals and businesses that the first person has communicated with through the telephony system. This list of names and individuals is then compared to the names of individuals and businesses that are members of the social networking system. If the first person is communicating with individuals or businesses who are members of the social networking system, a recommendation that they form a link on the social networking system is issued to one or both parties.

Abstract: A target network transceiver is tested or monitored using an intelligent transceiver programmed to perform such testing and to transmit test results to a remote server. A demarcation unit enclosure is provided that includes two ports for the target and intelligent transceivers that are connected by a direct data link. An interface circuit connecting control interfaces of the two transceiver ports polls the target transceiver and passes polled control information to the intelligent transceiver.

Abstract: A method for optimizing delivery of messages to mobile device users includes receiving a message to be sent to a client application executable at a mobile device of a user, along with an associated time constraint and an associated geographic constraint, determining a current time at the mobile device and a current geographic location of the mobile device, determining whether the current geographic location of the mobile device complies with the associated geographic constraint and determining whether the current time of the mobile device complies with the associated time constraint, and sending, when the current geographic location of the mobile device complies with the associated geographic constraint and when the current time of the mobile device complies with the associated time constraint, the message for display to the user at the mobile device.

Abstract: A cell processing method and apparatus are provided. The method includes: obtaining, by a first sending end, a first timestamp compensation time; adding, by the first sending end, the first timestamp compensation time to a first timestamp carried in a first cell, where the first timestamp is a sending time of the first cell; and sending, by the first sending end to a receiving end, the first cell that is added with the first timestamp compensation time, so that the receiving end forwards the first cell according to the first timestamp that is added with the first timestamp compensation time. In the present invention, a first timestamp compensation time is added to a first timestamp carried in a first cell, which improves cell forwarding efficiency of the receiving end and prevents the occurrence of cell accumulation in a link.

Abstract: An apparatus for operating a low data-rate (LDR) link and legacy switch at a high data-rate (HDR) includes a first block and a second block. The first block receives input signals from the legacy switch and generates identical output signals. The second block receives the identical output signals and generates an HDR signal for communication over the LDR link coupled to an access point. Further, a media access control (MAC) interface communicates data at a first data rate with an Ethernet PHY block including a first-in-first-out (FIFO) module and a buffer. The FIFO receives data from the MAC interface at the first data rate and transmits data at a second data rate. The buffer receives data from the Ethernet port at the second data rate and transmits the received data at the first data rate in response to detection of an end of packet.

Abstract: A packet processor includes a header processor and a packet memory. A receive direct memory access block is configured to receive a packet with a header and a payload and to route the header to the header processor and to route the payload to the packet memory such that the header processor begins processing of the header while the payload is loaded into packet memory.

Abstract: A method, system, and computer program product for determining a congestion value in a networking component in a data network are provided in the illustrative embodiments. A first packet is set to use a first priority level and a second packet is set to use a second priority level. The second priority level is lower than the first priority level. The second packet is transmitted after the first packet to the networking component, causing the networking component to transmit the first and the second packets after they are received at the networking component. A function is applied to an arrival delay to compute the congestion value of the networking component, wherein the arrival delay comprises a length of an elapsed period between receiving a transmission of the first packet from the networking component and receiving a transmission of the second packet from the networking component.