scispace - formally typeset
Search or ask a question
Topic

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.


Papers
More filters
Patent
Jacob J. Schroeder1
22 Mar 2002
TL;DR: In this paper, a padding module is added to uneven packet fragments of a packet, a partial checksum generator module is used to generate a partial error control value for each packet fragment, and a pseudo-header generator is used for generating a pseudo header for the packet.
Abstract: Embodiments to perform improved error control using packet fragments are described. The apparatus may include a padding module to add a pad byte to uneven packet fragments of a packet, a partial checksum generator module to generate a partial error control value for each packet fragment, a pseudo-header generator module to generate a pseudo header for the packet, and a partial checksum combiner module to combine the partial error control values into an error control value. Other embodiments are described and claimed.

48 citations

Patent
28 Mar 2000
TL;DR: In this paper, a global common time reference is used to enable pre-computed switching schedules from an input port to an output port, thereby, expediting switching and increasing the performance and scalability of the switching system.
Abstract: An input buffer switch scheduling method operates responsively to a global common time reference. The global time reference is used to enable pre-computed switching schedules from an input port to an output port, thereby, expediting switching and increasing the performance and scalability of the switching system. In the switch architecture disclosed in this invention the switching fabric operates according to predefined switching schedules. The switch decodes the data packet headers in order to determine the destination output port and the switching time responsive to the global common time reference. This decoded switching time is then used by the pre-defined switching schedules in order to switch the data packet from the input port to the output port. The usage of predefined switching schedules provides scalability to the design of high performance input buffer switch design.

48 citations

Patent
28 Sep 1995
TL;DR: In this paper, a method for setting up virtual connections in packet switching networks is disclosed wherein a virtual connection within a second packet switching network is used to maintain or create virtual connection between subscriber equipment.
Abstract: A method for setting up virtual connections in packet switching networks is disclosed wherein a virtual connection within a second packet switching network is used to maintain or create a virtual connection between subscriber equipment in a first packet switching network. The first packet switching network employs the signaling protocol of the second packet switching network when initiating the second virtual connection so that it is not necessary for the second packet switching network to recognize a specific signaling protocol.

48 citations

Patent
Labonte Sylvain1, Eric Turcotte1
03 Feb 1998
TL;DR: In this article, a D-AMPS+ cellular communications air interface (50) is presented wherein a packet data control channel (40, 60) and packet data traffic channel (42, 62) are supported in addition to the conventional digital control channel and digital traffic channel.
Abstract: A D-AMPS+ cellular communications air interface (50) is presented wherein a packet data control channel (40, 60) and packet data traffic channel (42, 62) are supported in addition to the conventional digital control channel (20) and digital traffic channel (22, 64). In particular, the packet data control channel and packet data traffic channel support multiple modulation level operation (high versus low). Procedures are provided for mobile station selection, as well as re-selection (102, 110), of either the high or low-level modulation for the packet channels. Procedures are further provided for facilitating a fall-forward (158, 164, 190, 194) to the high-level modulation packet data control channel, or a fall-backward (222, 232, 254) to the low-level modulation packet data control channel with respect to both uplink and downling packet data communications.

47 citations

Proceedings ArticleDOI
20 Oct 2010
TL;DR: The packet header overhead incurred by PR is very small, and the extra memory and packet processing time required to implement it at each router are insignificant, which makes PR suitable for loss-sensitive, mission-critical network applications.
Abstract: This paper presents Packet Re-cycling (PR), a technique that takes advantage of cellular graph embeddings to reroute packets that would otherwise be dropped in case of link or node failures. The technique employs only one bit in the packet header to cover any single link failures, and in the order of log2(d) bits to cover all non-disconnecting failure combinations, where d is the diameter of the network. We show that our routing strategy is effective and that its path length stretch is acceptable for realistic topologies. The packet header overhead incurred by PR is very small, and the extra memory and packet processing time required to implement it at each router are insignificant. This makes PR suitable for loss-sensitive, mission-critical network applications.

47 citations


Network Information
Related Topics (5)
Network packet
159.7K papers, 2.2M citations
88% related
Wireless network
122.5K papers, 2.1M citations
87% related
Wireless
133.4K papers, 1.9M citations
87% related
Wireless sensor network
142K papers, 2.4M citations
85% related
Wireless ad hoc network
49K papers, 1.1M citations
84% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20222
20191
20186
201749
201699
2015159