Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.
Notice: There is currently an issue with the citation download feature. Learn more.

Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370)

11-13 Oct. 1999

Filter Results

Displaying Results 1 - 25 of 103
  • Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370)

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

    Publication Year: 1999, Page(s):663 - 664
    Request permission for commercial reuse | PDF file iconPDF (131 KB)
    Freely Available from IEEE
  • Overload based explicit rate switch schemes with MCR guarantees

    Publication Year: 1999, Page(s):655 - 661
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    An explicit rate switch scheme monitors the load at each link and gives feedback to the sources. We define the overload factor as the ratio of the input rate to the available capacity. In this paper, we present three overload-based switch schemes which provide MCR (minimum cell rate) guarantees for the ATM (asynchronous transfer mode) ABR (available bit rate) service. The switch schemes proposed u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of a threshold dropping scheme for different service classes in the Internet

    Publication Year: 1999, Page(s):649 - 654
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB)

    In this paper a packet discard scheme is proposed with the goal of providing incoming data flows with output link bandwidth depending on the class of service they belong to. Good performance in terms of throughput and fairness in bandwidth sharing among equal priority flows are also considered as the requirements to meet. The dropping scheme is shown to provide very good results and to represent a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On fundamental issues in IP over WDM multicast

    Publication Year: 1999, Page(s):84 - 90
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    As WDM technology matures, IP over WDM multicast will become a challenging new topic. Supporting multicast at the WDM layer provides additional advantages, but also raises many new issues that do not exist in IP multicast. For example, the limitation on the light splitting capability of switches is one major difficulty in WDM multicast, and in addition, the limitations on both the wavelength conve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Layer-3 switching using virtual network ports

    Publication Year: 1999, Page(s):642 - 648
    Cited by:  Patents (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    Switching techniques are capable of providing scalable forwarding performance, traffic engineering and quality of service, which are necessary for the next-generation Internet. Switching techniques achieve this by forwarding packets below the network layer, setting up aggregated flows, and laying explicit routes. The proposed framework improves on the current switching techniques. A virtual networ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Isolation of wireless ad hoc medium access mechanisms under TCP

    Publication Year: 1999, Page(s):77 - 82
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB)

    Mobile computing will be much used in the future, as is evident by such initiatives as Bluetooth, Iceberg and HomeRF. However, for mobile computing to be successful, an obvious layer, the MAC layer, must be efficient in channel access and reservation. Therefore, in-depth understanding is needed of the wireless MAC layer if wireless computing is to takeoff. Many random access wireless MAC protocols... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An integrated scheme for establishing dependable real-time channels in multihop networks

    Publication Year: 1999, Page(s):528 - 533
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    The issue of providing fault-tolerance in real-time communication has been a problem of growing importance. There are two basic approaches for satisfying fault-tolerant requirements in real-time communication: (i) the forward error recovery approach, and (ii) the detect and recovery approach. The first approach is well-suited for hard real-time communication, whereas the second approach is well-su... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • QoS of mobile videophones in HSCSD networks

    Publication Year: 1999, Page(s):447 - 451
    Cited by:  Papers (2)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    This paper is a contribution to studying the feasibility of multimedia applications over GSM HSCSD networks. We report simulation results of a mobile videophone application at bit rates ranging from 14.4 to 57.6 kbit/s. We focus on QoS of video data in both mobile-to-land and mobile-to-mobile H.324 connections. The results obtained in terms of visual quality, received PSNR, delay, and frame rate a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Intrusion detection for link state routing protocol through integrated network management

    Publication Year: 1999, Page(s):634 - 639
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    The JiNao IDS project focuses on detecting intrusions, especially insider attacks against link state routing protocols such as OSPF. One important feature of the JiNao system is its integrated network management (INM) capability. Through SNMP and distributed programming interface (DPI), we can manage and control distributed JiNao IDS remotely, interoperate with other JiNao systems to do correlatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Intelligent medium access for mobile ad hoc networks with busy tones and power control

    Publication Year: 1999, Page(s):71 - 76
    Cited by:  Papers (2)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    In a mobile ad-hoc networks (MANETs), one essential issue is how to increase channel utilization while avoiding the hidden-terminal and the exposed-terminal problems. Several MAC protocols, such as RTS (request to send)/CTS (clear to send) based and busy tone-based schemes, have been proposed to alleviate these problems. In this paper, we explore the possibility of combining the concept of power c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new approach to on-demand loop-free multipath routing

    Publication Year: 1999, Page(s):522 - 527
    Cited by:  Papers (37)  |  Patents (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    We present and verify ROAM, an on-demand routing algorithm that maintains multiple loop-free paths to destinations. Each router maintains entries only for those destinations for which data flows through the router which reduces storage space requirements and the amount of bandwidth needed to maintain correct routing tables. In ROAM, routes are established and maintained on demand using diffusing c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On multicasting with minimum end-to-end delay

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

    We develop and evaluate several heuristics for the construction of a multicast tree to transmit a given message of size r from a source to a set of destinations with guarantees on the end-to-end delay over a computer network. Different multicast trees can be constructed for various values of r. We consider delay sources on links to be from propagation and bandwidth availability. The heuristics tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A scalable modular architecture for SDH/SONET technology

    Publication Year: 1999, Page(s):442 - 446
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    A scalable architecture for integrated SDH/SONET framers is presented. It exploits the fact that not only those framer functions that are obviously suited for parallel processing but all SDH/SONET overhead processing and most of the payload processing functions can be implemented as distributed algorithms. Thereby an M×STM-N framer also handles STM-M×N and STM-(M×N)c frames. Thes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ad hoc wireless multicast with mobility prediction

    Publication Year: 1999, Page(s):4 - 9
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    An ad hoc wireless network is an infrastructureless network composed of mobile hosts. The primary concerns in ad hoc networks are bandwidth limitations and unpredictable topology changes. Thus, efficient utilization of routing packets and immediate recovery of route breaks are critical in routing and multicasting protocols. A multicast scheme, on-demand multicast routing protocol (ODMRP), has been... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A clustering structure for reliable multicasting

    Publication Year: 1999, Page(s):378 - 383
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    In reliable multicast, the multicast packets must be acknowledged. We propose a clustering structure which can be used by most of the existing reliable multicast protocols for collecting acknowledgements and for making local retransmissions. Given a network N and a multicast routing tree (or a set of trees) T, we consider a subgraph G of N induced by the members of a multicast group. We then form ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Methodology for implementing scalable test configurations in ATM switches

    Publication Year: 1999, Page(s):628 - 633
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    In performance testing of ATM switches and networks of switches a variety of connection configurations is needed. In most of the cases, these configurations require one traffic generator and/or analyzer for each switch port. Since this equipment is rather expensive, it is desirable to define scalable configurations that can be used with a limited number of generators. In this paper we present a me... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On-demand multipath routing for mobile ad hoc networks

    Publication Year: 1999, Page(s):64 - 70
    Cited by:  Papers (148)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (552 KB)

    Mobile ad hoc networks are characterized by multi-hop wireless links, absence of any cellular infrastructure, and frequent host mobility. Design of efficient routing protocols in such networks is a challenging issue. A class of routing protocols called on-demand protocols has recently attracted attention because of their low routing overhead. The on-demand protocols depend on query floods to disco... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effects of source traffic shaping on MPEG video transmission over next generation IP networks

    Publication Year: 1999, Page(s):514 - 519
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    The Internet Engineering Task Force (IETF) has defined the integrated services model for supporting real-time services. Guaranteed service is one of these services with firm delay and bandwidth guarantees. Before setting up a guaranteed service flow, traffic parameters of the source have to be specified in terms of token bucket traffic descriptors. The source must conform to these descriptors by s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast and compact longest match prefix look-up method using pointer cache for very long network address

    Publication Year: 1999, Page(s):595 - 602
    Cited by:  Papers (5)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    We propose a fast and compact longest match table look-up method for very long network addresses like IP version 6. This method uses two ideas for a routing-table arranged in a tree-structure. The first idea is to make table look-up fast by caching pointers to intermediate nodes in the tree, reducing the number of node traversals. The second idea is to reduce the memory size required for each node... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gated-scheduling algorithms in packet switching networks

    Publication Year: 1999, Page(s):270 - 275
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    In this paper, two novel scheduling algorithms with low implementation complexity are investigated. Most scheduling algorithms proposed so far usually involve a sorting operation with the complexity of O(logN) per packet, where N denotes the number of connections sharing the link. To solve this problem, we propose two new scheduling algorithms with the complexity O(1), implemented with only a sing... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simple balanced fair blocking mechanism for discrete-time multiplexing of bursty traffic sources

    Publication Year: 1999, Page(s):36 - 41
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (572 KB)

    A major challenge in the development of integrated service packet networks is to devise mechanisms that can support services with different QoS requirements. Recently, a new mechanism was developed, called weighted fair blocking (WFB), that can be placed on top of almost any discrete-time multiplexing system for controlling packet loss. The WFB mechanism has a number of attractive features. It can... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The design and implementation of open video conferencing software platforms using distributed object services

    Publication Year: 1999, Page(s):438 - 441
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB)

    This paper summarizes experiments with a videoconferencing service platform, based on the use of distributed object services. These experiments were performed and used in a Eurescom project, which aimed at validating the use of distributed object-oriented platforms and systems as a new basis for the provision of telecommunication services. In this new approach, telecommunication networks are model... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simple mechanism for improving the throughput of reliable multicast

    Publication Year: 1999, Page(s):372 - 377
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    Single-rate reliable multicast protocols are known to have scalability problems in the presence of a large number of receivers because the sender cannot distinguish independent packet losses at different receivers from multiple packet losses at the same receiver. In the presence of a large number of receivers, the sender may perceive a large aggregate packet loss even if no individual receiver is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A pragmatic approach for feature interaction detection in intelligent networks

    Publication Year: 1999, Page(s):622 - 627
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB)

    A new pragmatic approach for feature interaction (FI) detection for intelligent networks (IN) is presented in this paper. In this approach, the causes of FI given in Bellcore and European benchmarks serve as the starting point. The necessary information for feature description is derived from these causes. This information is modelled using an object-oriented template. Features are described in te... View full abstract»

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