Proceedings of Sixth International Conference on Computer Communications and Networks

22-25 Sept. 1997

Filter Results

Displaying Results 1 - 25 of 84
  • Proceedings of Sixth International Conference on Computer Communications and Networks

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

    Publication Year: 1997, Page(s):549 - 551
    Request permission for commercial reuse | PDF file iconPDF (152 KB)
    Freely Available from IEEE
  • GMNF-DVMRP: a modified version of distance vector multicast routing protocol

    Publication Year: 1997, Page(s):65 - 68
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    In this paper, we make a survey of distance vector multicast routing protocol (DVMRP) and find that it is not optimal in the aspect of network cost (NC). Therefore, we propose a modified version of DVMRP, called “group membership near first-DVMRP” (GMNF-DVMRP), to decrease the NC of the multicast tree formed by DVMRP. A simulation is implemented to compare our modified version and the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An API for scalable reliable multicast

    Publication Year: 1997, Page(s):60 - 64
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    There are many scenarios in which the same data must be delivered over a packet switched network to a large set of receivers. The Internet enables efficient multipoint transmissions through IP multicast by allowing data transmission to all receivers with a single send. Most approaches to scalable reliable multicast utilize receiver-oriented retransmissions. Defining an API for receiver-oriented re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The performance of multicast banyan networks

    Publication Year: 1997, Page(s):51 - 59
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1136 KB)

    Multicast is the ability to transmit information from a single source node to multiple selected destination nodes in a network. Current trends in networking applications indicate that there will be an increasing demand in future networks for multicast communication. Banyan networks have been proposed for use in ATM high-speed communications networks and have been used for the interconnection of pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analyzing the latency of the Totem multicast protocols

    Publication Year: 1997, Page(s):42 - 50
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1328 KB)

    Multicast group communication protocols provide a foundation on which distributed systems can be built. The performance of these protocols is, however, not easy to characterize or to analyze. This research determines probability density functions for the latency to message delivery for the Totem multicast protocols, which provide reliable totally ordered delivery of multicast messages across singl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routing in ad hoc networks using a spine

    Publication Year: 1997, Page(s):34 - 39
    Cited by:  Papers (98)  |  Patents (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (924 KB)

    We present a two-level hierarchical routing architecture for ad hoc networks. Within each lower level cluster, we describe a self-organizing, dynamic spine structure to (a) propagate topology changes, (b) compute updated routes in the background, and (c) provide backup routes in case of transient failures of the primary routes. We analyze and bound the worst case of movements between upper level c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Admission control for wireless networks with heterogeneous traffic using event based resource estimation

    Publication Year: 1997, Page(s):262 - 269
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (676 KB)

    In this paper a new distributed adaptive admission control algorithm for wireless cellular networks with heterogeneous traffic is proposed. The resources needed for handoff calls are estimated by calculating the probability of visiting particular cells during the call lifetime based on the call duration and residence time statistics. This information is then communicated to the base stations in th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time dependent priority scheduling for guaranteed QoS systems

    Publication Year: 1997, Page(s):236 - 241
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB)

    With the advances in server technology, and the advent of fast gigabit networks, it has become possible to support multimedia applications. To support the requirements for the transmission of isochronous data, the network must provide service guarantees to connections, including minimum bandwidth, packet delay, delay jitter, and loss. Three factors determine the utilization of the network when pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improved topology discovery algorithm for networks with wormhole routing and directed links

    Publication Year: 1997, Page(s):98 - 105
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1204 KB)

    We propose a new parallel topology discovery algorithm for irregular, mesh-connected networks with unidirectional links and wormhole routing. An algorithm of this type was developed for the ATOMIC high speed local area network to avoid the need for manually updating routing tables. Similar needs may arise in wireless networks where channels may be unidirectional because of limited transmission pow... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shared tree wireless network multicast

    Publication Year: 1997, Page(s):28 - 33
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB)

    In this paper we propose a multicast protocol for a multihop, mobile wireless network with cluster based routing and token access protocol within each cluster. The multicast protocol uses a shared tree which is dynamically updated to adjust to changes in topology and membership (i.e. dynamic joins and quits). Two options for tree maintenance have been simulated and evaluated: “hard state&rdq... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Static caching in Web servers

    Publication Year: 1997, Page(s):410 - 417
    Cited by:  Papers (12)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    This paper studies caching in primary Web servers. We use log files from four Web servers to analyze the performance of various proposed cache policies for Web servers: LRU-threshold, LFU, LRU-SIZE, LRU-MIN, LRU-k-threshold and the Pitkow/Recker (1994) policy. Web document access patterns change very slowly. Based on this fact, we propose and evaluate static caching, a novel cache policy for Web s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic bandwidth allocation for real-time VBR video traffic in ATM networks

    Publication Year: 1997, Page(s):306 - 312
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    We study the problem of dynamic bandwidth allocation for an ATM multiplexer loaded with real-rime VBR video traffic. The proposed mechanism adjusts the allocated bandwidth at regular intervals based on measured QoS. Instead of actual measurement of small cell loss ratios, we combine a virtual output buffer method with a regression method to shorten the time interval required for estimating the req... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed and persistent mobile agents for heterogeneous personal communications systems

    Publication Year: 1997, Page(s):256 - 261
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    Problems of environment heterogeneity and interoperability between different mobile computing platforms are among the most urgent to address by the research community. This paper proposes an environment, which supports migration of mobile code developed using heterogeneous languages. Current developments in the area of mobile code and distributed mobile computing systems are discussed and placed w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gis2web and its inter-application communications issues

    Publication Year: 1997, Page(s):427 - 430
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    Gis2web is a system intended to bridge the gap between GIS software and datasets and the WWW. The system operates by periodically accessing distributed datasets of GIS information and creating a common repository of WWW accessible information on a gis2web server. In this way gis2web users are provided seamless access to different datasets which may be of quite different forms. This paper discusses... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tight upper bounds for cell loss probabilities in ATM multiplexers and required bandwidth estimation

    Publication Year: 1997, Page(s):228 - 234
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    Estimating the cell loss probability in an ATM multiplexer is a key issue in network management and traffic control such as call admission control and bandwidth allocation. In this paper, we derive a new approximation to estimate the total and individual cell loss probabilities in an ATM multiplexer fed by a superposition of heterogeneous on-off sources with exponentially distributed on and off pe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An extended comparison of slotted and unslotted deflection routing

    Publication Year: 1997, Page(s):92 - 97
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (852 KB)

    In this paper, we have experimentally compared synchronized versus asynchronous all-optical deflection networks. We have compared four routing modes: synchronous mode, partially synchronous mode, and asynchronous mode with fixed or bound packet sizes. Our experiments mainly show that the natural decrease of the performances of the asynchronous mode, compared to the synchronous mode, can be balance... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A novel mobile agent search algorithm

    Publication Year: 1997, Page(s):128 - 131
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    Intelligent agents have been shown to be a good approach to addressing the issues of limited capacity and unreliable wireless links in mobile computing. However, before the approach can be commercially viable, a set of management capabilities that support the controls of intelligent agents in a mobile environment need to be in place. Since controls can only be applied after the target agent is loc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TCP selective acknowledgments and UBR drop policies to improve ATM-UBR performance over terrestrial and satellite networks

    Publication Year: 1997, Page(s):17 - 25
    Cited by:  Papers (8)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1136 KB)

    We study the performance of selective acknowledgements (SACK) with TCP over the ATM-UBR service category. We examine various unspecified bit rate (UBR) drop policies, TCP mechanisms and network configurations to recommend optimal parameters for TCP over UBR. We discuss various TCP congestion control mechanisms compare their performance for LANs and WANs. We describe the effect of satellite delays ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault tolerance of PCS mobility databases

    Publication Year: 1997, Page(s):542 - 547
    Cited by:  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    A personal communications services (PCS) network system constantly tracks the locations of the mobile stations (MS) so that incoming calls can be delivered to the target mobile stations. The overall architecture of the PCS mobility management in GSM is presented. In general, a two-level database is used to store the mobile station location information. The mobile station location update procedure ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A performance system for high quality desktop video conference

    Publication Year: 1997, Page(s):404 - 407
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB)

    This paper describes a performance system that, by graceful degradation and reallocation of resources, attempts to maintain quality in desktop video conference (DVC) systems. The performance system is based on a distributed agent architecture, where agents cooperate to maintain the required quality of service (QoS) during the video conference session. This system adjusts its setting in real time t... View full abstract»

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

    Publication Year: 1997, Page(s):298 - 305
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB)

    The available bit rate (ABR) service dynamically utilizes free bandwidth in ATM networks for data traffic. ABR enables data sources to efficiently utilize network resources without adversely affecting the performance of guaranteed traffic such as for video. However, the majority of research to date on the performance of ABR schemes has ignored the effects of guaranteed traffic. The vast majority o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed algorithm of delay bounded multicast routing for multimedia applications

    Publication Year: 1997, Page(s):208 - 213
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB)

    The aim of multicast routing is to find a tree which is rooted from the source node and contains all the multicast destinations. A delay bounded routing tree, is a tree where the accumulated delay from the source node to any destination along the tree shall not exceed a pre-specified bound. This paper presents a distributed heuristic algorithm which generates routing trees with sub-optimal network... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • QoS routing algorithms for pre-computed paths

    Publication Year: 1997, Page(s):248 - 251
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB)

    Routing with multiple QoS constraints is known to be a NP-complete problem. In our previous work (QoSRBF algorithm), we have shown that, for a number of specific QoS constraints, this problem can be solved in polynomial time, when a weighted fair queueing (WFQ) service discipline is employed. QoSRBF is an on-demand algorithm. We propose a number of QoS routing algorithms for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Archiving agents for the World Wide Web

    Publication Year: 1997, Page(s):424 - 426
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB)

    The information available on the World Wide Web changes with incredible speed. New information is added and old information is altered. This means that a document which is important to a user accessing the Web may change, move or even disappear altogether. Described here is an autonomous agent, written in Java, which locally archives documents that are deemed important by the user. These locally a... View full abstract»

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