INFOCOM '95. Fourteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Bringing Information to People. Proceedings. IEEE

2-6 April 1995

Go

Filter Results

Displaying Results 1 - 25 of 50
  • Proceedings of INFOCOM'95

    Publication Year: 1995
    Request permission for commercial reuse | PDF file iconPDF (603 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1995
    Request permission for commercial reuse | PDF file iconPDF (214 KB)
    Freely Available from IEEE
  • Distributed channel allocation for PCN with bursty traffic

    Publication Year: 1995, Page(s):113 - 120 vol.1
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB)

    Considers the design of efficient channel allocation algorithms in personal communication networks where the cells have varying traffic loads. A common communication channel is to be dynamically shared between the cells. The authors propose a distributed inter-cell channel allocation policy that is easy to implement through the use of simple signalling between neighboring cells. For cells arranged... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An assigned-buffer ATM switching architecture

    Publication Year: 1995, Page(s):2 - 7 vol.1
    Cited by:  Papers (1)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (436 KB)

    There has been a great technological advancement in microelectronics and communications, which forces, among others, investigations on ATM switching architectures. Researchers keep on searching an efficient architecture, able to perform at a wide range of traffic loads and patterns, ensuring both minimum probability of cell loss as well as minimum cell delay. The authors propose one more architect... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the performance behavior of ATM end-stations

    Publication Year: 1995, Page(s):188 - 196 vol.1
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    Shaping of traffic at its source is a prominent congestion control solution in ATM networks. The “leaky bucket” with a “cell spacer” is a very popular traffic shaping approach. By sizing the leaky bucket and spacer parameters, an end-station shapes its traffic to conform to a “good behavior” contract with the network. The leaky bucket delays the transmission of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal scheduling of soft handoffs in DS/CDMA communication systems

    Publication Year: 1995, Page(s):105 - 112 vol.1
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    Considers the problem of optimal scheduling of soft handoffs as applicable to DS/CDMA based cellular networks. The authors have formulated the phenomenon of soft handoffs as a reward/cost stochastic optimization problem wherein the reward is a function of some measurable characteristics of the received signal, and cost can be associated with different factors such as multiple simultaneous active c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characterization of statistical multiplexing of heterogeneous ATM sources

    Publication Year: 1995, Page(s):345 - 353 vol.1
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    Two asymptotic analyses of the queue length distribution at a statistical multiplexer supporting heterogeneous exponential on-off sources are considered. The first analysis is performed by approximating the cell generation rate as a multidimensional Ornstein-Uhlenbeck process and then applying the Benes queueing formula. In the second analysis, we start with a system of linear equations derived fr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complexity of gradient projection method for optimal routing in data networks

    Publication Year: 1995, Page(s):269 - 277 vol.1
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    Derives a time complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorithm of the Goldstein-Levitin-Poljak type formulated by Bertsekas (1982) converges to within ε in relative accuracy in O(ε2hminNmaxL ) iterations, where NmaxL is the n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of the APIC: A high performance ATM host-network interface chip

    Publication Year: 1995, Page(s):179 - 187 vol.1
    Cited by:  Papers (15)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (904 KB)

    We present the design of a high performance ATM host-network interface for multimedia workstations and servers. At Washington University, as part of an ARPA-sponsored gigabit local ATM testbed, we are building a prototype of this interface that can support a sustained aggregate bidirectional data rate of 2.4 Gbps. The centerpiece of our interface design is a custom chip called the APIC (ATM port i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Topological design of local area networks using genetic algorithms

    Publication Year: 1995, Page(s):64 - 71 vol.1
    Cited by:  Papers (9)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB)

    Continually growing number of users have to exchange increasing amounts of information. Local area networks (LANs) are commonly used as the communication infrastructure that meets the demands of the users in the local environment. These networks typically consist of several LAN segments connected together via bridges. The authors describe an algorithm for designing LANs with the objective of minim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast simulation of a voice-data multiplexer

    Publication Year: 1995, Page(s):361 - 368 vol.1
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    This paper considers the problem of estimating, via simulation, extremely low packet loss rates in a voice-data multiplexer. The multiplexer gives priority to voice packets, unless the data queue length exceeds a threshold. To efficiently simulate such low loss rates requires the proper use of importance sampling. In this paper we describe an importance sampling technique that is guaranteed to pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Least cost routing in multi-service networks. II

    Publication Year: 1995, Page(s):289 - 296 vol.1
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    In Part I, we proposed a distributed, state dependent, dynamic routing method, called least cost routing in multi-service networks (LCRM), for multirate circuit-switched broadband ISDN networks, which support a variety of traffic classes with different characteristics. This method represents the one-step policy improvement on a chosen base policy. As a base policy π0, we use the poli... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive holding policies for IP over ATM networks

    Publication Year: 1995, Page(s):80 - 87 vol.1
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    Next generation wide area networks will be connection-oriented, with data-link layer connectivity being provided by asynchronous transfer mode (ATM). For the huge existing investment in current IP networks such as the Internet to remain useful, one must devise mechanisms to carry IP traffic over ATM networks. A fundamental issue is to devise holding policies for virtual circuits carrying datagrams... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A source-based algorithm for delay-constrained minimum-cost multicasting

    Publication Year: 1995, Page(s):377 - 385 vol.1
    Cited by:  Papers (76)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    A new heuristic algorithm is presented for constructing minimum-cost multicast trees with delay constraints. The new algorithm can set variable delay bounds on destinations and handles two variants of the network cost optimization goal: one minimizing the total cost (total bandwidth utilization) of the tree, and another minimizing the maximal link cost (the most congested link). Instead of the sin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation of self-healing function in ATM networks based on virtual path concept

    Publication Year: 1995, Page(s):303 - 311 vol.1
    Cited by:  Papers (13)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (844 KB)

    This paper proposes an implementation scheme for the self-healing function in ATM networks and assesses its performance. First, our proposed ATM self-healing scheme is described. This scheme realizes more rapid restoration of failed virtual paths than other self-healing algorithms, supports the node failure case, and minimizes the spare resources required. Next, an implementation scheme is propose... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Radio link admission algorithms for wireless networks with power control and active link quality protection

    Publication Year: 1995, Page(s):97 - 104 vol.1
    Cited by:  Papers (115)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    Presents a distributed power control scheme, which maintains the signal/interference ratios (SIRs) of operational (active) links above their required thresholds at all times (link quality protection), while new users are being admitted; furthermore, when new users cannot be successfully admitted, existing ones do not suffer fluctuations of their SIRs below their required thresholds values. The aut... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A general packet replication scheme for multicasting in interconnection networks

    Publication Year: 1995, Page(s):394 - 401 vol.1
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (692 KB)

    Multicasting in broadband packet switches and metropolitan networks can be achieved by first replicating the packets and then routing them to their destinations. This paper studies a very simple but general replication scheme that can be applied to arbitrary interconnection-network topologies. The replication process of a packet adapts itself according to the network topology and the traffic condi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiservice call blocking approximations for virtual path based ATM networks with CBR and VBR traffic

    Publication Year: 1995, Page(s):321 - 329 vol.1
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (732 KB)

    The exact calculation of call blocking probabilities for multiservice ATM networks with alternate or adaptive routing for virtual channels (VC) is hardly possible. Therefore the paper presents and investigates the equivalent single path model as an approximation to omit the VC routing algorithm in the calculation. The model can be applied to ATM networks with several direct virtual path connection... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The distribution of delays of dispersed messages in an M/M/1 queue

    Publication Year: 1995, Page(s):338 - 344 vol.1
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB)

    We analyze the distribution of the delay of messages in an infinite capacity M/M/1 queue. A message is composed of n packets, and the arrival of the packets to the queue is Poisson. Our calculations are based on recursive schemes. We obtain explicit expressions for the Laplace-Stieltjes transform (LST) of the delays, which enables to obtain exact expressions for the moments of the delay in a compl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error control for messaging applications in a wireless environment

    Publication Year: 1995, Page(s):261 - 268 vol.1
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    The paper investigates error control mechanisms for mobile messaging applications, such as e-mail, fax, and credit card verification. Although existing protocols provide efficient error control over conventional networks, wireless networks present significant new challenges. The radio link introduces noise and multipath interference causing long periods of increased error rate, while host motion r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Receiver-oriented adaptive buffer allocation in credit-based flow control for ATM networks

    Publication Year: 1995, Page(s):239 - 252 vol.1
    Cited by:  Papers (30)  |  Patents (50)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1020 KB)

    In credit-based flow control for ATM networks, a buffer is first allocated to each VC (virtual circuit) and then credit control is applied to the VC for avoiding possible buffer overflow. Receiver-oriented, adaptive buffer allocation allows a receiver to allocate its buffer dynamically, to VCs from multiple upstream nodes based on their bandwidth usage. The paper describes, in detail, such an adap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient computation of end-to-end performance measures for multi-link ATM networks with multi-media traffic

    Publication Year: 1995, Page(s):170 - 178 vol.1
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB)

    In this paper, we provide: (a) An efficient method for simplifying MMPP source models, which can be used to solve multi-media queueing problems with complicated aggregate input traffic. The effectiveness of the method is verified through numerical examples. (b) An approximation algorithm for analyzing multi-link queueing networks with MMPP traffic sources and arbitrary configurations. In this algo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sensing the state of voice sources to improve multiplexer performance

    Publication Year: 1995, Page(s):56 - 63 vol.1
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1596 KB)

    The control of source-coded traffic at a multiplexer has been a topic of extensive research. Traditional approaches typically use feedback information on the buffer level in designing the control policy. While important, buffer levels capture only part of the information about the overall system state. By setting up this problem as a Markov decision process, the authors show that using information... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mobile radio slotted ALOHA with capture and diversity

    Publication Year: 1995, Page(s):121 - 128 vol.1
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    The slotted ALOHA protocol in a mobile radio environment, in the presence of Ricean fading, twofold antenna diversity and multiple reception capability, is considered. The capture probabilities and the average throughput are computed, and the issue of stability is addressed. It is shown that diversity can improve the system performance, although only to a certain extent. Some extensions are also c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Queueing analysis for shared buffer switching networks for non-uniform traffic

    Publication Year: 1995, Page(s):8 - 15 vol.1
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    Uniform traffic does not represent a realistic view of traffic patterns in real systems. Non-uniform traffic models better reflect the traffic patterns that need to be accommodated. Such traffic may cause the network performance to deteriorate to much lower levels than the ones predicted by uniform traffic analysis. The authors extend the queueing analysis for buffered networks by providing method... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.