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
06 May 2002
TL;DR: In this paper, a combination of controlled packet queuing and packet flow rate control with appropriate mechanisms for favoring one over the other improves the efficiency of data transmission and improves the overall system performance.
Abstract: Packet flow rate control techniques are enhanced by the interactive and early invocation of packet queuing to control short flows of packets and to eliminate undershoot and overshoot of a targeted flow rate. Packet queuing involves the scheduled release of packets in accordance with flow policies (priorities) to achieve a preselected outgoing target flow rate. The combination of controlled packet queuing and packet flow rate control with appropriate mechanisms for favoring one over the other improves the efficiency of data transmission.

30 citations

Patent
28 Mar 1995
TL;DR: In this article, a packet-based telecommunications architecture is proposed that preserves the sequential order in which packets are presented to the network, but does not require node-by-node call set-up or tear-down, unlike virtual-circuit networks.
Abstract: A packet-based telecommunications architecture is disclosed that, like virtual-circuit networks, preserves the sequential order in which packets are presented to the network, but does not require node-by-node call set-up or tear-down, unlike virtual-circuit networks. Further, the packet switches which compose the architecture can be more simple than those used in datagram or virtual-circuit networks. An illustrative embodiment of the present invention comprises determining the topology of a network of packet switches that are connected by communication links, associating at least two names with at least one of the packet switches, and populating the router tables in the packet switches so that for each name the packet switches and communication links form a elemental network with the topology of a sink tree with the named packet switch at the root of the tree.

30 citations

Patent
Ravi L. Sahita1
15 Jul 2003
TL;DR: In this paper, a controlplane process maintains a dynamic packet rule set, each rule specifying a packet offset, a data pattern to be found at that offset, and an action to be taken if that data pattern is found.
Abstract: Methods and devices for wire-speed packet statistics collection in a network processor are disclosed. A control-plane process maintains a dynamic packet rule set, each rule specifying a packet offset, a data pattern to be found at that offset, and an action to be taken if that data pattern is found. One or more packet processing engines process the packet rule set for incoming packets and take actions such as updating counters in a counter table when a rule evaluates true. The control-plane process can access the counter table to monitor which rules are triggered by packet traffic with what frequency.

30 citations

Journal ArticleDOI
TL;DR: In this paper, the authors present a distributed approach, in which intelligent store-and-forward packet switches are to be installed at various locations on the cable, and the analysis emphasizes three main criteria: the maximum traffic flow, the throughput of each switch and the average message delay.
Abstract: Most of tile present approaches to two-way interactive CATV focus on the centralized approach, in which all traffic must travel to the CATV head end. In this paper, we present a distributed approach, in which intelligent store-and-forward packet switches are to be installed at various locations on the cable. The analysis emphasizes three main criteria: the maximum traffic flow on the cable, the throughput of each switch, and the average message delay. Two possible schemes are compared. In one, the switches appear on the main trunk only. In the second, switches are used at branch locations as well.

30 citations

Journal ArticleDOI
TL;DR: Several problems related to the design of deadlock-free PSN’s are investigated and most of them are shown to be NP-complete or NP-hard, and therefore polynomial-time algorithms are not likely to be found.
Abstract: Deadlocks are very serious system failures and have been observed in existing packet switching networks (PSN’s). Several problems related to the design of deadlock-free PSN’s are investigated here. Polynomial-time algorithms are given for some of these problems, but most of them are shown to be NP-complete or NP-hard, and therefore polynomial-time algorithms are not likely to be found.

30 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