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
  • 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 (28)  |  Patents (48)
    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.
  • On simple algorithms for dynamic load balancing

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

    The paper focuses on the dynamic resource allocation problem. In communication networks such as wireless or circuit switching networks, resources correspond to base stations or links, and the load corresponds to the calls in the network. The principle of load balancing is examined for dynamic resource allocation. The question of interest is the performance of simple allocation strategies which can... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generalized non-preemptive priority queue

    Publication Year: 1995, Page(s):354 - 360 vol.1
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB)

    In this paper, we analyze a generalized non-preemptive queue with two priority classes. When the server serves the low priority queue, up to l customers are served before the server returns to the high priority queue. We study the embedded Markov chain at departure epochs and obtain the transforms of the queue-length and sojourn-time distributions. From these transforms, it is easy to find the mom... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and analysis of a credit-based controller for congestion control in B-ISDN/ATM networks

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

    A credit-based controller (CBC), which has a provision for cell tagging, is proposed for usage parameter control (UPC). Similar in concept to the leaky bucket, the CBC has a credit counter and a data buffer. Credits are accumulated at a rate initiated from the network (equivalent to the sustainable cell rate), and depleted at a rate pertaining to the network traffic load. A source has the prerogat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ATMTraP: an asynchronous transfer mode traffic and performance measurement tool

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

    The analysis and development of ATM network traffic control algorithms is often performed using theoretical traffic models. Algorithms for traffic shaping, policing, flow control, and switch architectures have been proposed based on these models. While the models help to obtain preliminary solutions, the success and validity of the proposed algorithm will be a function of how close the assumed mod... 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.
  • The converging flows problem: an analytical study

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

    When multiple systems are interconnected through a high-speed backbone network and communicate without resource reservation, under certain conditions a severe overload can appear at the destination system. This problem, called the converging flows problem, can be alleviated by use of a feedback control mechanism that coordinates the emission of the sources. The authors present a dynamic resource m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient scheduling of nonuniform packet traffic in a WDM/TDM local lightwave network with arbitrary transceiver tuning latencies

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

    A passive-star-based, broadcast-and-select, local lightwave network which can support a limited number of WDM channels (on the order of ten), but serve a much larger number of nodes (a few tens or hundreds), is considered. Each node is equipped with one tunable transmitter and one fixed receiver, and each WDM channel is operated in a TDM fashion for carrying packet traffic. Bandwidth is allocated ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spanning tree method for link state aggregation in large communication networks

    Publication Year: 1995, Page(s):297 - 302 vol.1
    Cited by:  Papers (52)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    We consider a communication network in which dynamic routing is used for establishing connections that support information transfer between end-users. Link state information is exchanged and maintained up-to-date among network nodes for path computation and network resource allocation. When the population of users is large, the amount of link state information can be overwhelming. A common solutio... 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.
  • An optimal establishment of virtual path connections for ATM networks

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

    A number of optimization models for the establishment of virtual path connections (VPCs) with reserved capacity have been proposed in the literature. All of them, however, failed to reflect the trade-off between increased capacity costs and reduced control costs explicitly in their formulations. the present authors develop a mathematical formulation for an optimal strategy for the reservation of c... 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.
  • Comparison of dynamic multicast routing algorithms for wide-area packet switched (asynchronous transfer mode) networks

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

    This paper compares three dynamic multipoint routing algorithms for wide-area packet switched networks like asynchronous transfer mode (ATM) networks. The three algorithms compared are the greedy algorithm, the source rooted shortest path (SP) algorithm and the geographic spread dynamic multicast (GSDM) routing algorithm. We present simulation results over random graphs that demonstrate the perfor... 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.
  • Optimal buffer sharing

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

    Addresses the problem of designing optimal buffer management policies in shared memory switches when packets already accepted in the switch can be dropped (pushed-out). The goal is to maximize the overall throughput, or equivalently to minimize the overall loss probability in the system. For a system with two output ports, the authors prove that the optimal policy is of pushout with threshold type... 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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 (112)  |  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.
  • Performance analysis of mean internodal distance of connective semi-random networks

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

    One of important properties of a multihop network is the mean internodal distance for evaluating transmission delay. The connective semi-random network achieves a smaller mean internodal distance than other networks. However, the results have only been obtained by computer simulation and no theoretical analysis has been performed. In this paper, we theoretically analyze the mean internodal distanc... View full abstract»

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