Abstract: This disclosure relates to methods and systems for queuing traffic in packet-switched networks. In one of many possible embodiments, a queue management system includes a plurality of queues and a priority module configured to assign incoming packets to the queues based on priorities associated with the incoming packets. The priority module is further configured to drop at least one of the packets already contained in the queues. The priority module is configured to operate across multiple queues when determining which of the packets contained in the queues to drop. Some embodiments provide for hybrid queue management that considers both classes and priorities of packets.

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

Abstract: A buffering structure including at least a first FIFO storage structure to stage at least a selected one of undiverted egress packets and undiverted ingress packets is provided. The buffering structure further includes at least first associated packet drop logic to selectively effectuate head or tail flushes of the first FIFO storage structure. In various embodiments, one or more additional FIFO storage structures are also provided to stage one or more diverted and/or insertion of egress/ingress packets. Those use for staging diverted egress/ingress packets are likewise provided with associated packet drop logic to perform tail flushes of these additional FIFO structures. In one application, the buffering structure is employed by a multi-protocol network processor, which in turn is employed by an optical networking module.

Abstract: A system and method of transmitting data frames between a plurality of input ports to a plurality of output ports is described. The input ports segment portions of the received data frames to provide smaller data cells which are individually transmitted to an output port associated with a destination of the segmented data frame. Based upon information provided in the data cells received at the output port, the output port determines the ordinal positions of the received data cells within the segmented data frame and reassembles the data frame which was segmented at the input port. The output port then forwards the reassembled frame toward the associated destination.

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

Abstract: Communicating using a mesh network is disclosed. A frame length used for communicating a packet between a first node and a second node of a wireless mesh network is selected. A route from the first node to the second node is determined including one or more intermediate nodes that receive and transmit the packet. Node to node communications within the frame along the route is selected such that a communication latency time is below a predetermined limit time for a predetermined percentage of communications between the first node and the second node.

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

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

Abstract: A circuit includes queue buffers, a bid masking circuit, and a priority selection circuit. Each of the queue buffers carries packets of a respective message class selected from a set of message classes and asserts a respective bid signal indicating that the queue buffer carries a packet that is available for transmission. The bid masking circuit produces a masked vector of bid signals by selectively masking one or more of the bid signals asserted by the queue buffers based on credit available to transmit the packets and on cyclical masking of one or more of the bid signals asserted by ones of the queue buffers selected for packet transmission. The priority selection circuit selects respective ones of the queue buffers from which packets are transmitted based on the masked vector of bid signals produced by the bid masking circuit.

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

Abstract: A credit based queue scheduler dynamically adjusts credits depending upon at least a moving average of incoming packet size to alleviate the impact of traffic burstiness and packet size variation, and increase the performance of the scheduler by lowering latency and jitter. For the case when no service differentiation is required, the credit is adjusted by computing a weighted moving average of incoming packets for the entire scheduler. For the case when differentiation is required, the credit for each queue is determined by a product of a sum of credits given to all queues and priority levels of each queue.

Abstract: A system provides congestion control in a network device. The system includes multiple queues, a dequeue engine, a drop engine, and an arbiter. The queues temporarily store data. The dequeue engine selects a first one of the queues and dequeues data from the first queue. The drop engine selects a second one of the queues to examine and selectively drop data from the second queue. The arbiter controls selection of the queues by the dequeue engine and the drop engine.

Abstract: Method for transmitting a sequence of messages in a point-to-point interconnection network comprising message initiating agents, message destination agents and message transmission agents. During a transmission of an indivisible sequence of messages from an initiating agent to a destination agent, an output of a message transmission agent is locked onto an input of the transmission agent, the other inputs of the said transmission agent being able to transmit messages to the other outputs of the said transmission agent.

Abstract: A method and system schedule data for dequeuing in a communication network. The communication network includes an eligible scheduling node, a scheduling context structure, and an existence of data structure. In response to determining that an eligible scheduling node does not contain at least one child identifier in the scheduling context structure, an eligible child is selected for dequeue from the existence of data structure. At least one eligible child from the existence of data structure is absorbed into the scheduling context structure. The at least one eligible child includes the child selected for dequeue. Absorbing a child includes removing the child identifier from the existence of data queue and adding the child identifier to the scheduling context structure.

Abstract: Real-time customer packet traffic is instrumented to determine measured delays between two or more points along a path actually traveled by a packet, such as within or external to one or more packet switching devices. These measurements may include delays within a packet switching device other than the ingress and egress time of a packet. These measured delays can be used to determine whether or not the performance of a packet switching device or network meets desired levels, especially for complying with a Service Level Agreement.

