Fast packet switching

About: Fast packet switching is a research topic. Over the lifetime, 5641 publications have been published within this topic receiving 111603 citations.

Method and apparatus for input rate regulation associated with a packet processing pipeline

Abstract: A method is described that involves presenting packet header information from a packet and packet size information for the packet to a pipeline that comprises multiple stages. One of the stages identifies, with the packet header information, where input flow information for the packet is located. The input flow information is then fetched. The input flow information identifies where input capacity information for the packet is located and the input capacity information is then fetched. Another of the stages compares an input capacity for the packet with the packet's size and indicates whether the packet is conforming or non-conforming based upon the comparison. The input capacity is calculated from the input capacity information.

Lockup detection and recovery in a packet switching network

Abstract: A self-routing packet switching network (100) in which packets are communicated through stages of the network in response to self-contained addresses (Fig. 2) and in which a packet is discarded if a packet cannot be transferred to a subsequent stage of the network within a predefined amount of time. In addition, upon a packet being discarded, a maintenance message is transmitted over a maintenance channel (140) to the processor (149) controlling the network. Each network comprises stages of switching nodes which are responsive to the physical address in a packet to communicate the packet to a designated subsequent node (100-15). The nodes provide for variable packet buffering, packet address rotation techniques, and inter-node and intra-node signaling protocols. Each node comprises a timer (531) which commences timing for a predefined amount of time upon receipt of a packet. If the timer times out, the packet is discarded and a maintenance message is transmitted to the processor controlling the network. The maintenance message includes the physical address plus an address identifying the network entry point of the packet. By discarding packets after a predefined amount of time, the problem of a self-routing network locking up is avoided when one switching node within the network fails or is experiencing overload traffic conditions.

Communication system having a packet structure field

Abstract: A communication system develops an information packet (309) having a packet structure field (G) and at least one message. The message has an address (H) and information (I) associated with the address. A central station (302) accumulates and incorporates the at least one message into the information packet. The central station determines the occurrence of the at least one address and generates identifying data (435) indicating where the address occurs within the information packet. The identifying data is incorporated into the packet structure field and the information packet is transmitted. The information packet is received by at least one selective call receiver (310) capable of operating in a high power mode in order to receive the information packet and a low power mode when receiving is not being performed. The selective call receiver extracts the packet structure field and interprets the identifying data.

Deadlock- and livelock-free packet switching networks

Abstract: A controller for a packet switching network is an algorithm to control the flow of packets through the network. A local controller is a controller executed independently by each node in the network, using only local information available to these nodes. A controller is deadlock- and livelock-free if it guarantees that every packet in the network reaches its destination within a finite amount of time. We present a local controller which is proved to be deadlock- and livelock-free.

Method for performing packet flooding at wireless ad hoc network

Abstract: A method for packet re-flooding in a wireless ad hoc network for transmitting a broadcast packet from a source node to a destination node. In order to determine the respective nodes received with the broadcast packet from the source node into a certain number of power levels in accordance with the receiving power of the signal carrying the received packet, the packet re-flooding method includes the steps of setting a power level reference by which the power level increases as the receiving power increases, obtaining the receiving power of the signal carrying the packet received from the respective nodes but not the source node, determining power levels based on the power level reference and the obtained receiving power, calculating a back-off delay time in accordance with the power levels of the respective nodes but not the source node, and re-flooding the received packet when the calculated back-off delay time of the respective nodes excluding the source node expires and when the received packet is the first packet that is received. Accordingly, the possibility of having collisions due to re-flooding of the respective nodes is reduced, and also, overall power consumption of the network decreases.