By Topic

INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE

Date 21-25 March 1999

Go

Filter Results

Displaying Results 1 - 25 of 69
  • Proceedings The Conference On Computer Communications Volume 3 Eighteenth Annual Joint Conference Of The IEEE Computer And Communications Societies The Future Is Now [front matter]

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

    Publication Year: 1999, Page(s):1585 - 1587
    Request permission for commercial reuse | PDF file iconPDF (169 KB)
    Freely Available from IEEE
  • Efficient bandwidth allocation and call admission control for VBR service using UPC parameters

    Publication Year: 1999, Page(s):1044 - 1052 vol.3
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    Provision of quality-of-service (QoS) guarantees is an important and challenging issue in the design of asynchronous transfer mode (ATM) networks. call admission control (CAC) is an integral part of the challenge and is closely related to other aspects of network designs such as traffic characterization and QoS specification. Since the usage parameter control (UPC) parameters are the only standard... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Predictive distance-based mobility management for PCS networks

    Publication Year: 1999, Page(s):1377 - 1384 vol.3
    Cited by:  Papers (180)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    This paper presents a mobile tracking scheme that exploits the predictability of user mobility patterns in wireless PCS networks. Instead of the constant velocity fluid-flow or the random-walk mobility model, a more realistic Gauss-Markov model is introduced, where a mobile's velocity is correlated in time to a various degree. Based on the Gauss-Markov model, a mobile's future location is predicte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bandwidth modelling for network-aware applications

    Publication Year: 1999, Page(s):1300 - 1309 vol.3
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (940 KB)

    Network-aware applications attempt to adjust their resource demands in response to changes in resource availability, e.g., if a server maintains a connection to a client, the server may want to adjust the amount of data sent to the client based on the effective bandwidth realized for the connection. Information about current and future network performance is therefore crucial for an adaptive appli... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of a priority based ATM multiplexer with correlated arrivals

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

    We consider the performance analysis of an ATM multiplexer supporting both delay sensitive (e.g. silence detected voice) and loss sensitive (e,g. data) traffic flows. The delay sensitive cells are stored in a finite (relatively small) buffer and are given service priority over loss sensitive cells in each slot. In our formulation, we allow both classes to have a general (Markovian) correlation str... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A reduced complexity decoding scheme for wireless applications

    Publication Year: 1999, Page(s):1372 - 1376 vol.3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB)

    Cellular transmission standards such as GSM and IS-54 produce data streams with varying degrees of significance at the source encoder level. We propose an unequal error protection scheme based on a non-uniform signal set which provides the more important data with a preferential Euclidean distance. The unequal error protection is partly accomplished by the modulator in contrast to the conventional... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High-performance IP routing table lookup using CPU caching

    Publication Year: 1999, Page(s):1421 - 1428 vol.3
    Cited by:  Papers (51)  |  Patents (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB)

    Wire-speed IP (Internet Protocol) routers require very fast routing table lookup for incoming IP packets. The routing table lookup operation is time consuming because the part of an IP address used in the lookup, i.e., the network address portion, is variable in length. This paper describes the routing table lookup algorithm used in a cluster-based parallel IP router project called Suez. The innov... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Globally progressive interactive web delivery

    Publication Year: 1999, Page(s):1291 - 1299 vol.3
    Cited by:  Papers (1)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    This paper suggests that since web browsing is an interactive process and downloading a web page can take several seconds to several minutes over slow links, the information presented to the user during this time is important. We present new metrics and visualization techniques to illustrate and quantify web page loading. Given the insight afforded by the metrics, we propose a methodology to impro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stochastic bounds on delays of fair queueing algorithms

    Publication Year: 1999, Page(s):1212 - 1219 vol.3
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (848 KB)

    We study the delay characteristics of fair queueing algorithms with a stochastic comparison approach. In integrated services networks, fair queueing (FQ) policies have received much attention, because they can guarantee an end-to-end session delay bound when the burstiness of the session traffic is bounded, and they ensure the fair allocation of the bandwidth. A large class of FQ policies attempt ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A time-scale decomposition approach to measurement-based admission control

    Publication Year: 1999, Page(s):1539 - 1547 vol.3
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (888 KB)

    We propose a time-scale decomposition approach to measurement-based admission control (MBAC). We identify a critical time-scale T˜h such that: (1) aggregate traffic fluctuation slower than T˜h can be tracked by the admission controller and compensated for by flow admissions and departures; (2) fluctuations faster than T˜h have to be absorbed by re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A framework for design and evaluation of admission control algorithms in multi-service mobile networks

    Publication Year: 1999, Page(s):1027 - 1035 vol.3
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (772 KB)

    Supporting quality of service (QoS) guarantees in wireless networks requires that admission control algorithms incorporate user mobility, and limit the probability that sufficient resources are unavailable when a user must handoff. We develop a framework for designing admission control algorithms in wireless networks that support guaranteed QoS. First, we devise a taxonomy to explore the mathemati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Input-queued switching with QoS guarantees

    Publication Year: 1999, Page(s):1152 - 1159 vol.3
    Cited by:  Papers (17)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    Input-queued switching architectures are becoming an attractive alternative for designing very high speed switches owing to its scalability. Tremendous efforts have been made to overcome the throughput problem caused by contentions occurred at the input and output sides of the switches. However, no QoS guarantees can be provided by the current input-queued switch design. In this paper, a frame bas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Measurement-based band allocation in multiband CDMA

    Publication Year: 1999, Page(s):1364 - 1371 vol.3
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    Multiband (or multi-carrier) CDMA is a promising approach to increasing the capacity of CDMA systems, while maintaining compatibility with existing systems. This paper proposes an algorithm for allocating new calls to bands based on measured path gains, or alternatively, on estimates of the mobile stations' positions. By separating strong and weak users into separate bands, this algorithm reduces ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fair bandwidth sharing among adaptive and non-adaptive flows in the Internet

    Publication Year: 1999, Page(s):1412 - 1420 vol.3
    Cited by:  Papers (42)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (848 KB)

    The problem of fair bandwidth sharing among adaptive (TCP) and non-adaptive (i.e. CBR-UDP) flows at an Internet gateway is considered. An algorithm that drops packet preventively, in an attempt to actively penalize the non-adaptive traffic that attempts to “steal” buffer space, and therefore bandwidth from the adaptive traffic flows, is presented. The algorithm maintains minimal flow s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of variable reservation policies for hand-off prioritization in mobile networks

    Publication Year: 1999, Page(s):1187 - 1194 vol.3
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB)

    We propose a variable reservation scheme for cellular networks, based on prioritization of hand-off calls over new calls. This problem has been extensively studied in the literature, and several schemes consisting of call-request queuing, fixed reservation of channels or combinations of both have been proposed. We take advantage of the information reported by the mobile terminal to adaptively esta... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Measuring long-range dependence under changing traffic conditions

    Publication Year: 1999, Page(s):1513 - 1521 vol.3
    Cited by:  Papers (22)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (888 KB)

    Previous measurements of various types of network traffic have shown evidence consistent with long-range dependence and self-similarity. However, an alternative explanation for these measurements is non-stationarity. Standard estimators of LRD parameters such as the Hurst parameter H assume stationarity and are susceptible to bias when this assumption does not hold. Hence LRD may be indicated by t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of ATM shortcut connections in overlaid IP/ATM networks

    Publication Year: 1999, Page(s):1480 - 1487 vol.3
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    In this paper we present methods to evaluate the benefit of using direct ATM connections (shortcuts) between IP nodes in IP over ATM networks, and we identify the combinations of IP and ATM network topologies where ATM shortcut benefits are likely to be high. We model an IP/ATM network with and without ATM shortcuts as two loss networks. We propose a metric for network performance comparison, the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the optimal placement of web proxies in the Internet

    Publication Year: 1999, Page(s):1282 - 1290 vol.3
    Cited by:  Papers (62)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    Web caching or web proxy has been considered as the prime vehicle of coping with the ever-increasing demand for information retrieval over the Internet, the WWW being a typical example. Existing work on web proxy has primarily focused on content based caching; relatively less attention has been given to the development of proper placement strategies for the potential web proxies in the Internet. I... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The ENTRAPID protocol development environment

    Publication Year: 1999, Page(s):1107 - 1115 vol.3
    Cited by:  Papers (12)  |  Patents (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (804 KB)

    As Internet services rapidly become an essential part of the global infrastructure, it is necessary for the protocols underlying these services to be robust and fail-safe. To achieve this goal, protocol developers should be able to design, implement, simulate, visualize, and validate their work in a protocol development environment before deployment in the field. We describe the ENTRAPID protocol ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A self-configuring RED gateway

    Publication Year: 1999, Page(s):1320 - 1328 vol.3
    Cited by:  Papers (184)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    The congestion control mechanisms used in TCP have been the focus of numerous studies and have undergone a number of enhancements. However, even with these enhancements, TCP connections still experience alarmingly high loss rates, especially during times of congestion. To alleviate this problem, the IETF is considering active queue management mechanisms, such as random early detection (RED), for d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resource allocation during handoff through dynamic schemes for mobile multimedia wireless networks

    Publication Year: 1999, Page(s):1204 - 1211 vol.3
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    User mobility management is one of the important components of mobile multimedia systems. In a cell-based network, a mobile should be able to seamlessly obtain transmission resources after handoff to a new basestation. This is essential for both service continuity and quality of service assurance. We present strategies for accommodating continuous service to mobile users through estimating resourc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quality of service over wireless ATM links

    Publication Year: 1999, Page(s):1003 - 1010 vol.3
    Cited by:  Papers (3)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    Several technical issues must be resolved before ATM services can be efficiently extended to the wireless environment. Key issues include incorporating the characteristics of the time-varying wireless channel in the provisioning of the cell-level QoS, and improving the transport performance using error control mechanisms. We analyze the cell loss and delay performance over a wireless ATM link. We ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic sampling properties of effective bandwidth estimation for admission control

    Publication Year: 1999, Page(s):1532 - 1538 vol.3
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    In measurement based admission control, measured traffic parameters are used determine the maximum number of connections which can be admitted to a resource within a given quality constraint. It has been pointed out that the certainty equivalent formulation, in which the measured parameters are assumed to be the true ones, can compromise admission control. This is because the measured parameters a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PLANet: an active internetwork

    Publication Year: 1999, Page(s):1124 - 1133 vol.3
    Cited by:  Papers (24)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (948 KB)

    We present PLANet: an active network architecture and implementation. In addition to a standard suite of Internet-like services, PLANet has two key programmability features: (1) all packets contain programs; and (2) router functionality may be extended dynamically. Packet programs are written in our special purpose programming language PLAN, the Packet Language for Active Networks, while dynamic r... View full abstract»

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