Abstract: Congestion control techniques based upon resource utilization information stored by a network device. According to an embodiment of the present invention, a network device is configured to identify a data source causing congestion based upon information stored by the network device identifying a set of data sources, and for each data source, information identifying the amount of a resource of the network device being used for processing data received by the network device from the data source.

Abstract: A circulating switch comprises switch modules of moderate capacities interconnected by a passive rotator. Data is sent from a one switch module to another switch module either directly, traversing the rotator once, or indirectly through at least one intermediate switch module where the rotator is traversed twice. A higher capacity extended circulating switch is constructed from higher-capacity switch modules, implemented as common memory switches and having multiple ports, interconnected through a multiplicity of rotators preferably arranged in complementary groups of rotators of opposite rotation directions. A polyphase circulating switch having a low switching delay is derived from a multi-rotator circulating switch by providing programmable rotators having adjustable relative rotator-cycle phases. A low delay high-capacity switch may also be constructed from prior-art medium-capacity rotator space switches with mutually phase-shifted rotation cycles.

Abstract: A method and system access a channel in a wireless network of nodes. A coordinator transmits periodically a beacon, in which time between two consecutive beacons constitute a beacon interval. The coordinator and other nodes transceive a superframe during the beacon interval, in which the superframe begins with an active interval, which is immediately followed by an inactive interval, and in which the active interval begins with a contention free period, which is immediately followed by a contention access period, which is immediately followed by the inactive interval.

Abstract: A system comprises a station manager for associating a queue block to each active station in a network, each queue block being configured to implement a contention-based process, e.g., IEEE 802.11e, to select a winning frame from a set of frames; a multiplexer for receiving frames, each frame having a destination address, and for routing each received frame to a queue block based on the destination address; an access controller for receiving the winning frame from each queue block, for forwarding the winning frame(s) to a physical layer for simultaneous transmission to the active station(s) when the number of winning frames is equal to or below a threshold greater than one, and for forwarding a subset of the winning frames to the physical layer for simultaneous transmission to the active stations when the number of winning frames is above the threshold; and a physical layer capable of simultaneous frame transmission.

Abstract: A FIFO communication system is provided using a FIFO and connection circuit to transmit data from a single source to multiple sinks. The connection circuit operates to enable simultaneous reads by the multiple sinks with a single output port FIFO. Multiple FIFOs can likewise be used to distribute data from a single source to multiple sinks without requiring a simultaneous read by both sinks. Similarly, a multiple output port FIFO can be used to supply multiple sinks without requiring simultaneous reads and without requiring additional memory use.

Abstract: A plurality of virtual paths in a network interface between a host port and a network port are managed according to respective priorities using dynamic buffer allocation. Thus, multiple levels of quality of service are supported through a single physical network port. Variant processes are applied for handling packets which have been downloaded to a network interface, prior to transmission onto the network. The network interface also includes memory used as a transmit buffer, that stores data packets received from the host computer on the first port, and provides data to the second port for transmission on the network. A control circuit in the network interface manages the memory as a plurality of first-in-first-out FIFO queues having respective priorities. Logic places a packet received from the host processor into one of the plurality of FIFO queues according to a quality of service parameter associated with the packets.

Abstract: An integrated egress/replay memory structure is provided with split rate write and read ports and means for managing at least three types of data moving into, through and/or out of the integrated memory structure, namely: (1) currently egressing packet data; (2) replay data; and (3) to-be egressed data. Additionally, a shared free space (4) is managed between the storage areas of the (2) replay data and (3) the to-be egressed data. The to-be egressed data (PdBx) is allowed to enter into (to be written into) a front-end raceway portion of the integrated memory structure at a rate which can be substantially greater than that allowed for corresponding egressing packet data (PdUx). Thus, even when egressing packet data that is ahead in line is shifting out toward a slow rate egress port; this slowing factor does not slow the speed at which the to-be egressed data (PdBx) can be shifted into the front-end raceway portion.

Abstract: A method and apparatus for scheduling the data packets transmitted to a plurality of mobile terminals supporting multiple quality of service (QoS) grades in a multichannel wireless communication system includes a storage device for storing queues and data packets of the mobile stations, the queue and data packets of each of the mobile stations being arranged in an order of the quality of service grades; and a scheduler for allocating resources of multiple channels to the mobile stations based on different scheduling metrics separately applied to the multiple channels according to the quality of service grades, each of the scheduling metrics applied to a particular one of channels being used to select one of the mobile stations whose data packets are transmitted through the particular channel; wherein entire data packets of the mobile stations are transmitted through the multiple channels when the allocation of the channel resources has been completed sequentially for each of the multiple channels.

