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 for assigning optimal packet lengths in a variable rate communication system

Abstract: A method for assigning optimal packet lengths in a variable rate communication system capable of data transmission at one of a plurality of data rates. The packet lengths for the data rates are selected such that the maximum throughput rate is achieved while conforming to a fairness criteria. The fairness criteria can be achieved by restricting the packet length assigned to each data rate to a range of value, or Limin ≤ L?i? ≤ Li?max?. The packet lengths for all data rates are first initialized to the maximum packet lengths for those data rates. Then, for each date rate, a determination is made whether another packet length assignment would result in improved throughput rate. If the answer is yes, the packet length for this data rate is reassigned and the throughput rate with the updates packet length assignments is recomputed. The process is repeated for each data rate until all data rates have been considered. The throughput rate can be calculated using a probabilistic model or a deterministic model.4

Distributed packet switching in arbitrary networks

Abstract: In a seminal paper Leighton, Maggs, and Rao consider the packet scheduling problem when a single packet has to traverse each path. They show that there exists a schedule where each packetreaches its destination in O(C + D) steps, where C’ is the congestion and D is the dilation. The proof relies on the Lovbz Local Lemma, and hence is not algorithmic. In a followup paper Leighton and Maggs use an algorithmic version of the Local Lemma due to Beck to give centralized algorithms for the problem. Leighton, Maggs, and Rao also give a distributed randomized algorithm where all packets reach their destinations with high probability in O(C’ + D log n) steps. In this paper we develop techniques to guarantee the high probability of dehvering packets without resorting to the Lovi$sz Local Lemma. We improve the distributed algorithm for problems with relatively high dilation to O(C) + (log* n)”(iog” ‘JD -t poly(log n). We extend the techniques to handle the case of infinite streams of regularly scheduled packets along every path. Here we measure the congestion on an edge e by the sum of the rates of the packet streams that use the edge, denoted by A(e). We require that for some small constant e > 0, for every edge e, J(e) S 1 – c. In this case we use the parameter R = mw ri, the maximum distance between packets of the same stream, instead of the congestion C above. We notice that max{R, D} is a worst case lower bound on the maximum delay of a packet. We also extend the results to a model of packet traf*Supported in part by the NSF PYI award of $va Tardos. Part of this work was performed while visiting the School of OR&IE at Cornell, and while a postdoctoral fellow at the University of Toronto Computer Science Department. Work at the Technion supported in part by the Ruth and David Moskowitz Academic Lectureship award. t Research supported in part by a Packard Fellowship and ZUI NSF PYI award, by NSF through grant DMS 9505155, and ONR through grant NOO014-961-0050. Permission to make digitel/bard copies of all or pad of this material for personal or classroom use is granted without fee provided that the copies are not made or distributed for profit or conunereial advantage, the copyright notice, the title of the publication and its date appear, and notice is given that copyright is by permission of tie ACM, Inc. To c~y otherwise, to republish, to peat on servers or to redlatribute to lists, requmes specific permission and/or fee. STOC’96, Philadelphia PA, USA @ 1996 ACM 0-89791-785.5/96/05. .$3.50 fic for handling bursty communication. The model is motivated by the new adversarial model suggested by Borodin et al.

Analysis and Optimal Design of a Packet-Voice Receiver

Abstract: The analysis problems arising from a digital packet switched speech network are outlined in a wide statistical environment. The statistical models assumed are discussed with respect to practical applications. Particular attention is devoted to a formal description of the influence of the packet voice receiver on the system behavior in terms of the delay pdf. The optimization of the system performance, in order to obtain the best voice quality, is stated as an optimal control problem, and the analysis results play a central role in the construction of the objective functions. The problem is solved in a particular analytical environment. The outlined analytical results are supported by critical comments on their comparison with practical implementations, allowing the designer a better capability in handling any problems.

Packet error rate in the non-interleaved Rayleigh channel

Abstract: Two analytical methods for determining the packet error rate in the non-interleaved Rayleigh fading channel are presented. The first method is an exact evaluation of the packet error rate, whereas the second method is based on a k-state digital channel model. The fading model is a nonfrequency selective Rayleigh fading with a first-order low pass spectrum for the quadrature fading components. The analytical methods are complemented by simulations. The influence of the fading bandwidth on the packet error rate and the packet throughput is discussed. Block codes as well as convolutional codes are considered. The results show that without forward error correction the throughput for slow fading is higher than for fast fading. With forward error correction the packet error rate is sensitive to the fading bandwidth. Furthermore it is shown that the convolutional code with intra packet interleaving is least sensitive to slow fading. >

Enhanced H-VPLS service architecture using control word

Abstract: The present disclosure is generally directed to systems and methods associated with data communications. In a particular embodiment, a method for use of multi-protocol labels switching (MPLS) encapsulation with control word communicated over a distributed computer network is disclosed. The method includes providing MPLS virtual circuit label with the control word associated with a data packet selected from one of a customer data packet and an OAM data packet, and communicating the MPLS packet with control word and the data packet over the distributed computer network. In another embodiment, a method of handling a data packet within a computer network is disclosed. The data packet is either an unknown unicast, multicast, or broadcast packet. The method includes encapsulating the packet into a multi-packet label switching label and a control word, the control word having a source site identity and a multi-cast identity; and distributing the packet to a plurality of sites within the computer network.