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 published on a yearly basis
Papers
More filters
••
TL;DR: A novel Markov model is constructed to calculate the packet loss probability and the delay distribution of real-time wireless packets and it is found that the packet Loss probability is significantly affected by the delay limit and the transition probability of the channel's remaining in the failure state.
Abstract: A novel Markov model is constructed to calculate the packet loss probability and the delay distribution of real-time wireless packets. These packets are transmitted through an erroneous channel modeled by a two-state Markov chain. If a packet transmission is not successful, the packet is retransmitted until a delay limit is exceeded. At that time, the packet is discarded and the transmission of the next packet begins. This packet-dropping process has a significant impact on packet loss probability but is seldom considered in other Markov models. Closed-form solutions are obtained, and simplified expressions assuming highly correlated errors and small error probability are derived. Under these conditions, it is found that the packet loss probability is significantly affected by the delay limit and the transition probability of the channel's remaining in the failure state. On the other hand, the probability is almost independent of the arrival rate provided the rate is not close to one.
49 citations
•
28 Mar 2000
TL;DR: In this paper, a switching and data packet forwarding method combining the advantages of both synchronous and asynchronous data packet switching modes is proposed, which is called fractional lambda switching (FLSW).
Abstract: A switching method is designed to operate with very high-speed wavelength division multiplexing (WDM) links, i.e., with multiple lambdas. The switching and data packet forwarding method combines the advantages of both synchronous and asynchronous data packet switching modes. In the synchronous switching mode, a time frame switching method based on predefined switching schedules that are responsive to a global common time reference, where the global common time reference is divided into a plurality of contiguous periodic super cycles, time cycles and time frames. The plurality of data packets contained in each of the time frames can be switched from any incoming WDM channel to any subset of outgoing WDM channels. The outcome of this switching method is called fractional lambda switching. For the asynchronous switching mode data packets that do not need guaranteed performance are separated from flows of data packets that require a deterministic service. The asynchronous data packets are routed according to header information and then combined back into the optical WDM channels.
49 citations
•
13 Dec 1994
TL;DR: In this paper, a set of security rules are defined in a high level form and translated into a packet filter code, which is loaded into packet filter modules located in strategic points in the network.
Abstract: A filter module allows controlling network security by specifying security rules for traffic in the network and accepting or dropping communication packets according to these security rules. A set of security rules are defined in a high level form and are translated into a packet filter code. The packet filter code is loaded into packet filter modules located in strategic points in the network. Each packet transmitted or received at these locations is inspected by performing the instructions in the packet filter code. The result of the packet filter code operation decides whether to accept (pass) or reject (drop) the packet, disallowing the communication attempt.
49 citations
••
28 May 1990TL;DR: A congestion avoidance and control scheme that monitors the incoming traffic to each destination and provides rate-based feedback information to the sources of bursty traffic so that sources of traffic can adjust their packet rates to match the network capacity is described.
Abstract: A congestion avoidance and control scheme that monitors the incoming traffic to each destination and provides rate-based feedback information to the sources of bursty traffic so that sources of traffic can adjust their packet rates to match the network capacity is described. The congestion avoidance mechanism at nodes on the periphery of the network controls incoming traffic so that it does not exceed the capacity of paths to different destinations. The congestion control mechanism at each node monitors the performance of adjacent links and generates rate control messages that warn the sources of traffic before congestion develops. Some existing schemes are reviewed, and the congestion avoidance and control scheme and its applicability to various transport protocols are discussed. Experiments show that the scheme is effective in preventing congestion inside the network and that it manages to restrict the traffic on any overloaded path to 80%-90% of its capacity. >
49 citations
•
NEC1
TL;DR: In this article, a method of transmitting an IP packet between a source and a destination through an ATM network which has a node formed by an ATM switch and a packet router is presented.
Abstract: In a method of transmitting an IP packet between a source and a destination through an ATM network which has a node formed by an ATM switch and a packet router, a reception packet or cell is transmitted to the node on an unused or undefined VC and is sent to the packet router in the node. In the packet router, an output port is selected by the use of the unused VC to establish a switched virtual channel in the ATM switch and to transfer each packet through the switched virtual channel after the switched virtual channel is established, as long as the reception packet is sent on the same VCI. Neither signaling nor protocol is needed between the nodes.
49 citations