Abstract: Connection ports for interconnecting functional modules in an integrated circuit are described. The connection ports provide enhanced functionality based around a common port primitive. This simplifies port design and selection and also allows a common packet protocol to be used for communication of packets across the packet router. In particular, there is improved functionality of target ports which allow out of order requests to be dealt with and out of order responses to be generated.

Abstract: A system and method of switching packets and/or cells, which includes a switching apparatus having a plurality of input units that receive at least one packet to be transferred by the switching apparatus. A plurality of output units transfer the packet out of the switching apparatus. A switch unit transfers the packet from one of the input units to one of the output units. Each input unit includes at least one input queue that temporarily holds the packet to be transferred by the switching apparatus. Each input unit also includes a respective unicast credit count unit that allows the packet to be transferred out from the queue when a current unicast credit value determined by the unicast credit count unit is at least predetermined value. Each output unit includes at least one output queue that receives the packet as switched by the switch unit, and which is to be transferred out of the switching apparatus.

Abstract: In the dynamic access priority method, priority classes with different backoff delays are used to prioritize random access over shared channels and to reduce collision in the presence of a surge of random access requests. Service class information for a plurality of service classes is stored at user equipment. The service class information for a service class includes at least one of a maximum and a minimum back off value; the maximum back off value being indicative of a maximum back off interval and the minimum back off value being indicative of a minimum back off interval. At least one of a maximum and a minimum back off value is determined based on a selected service class of the user equipment, and a back off interval is determined based on the determined back off value. The back off interval indicates a period of time the user equipment waits before the user equipment attempts a transmission.

Abstract: Methods and systems for identifying communication circuits are disclosed. In particular a communication circuit communicatively couples a first node to a second node. A virtual circuit identification is then obtained based on a first address associated with the first node and a second address associated with the second node. The communication circuit is then identified based on the virtual circuit identification.

Abstract: A buffering structure including at least a first FIFO storage structure to stage at least a selected one of undiverted egress packets and undiverted ingress packets is provided. The buffering structure further includes at least first associated packet drop logic to selectively effectuate head or tail flushes of the first FIFO storage structure. In various embodiments, one or more additional FIFO storage structures are also provided to stage one or more diverted and/or insertion of egress/ingress packets. Those use for staging diverted egress/ingress packets are likewise provided with associated packet drop logic to perform tail flushes of these additional FIFO structures. In one application, the buffering structure is employed by a multi-protocol network processor, which in turn is employed by an optical networking module.

Abstract: This disclosure relates to methods and systems for queuing traffic in packet-switched networks. In one of many possible embodiments, a queue management system includes a plurality of queues and a priority module configured to assign incoming packets to the queues based on priorities associated with the incoming packets. The priority module is further configured to drop at least one of the packets already contained in the queues. The priority module is configured to operate across multiple queues when determining which of the packets contained in the queues to drop. Some embodiments provide for hybrid queue management that considers both classes and priorities of packets.

Abstract: A method for determining a transmission time of collected context information at a sensor node in a communication system that includes a client, at least one sensor node collecting context information, and an access point (AP) forwarding the context information received from the sensor node to the client. The communication system operates in a session layer of protocol layers of open systems interconnection (OSI). The sensor node calculates a transmission period in which the collected context information is transmitted, and randomly determines a transmission time at which the context information is transmitted within the calculated transmission period. Since the collected context information is transmitted at the transmission time randomly determined by the sensor node, the load on the AP can be balanced.

Abstract: According to one embodiment, a first computing device receives a first information packet from a second computing device. The second computing device receives the first information packet from a global computer network through a first router device. The first computing device outputs a second information packet to the global computer network through a second router device, such that the second information packet bypasses the first router device.

Abstract: A buffering structure including at least a first FIFO storage structure to stage at least a selected one of undiverted egress packets and undiverted ingress packets is provided. The buffering structure further includes at least first associated packet drop logic to selectively effectuate head or tail flushes of the first FIFO storage structure. In various embodiments, one or more additional FIFO storage structures are also provided to stage one or more diverted and/or insertion of egress/ingress packets. Those use for staging diverted egress/ingress packets are likewise provided with associated packet drop logic to perform tail flushes of these additional FIFO structures. In one application, the buffering structure is employed by a multi-protocol network processor, which in turn is employed by an optical networking module.

Abstract: Method and system for compressing a data packet is provided. The method includes receiving a data packet; comparing the data packet with content stored in a history module; wherein plural comparisons are performed in parallel; generating a plurality of masks based on the comparisons; comparing the plurality of masks; selecting one of the plurality of masks, based on the mask comparison; and generating a compression record, wherein the compression record includes; size of a data packet, an address field, a mask field and data; and a data packet header includes a control bit indicating if the data packet is compressed.

