By Topic

INFOCOM '98. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE

March 29 1998-April 2 1998

Go

Filter Results

Displaying Results 1 - 25 of 65
  • IEEE INFOCOM '98 The Conference on Computer Communications [front matter]

    Publication Year: 1998, Page(s):i - xxviii
    Request permission for commercial reuse | PDF file iconPDF (775 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1998, Page(s):0_6 - 0_8
    Request permission for commercial reuse | PDF file iconPDF (173 KB)
    Freely Available from IEEE
  • A scalable control topology for multicast communications

    Publication Year: 1998, Page(s):1197 - 1204 vol.3
    Cited by:  Papers (12)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    Large-scale multicast applications for the Internet require the availability of multicast protocols that enhance the basic connectionless IP multicast service. A critical requirement of such protocols in their ability to support a large group of simultaneous users. In this paper, we present a new approach for distributing control information within a multicast group. The goal of our approach is to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparison of server-based and receiver-based local recovery approaches for scalable reliable multicast

    Publication Year: 1998, Page(s):988 - 995 vol.3
    Cited by:  Papers (24)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    Local recovery approaches for reliable multicast have the potential to provide significant performance gains in terms of reduced bandwidth and delay, and higher system throughput. In this paper we examine two local recovery approaches-one server-based, and the other receiver-based, and compare their performance. The server-based approach makes use of specially designated hosts, called repair serve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Per-stream jitter analysis in CBR ATM multiplexors

    Publication Year: 1998, Page(s):1325 - 1332 vol.3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    Constant bit rate (CBR) traffic is expected to be a major source of traffic in high-speed networks. Such sources may have stringent delay and loss requirements and in many cases, they should be delivered exactly as they were generated. A simple delay priority scheme will bound the cell delay and jitter for CBR streams, so that in the network switches, CBR traffic will only compete with other CBR t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of a hybrid priority control scheme for input and output queueing ATM switches

    Publication Year: 1998, Page(s):1470 - 1477 vol.3
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB)

    In this paper, we consider a nonblocking ATM switch with capacity C which adopts a hybrid priority control scheme in input buffers. Each input queue has two separate buffer spaces with different sizes for two classes of traffic, and adopts a general state-dependent scheduling scheme which assigns priorities to each class dynamically. We obtain the distribution of input queue length, loss probabili... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An error control scheme for large-scale multicast applications

    Publication Year: 1998, Page(s):1188 - 1196 vol.3
    Cited by:  Papers (58)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (976 KB)

    Retransmission based error control for large scale multicast applications is difficult because of implosion and exposure. Existing schemes (SRM, RMTP, TMTP LBRRM) have good solutions to implosion, but only approximate solutions to exposure. We present a scheme that achieves finer grain fault recovery by exploiting new forwarding services that allow us to create a dynamic hierarchy of receivers. We... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Converging to approximated max-min flow fairness in logarithmic time

    Publication Year: 1998, Page(s):1350 - 1357 vol.3
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    Max-min is a frequently praised criterion for flow control despite its limitations. In practice, the fast rate of changes in the connection layout in modern networks makes it hard for any flow control algorithm to converge to an optimal point. In such an environment, it might be better to trade accuracy with speed. We present algorithms that relax the optimality criterion of the max-min flow fairn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal packing of group multicastings

    Publication Year: 1998, Page(s):980 - 987 vol.3
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    This paper presents algorithms, heuristics and lower bounds addressing optimization issues in many-to-many multicasting. Two main problems are addressed: (1) a precise combinatorial comparison of optimal multicast trees with optimal multicast rings, (2) an optimized sharing of network resources (i.e., nodes and links) among multiple multicast groups that coexist. The former is central to the choic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive control mechanism for cable modem MAC protocols

    Publication Year: 1998, Page(s):1392 - 1399 vol.3
    Cited by:  Papers (14)  |  Patents (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (968 KB)

    Cable plants were initially designed for one-way broadcast of analog television signals (from the head-end to the neighborhood). They are now being upgraded to provide an upstream path (from the home to the head-end). New challenges arise in using the upstream channel since the available bandwidth is low and the noise levels are high. Different variations of the reservation Aloha protocol have bee... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the impact of long-range-dependent traffic in dimensioning ATM network buffer

    Publication Year: 1998, Page(s):1317 - 1324 vol.3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    Recent measurements of packet networks have shown that packet traffic exhibits long-range-dependent property. Studies have also discovered that this property is not adequately captured by the conventional Markov traffic models and often yields queueing behavior such as heavy-tailed or subexponential queue length distribution. These findings have led to the implication that long-range-dependent tra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SAVE: an algorithm for smoothed adaptive video over explicit rate networks

    Publication Year: 1998, Page(s):1093 - 1102 vol.3
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1236 KB)

    Supporting compressed video efficiently on networks is a challenge because of its burstiness. Although a large number of applications using compressed video are rate adaptive, it is also important to preserve quality as much as possible. We propose a smoothing and rate adaptation algorithm, called SAVE, that the compressed video source uses in conjunction with explicit rate based control in the ne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Long-tailed loss rates in a single server queue

    Publication Year: 1998, Page(s):1462 - 1469 vol.3
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    In this paper we have considered several queueing systems with finite buffers and long-tailed arrivals. For these queueing systems we have derived explicit asymptotic formulas for approximating loss rates. The accuracy of the suggested approximate formulas is demonstrated on various numerical and simulation experiments. Overall, we expect that these approximate expressions, both for reasons of the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The network effects of prefetching

    Publication Year: 1998, Page(s):1232 - 1239 vol.3
    Cited by:  Papers (42)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (932 KB)

    Prefetching has been shown to be an effective technique for reducing user perceived latency in distributed systems. In this paper we show that even when prefetching adds no extra traffic to the network, it can have serious negative performance effects. Straightforward approaches to prefetching increase the burstiness of individual sources, leading to increased average queue sizes in network switch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic flow switching. A new communication service for ATM networks

    Publication Year: 1998, Page(s):955 - 963 vol.3
    Cited by:  Papers (2)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1564 KB)

    This paper presents a new communication service for ATM networks that provides one-way, adjustable rate, on-demand communication channels. The proposed dynamic flow service is designed to operate within a multi-service cell switched network that supports both conventional switched virtual circuits and IP packet routing and is designed to complement those services. It is particularly well suited to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An end-to-end reliable multicast protocol using polling for scaleability

    Publication Year: 1998, Page(s):1180 - 1187 vol.3
    Cited by:  Papers (7)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (948 KB)

    Reliable sender-based one-to-many protocols do not scale well due mainly to implosion caused by the excessive rate of feedback packets arriving from receivers. We show that this problem can be circumvented by making the sender poll the receivers at carefully planned timing instants, so that the arrival rate of feedback packets is not large enough to cause implosion. We describe a generic end-to-en... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of ERICA and QFC for transporting bursty TCP sources with bursty interfering traffic

    Publication Year: 1998, Page(s):1341 - 1349 vol.3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (868 KB)

    In ATM networks, the available bit rate (ABR) service enables data sources to efficiently utilize network resources without adversely affecting the performance of non-ABR, guaranteed traffic such as video. Most research to date on ABR performance has not used realistic assumptions. Unrealistic assumptions such as persistent data sources, an absence of non-ABR traffic, and inaccurate TCP models may... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generalized max-min rate allocation policy and its distributed implementation using the ABR flow control mechanism

    Publication Year: 1998, Page(s):1366 - 1375 vol.3
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (804 KB)

    We generalize the classical max-min rate allocation policy with the support of the minimum rate requirement and peak rate constraint for each connection. Since a centralized algorithm for the generalized max-min (GMM) rate allocation requires global information, which is difficult to maintain and manage in a large network, we develop a distributed protocol to achieve the GMM policy using the avail... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How bad is reliable multicast without local recovery?

    Publication Year: 1998, Page(s):972 - 979 vol.3
    Cited by:  Papers (29)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB)

    We examine the impact of the loss recovery mechanisms on the performance of a reliable multicast protocol. Approaches to reliable multicast can be divided into two major classes: source-based recovery, and distributed recovery. For both classes we consider the state of the art: for source-based recovery, a type 2 hybrid ARQ scheme with parity retransmission; for distributed recovery, a scheme with... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation of priority and scheduling schemes for an IEEE 802.14 MAC protocol loaded by real traffic

    Publication Year: 1998, Page(s):1384 - 1391 vol.3
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    We study a new scheme for provision of priorities within the framework of a MAC protocol which is a potential candidate of the (as yet unpublished) IEEE 802.14 standard. A comprehensive simulation study, based on real traffic traces, shows that this new method provides better protection for the high priority traffic than an earlier proposed scheme. Except for physical and MAC layer overheads, the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sizing exit buffers in ATM networks under CBR traffic

    Publication Year: 1998, Page(s):1309 - 1316 vol.3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    This paper deals with the sizing of end buffers in ATM networks for sessions subject to constant bit rate (CBR) traffic. Our objective is to predict the cell loss rate at the end buffer as a function of the system parameters. We introduce the D+G/D/1 queue as a generic model to represent exit buffers in telecommunications networks under constant rate traffic and use it to model the end buffer. Thi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling fast fading channel dynamics for packet data performance analysis

    Publication Year: 1998, Page(s):1292 - 1300 vol.3
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (868 KB)

    The fast fading channel modeling traditionally focuses on physical-level dynamics such as signal strength and bit error rate. We characterize fast fading channel dynamics at the packet-level and analyze the corresponding data queueing performance in various environments. The integration of wireless channel modeling and data queueing analysis provides us a unique way to capture important channel st... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • End-to-end delay of videoconferencing over packet switched networks

    Publication Year: 1998, Page(s):1084 - 1092 vol.3
    Cited by:  Papers (3)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (988 KB)

    Videoconferencing is an important global application -it enables people around the globe to interact when they are far from one another. In order for the participants in a video-conference call to interact naturally, the end-to-end delay should be below human perception-about 100 ms. Since the global propagation delay can be about 100 ms, the actual end-to-end delay budget available to the system ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On wireless spectrum estimation and generalized graph coloring

    Publication Year: 1998, Page(s):1273 - 1283 vol.3
    Cited by:  Papers (11)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1184 KB)

    We address the problem of estimating the spectrum required in a wireless network for a given demand and interference pattern. This problem can be abstracted as a generalization of the graph coloring problem, which typically presents additional degree of hardness compared to the standard coloring problem. It is worthwhile to note that the question of estimating the spectrum requirement differs mark... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Layered video multicast with retransmissions (LVMR): evaluation of hierarchical rate control

    Publication Year: 1998, Page(s):1062 - 1072 vol.3
    Cited by:  Papers (87)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1148 KB)

    Layered video multicast with retransmissions (LVMR) is a system for distributing video using layered coding over the Internet. The two key contributions of the system are: (1) improving the quality of reception within each layer by retransmitting lost packets given an upper bound on recovery time and applying an adaptive playback point scheme to help achieve more successful retransmission, and (2)... View full abstract»

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