Abstract: Acknowledgement packets and data packets of multiple streams are reordered for transmission in order to gain good overall utilization of both uploading and downloading links. Durations of various packets in a transmit queue may evaluated to determine whether a later packet in the transmit queue can be transmitted ahead of an earlier packet in the transmit queue. A relative acknowledgement priority parameter for a node effectively tunes the amount of transmit bandwidth available to increase acknowledgment transmissions and therefore increase the node's receive rate from another node.

Abstract: In accordance with at least one embodiment of the present invention, a method and apparatus for scheduling traffic in a communications node is provided. Line cards request communication opportunities from a switch fabric. The switch fabric issues grants for such communication opportunities in response to specific requests. By dynamically adjusting usage of such communication opportunities corresponding to such grants among requests of differing priorities and/or latency criteria, embodiments of the present invention are able to provide increased capacity utilization of switching fabric bandwidth while maximizing adherence to priority requirements and/or latency criteria.

Abstract: At least one cell in a communications system, from a network side, is caused to be stored into a cell buffer bulk memory. Responsive to detecting a predetermined fullness condition of a timeslot memory buffer, a predetermined number of bytes (corresponding to a fraction of the payload of the cell) are caused to be retrieved from the cell buffer bulk memory into the timeslot memory buffer. Responsive to a line-side data requirement, at least one of the predetermined number of bytes is caused to be retrieved from the timeslot memory buffer to a line side. By handling fractions of cells, the amount of dedicated high-speed memory required in prior-art techniques can be significantly reduced.

Abstract: A system provides congestion control in a network device. The system includes multiple queues, a dequeue engine, a drop engine, and an arbiter. The queues temporarily store data. The dequeue engine selects a first one of the queues and dequeues data from the first queue. The drop engine selects a second one of the queues to examine and selectively drop data from the second queue. The arbiter controls selection of the queues by the dequeue engine and the drop engine.

Abstract: A method and system for determining an output port upon which to transmit a packet in a router having a plurality of output ports adapted to be coupled with an adjacent router. In one embodiment, a list is created of output ports that are coupled with the adjacent router, and the list is modified based on network traffic. A port is selected from the list of ports, and the packet is transmitted over the selected port. In one example, the list is modified continuously as a background process based on network traffic. The list may be modified by determining a port which is under-utilized, determining a port which is over-utilized, and substituting in the list one or more instances of the port which is over-utilized with one or more instances of the port which is under-utilized. In this manner, a router can adaptively and evenly distribute the packet transmission traffic over the output ports.

Abstract: The present invention extends to methods, systems, and computer program products for controlling the transfer of terminal server data. In some embodiments, contending request to send terminal server data are resolved by a flow control module situated between a terminal server protocol and a transport/network protocol. The flow control module utilizes channel priorities along with amounts of previously sent data per channel to determine how to distribute bandwidth in a relatively controlled manner between contending channels. The flow control module can be configured to intercept communication between terminal server protocol and a transport/network protocol to facilitate bandwidth distribution. In other embodiments, data is simultaneously sent over multiple channels of terminal server connection. A first write operation obtains a lock on a corresponding channel but the channel lock does not prevent write operations on other channels.

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

Abstract: A bandwidth guaranteeing, BW, process transmits data from a first group of queues to a medium. When none of the queues of the first group wishes to transmit data via the bandwidth guaranteeing process, a weighted fair queuing process is provided for dividing any excess bandwidth between a second group of queues. A mathematically simple WFQ process is described which may be interrupted by the BW process and resumed with the same order etc. between the queues.

Abstract: The present invention provides a priority scheme and a data rate reduction method to increase the reliability of the signaling messages on a shared packet data channel. Signaling messages and packet data received for transmission are stored in a packet data buffer and at least one signaling buffer, respectively. Packet data or signaling messages are transmitted based on the scheduling algorithm assigned priority. The signaling message priorities are adjusted by a weighting factor assigned to the signaling buffer. The signaling message priority may be adjusted by a Quality of Service level. The transmission data rate is adjusted by an offset factor from the highest possible data rate that can be supported to a lower rate to improve reliability. To increase the effective data rate, the signaling message may be concatenated with another signaling message in order to completely fill the signaling message frame.

Abstract: Methods and apparatus are disclosed for simultaneously scheduling multiple priorities of packets, such as in systems having a non-blocking switching fabric. In one implementation, the maximum bandwidth which a particular input can send is identified. During a scheduling cycle, a current bandwidth desired for a first priority of traffic is identified, which leaves the remaining bandwidth available for a second priority of traffic without affecting the bandwidth allocated to the first priority of traffic. By determining these bandwidth amounts at each iteration of a scheduling cycle, multiple priorities of traffic can be simultaneously scheduled. This approach may be used by a wide variety of scheduling approaches, such as, but not limited to using a SLIP algorithm or variant thereof. When used in conjunction with a SLIP algorithm, the current desired bandwidths typically correspond to high and low priority requests.

Abstract: A data network and a method for providing prioritized data movement between endpoints connected by multiple logical channels. Such a data network may include a first node comprising a first plurality of first-in, first-out (FIFO) queues arranged for high priority to low priority data movement operations; and a second node operatively connected to the first node by multiple control and data channels, and comprising a second plurality of FIFO queues arranged in correspondence with the first plurality of FIFO queues for high priority to low priority data movement operations via the multiple control and data channels; wherein an I/O transaction is accomplished by one or more control channels and data channels created between the first node and the second node for moving commands and data for the I/O transaction during the data movement operations, in the order from high priority to low priority.

Abstract: A method for determining and enforcing rate constraints on process flows in a network, the method comprising receiving at least one process flow. A flow rate vulnerability (FRV) factor and a required bandwidth (RBW) parameter are determined for the at least one process flow. A rate constraint is calculated for the at least one process flow and the rate constraint is enforced on the at least one process flow.

Abstract: Apparatus and methods for efficient queuing and dequeuing using segmented output buffers comprising sub-buffers and priority queues. Output buffers are monitored for empty sub-buffers. When a newly empty sub-buffer is discovered, a refill request is enqueued in a ranked priority queue wherein the rank of the destination priority queue is based on the number of empty-sub-buffers in the requesting output buffer. All high priority refill requests are dequeued before lower priority refill requests, thereby reducing the possibility of starvation. Optionally, by using simple dequeuing criteria, such as a FIFO discipline, instead of complex algorithms designed to improve fairness, system resources may be conserved thereby improving system throughput.

Abstract: Disclosed is a device, a computer program and a method to receive and buffer data packets that contain information that is representative of time-ordered content, such as a voice signal, that is intended to be presented to a person in a substantially continuous and substantially uniform temporal sequence; to decode the information to obtain samples and to buffer the samples prior to generating a playout signal. The samples are time scaled as a function of packet network conditions to enable changing the play-out rate to provide a substantially continuous output signal when the data packets are received at a rate that differs from a rate at which the data packets are created. The time scaling operation operates with a base delay that is controlled in a positive sense when the data packets are received at a rate that is slower than a rate at which the data packets are created, and a reserve delay that is managed to provide insurance against an interruption should the base delay become negative.

Abstract: A method for distributing digital subscriber line (xDSL) data traffic includes receiving xDSL traffic at a DSLAM including a plurality of input ports and a plurality of output queues. Each input port includes a plurality of virtual circuits. Each of the plurality of virtual circuits are dynamically assigned to one of the plurality of output queues. The assignment of any particular virtual circuit to one of the plurality of output queues is independent of which of the plurality of input ports the particular virtual circuit is associated with. In accordance with the particular embodiment, the total number of virtual circuits is greater than a total number of output queues.

Abstract: A switch at a transmission end of a system including a number of memory devices defining queues for receiving traffic to be switched, each queue having an associated predetermined priority classification, and a processor for controlling the transmission of traffic from the queues. The processor transmits traffic from the higher priority queues before traffic from lower priority queues. The processor monitors the queues to determine whether traffic has arrived at a queue having a higher priority classification than the queue from which traffic is currently being transmitted. The processor suspends the current transmission after transmission of the current minimum transmittable element if traffic has arrived at a higher priority queue, transmits traffic from the higher priority queue, and then resumes the suspended transmission. At a receiving end, a switch that includes a processor separates the interleaved traffic into output queues for reassembly of individual traffic streams from the data stream.

Abstract: A network device for transmitting data of a host system to a network including a buffer for storing the data, a first transmission interface providing a control signal to the host system, and a second transmission interface coupled to the buffer for transmitting the data from the buffer to the network. A data transmission method of the network device includes the following steps: providing a network device and a host system, wherein the network device is providing a control signal to the host system, and the network device immediately activates a frame transmission procedure after providing the control signal; the host system starting to transmit data to the network device after the host system receives the control signal; and the network device transmitting the data to the network after a frame transmission pre-procedure is finished and when the data of the host system are completely transmitted to the network device.