By Topic

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
  • Wavelength assignment to minimize requirement on tunable range of optical transceivers in WDM networks

    Publication Year: 1999, Page(s):404 - 409
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    In this paper we consider WDM networks with a tunable transmitter and a fixed-wavelength receiver at each station (similar results hold when the transmitter is fixed and the receiver is tunable). Traditionally, each station is required to be able to access all wavelength channels used in the network. Such requirement limits the number of wavelengths that can be exploited in a WDM network up to the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimizing the number of optical crossconnect ports in mesh networks based on bidirectional line-switched WDM self-healing ring protection

    Publication Year: 1999, Page(s):398 - 403
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    The design of survivable all-optical mesh networks based on bidirectional line-switched WDM (wavelength division multiplexed) self-healing rings (SHR/WDM) to provide full protection against any single line fault requires the solution of three sub-problems: determining the ring cover of the mesh topology, determining the routing of the working lightpaths (paths of light) between the node pairs that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal placement of wavelength converters in trees and trees of rings

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

    In wavelength-routed optical networks, wavelength converters can potentially reduce the requirement on the number of wavelengths. The problem of placing a minimum number of wavelength converters in a WDM network so that any routing can be satisfied using no more wavelengths than if there were wavelength converters at every node was raised in Wilfong et al. (1998) and shown to be NP-complete in gen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Issues of anylayer routing

    Publication Year: 1999, Page(s):458 - 462
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    This research proposes a conceptual framework (called anylayer routing) to investigate routing approaches needed by the evolving Internet. The emerging content-based routing, directory-based routing, and service-based routing in the Internet are thus discussed through the framework. In addition, the effects of the framework on the internetworking are evaluated, which relates to network planning, n... 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.
  • Design and evaluation of router-supported and end-to-end multicast receiver-based scoping protocols

    Publication Year: 1999, Page(s):384 - 389
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (732 KB)

    IP multicasting allows a source to define a multicast group address and receivers can dynamically join and leave this group. Currently the propagation of multicast packets is controlled by two scoping methods: TTL scoping and administrative scoping. Both of these approaches require the source to control the scope of the multicast. Receiver-based scoping allows a receiver to place conditions on its... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two location tracking strategies for PCS systems

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

    This paper presents two location tracking strategies (LS-I and LS-II) for personal communications services (PCS) systems. In the proposed schemes, the movement history of a mobile terminal (MT) since the last location update is taken into account in making a location update decision. In particular, before reaching the update threshold the movement counter is increased only after the MT visits a ne... 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.
  • Ad hoc wireless multicast with mobility prediction

    Publication Year: 1999, Page(s):4 - 9
    Cited by:  Papers (26)
    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.
  • Hierarchical video-on-demand servers for TV-anytime services

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

    This paper presents algorithms and principles for the implementation of a novel broadband multimedia service called “TV-anytime”. The basic idea of this service is to store broadcast media assets on media server systems and allow people to access this information at any time. Using a given user profile the recording of media assets can be personalized allowing the implementation of &ld... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SLM, a framework for session layer mobility management

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

    This paper describes a novel framework for managing connections to mobile hosts in the Internet. The framework, SLM, integrates the notions of quality of service management and mobility management and forms a base for overall session management. We compare SLM with the currently most widely adopted mobility management framework, Mobile IP, and show how some of Mobile IP's deficiencies are overcome... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A scalable architecture for providing deterministic guarantees

    Publication Year: 1999, Page(s):91 - 96
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    The Internet community has proposed the integrated services architecture (Intserv) and the signaling protocol RSVP to provide deterministic guarantees (bandwidth, delay and jitter) to individual flows. However, experience with practical systems has revealed the severe scalability problems of the Intserv model due to the amount of routing and reservation state that is required to he maintained in t... 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.
  • 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.
  • Optimal two-tier cellular network design

    Publication Year: 1999, Page(s):312 - 317
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    One way of improving the performance of cellular networks is to build a second layer of macrocells on top of the microcell level. The system performance can further be increased by using guard channels and allowing calls to overflow to the upper layer when needed. In this study, we used simulated annealing (SA) to determine the design parameters of two-tier cellular networks for which the cost is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adapting broadcasting sets to topology changes in packet radio networks

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

    Most existing algorithms that maximize throughput in packet radio networks by selecting a maximal broadcasting set in each time slot of a TDMA frame cannot accommodate changes in the topology of the network. In fact, when there is a change in the network topology, these algorithms have to be rerun for the entire network to compute a new broadcasting set. This is certainly time and bandwidth consum... 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.
  • Dynamic QoS allocation for multimedia ad hoc wireless networks

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

    In this paper, we propose an approach to support QoS and multimedia applications in ad hoc wireless networks. An ad hoc network is a collection of mobile stations forming a temporary network without the aid of any centralized coordinator and is different from cellular networks which require fixed base stations interconnected by a wired backbone. It is useful for some special situations, such as ba... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A low-cost/high-performance server for video on demand

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

    In this paper a prototype of a distributed video-on-demand server is presented. The technical aspects regarding the realization of this kind of service provider are dealt with, paying particular attention to exploiting the architecture the system is based on. The proposed system easily allows, in any broadband local network environment, the realization of a low-cost/high-performance distributed vi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real-time simulation with traffic monitoring tool

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

    We have developed new traffic measuring equipment and applied it to the real-time simulation of a network. The measuring equipment monitors IP traffic on an ATM link and continuously transfers the packet length and the timestamp for each IP packet to a post-processing system. The post-processing system receives the data, estimates the arrival epoch to the transmission queue of the ATM link, and si... 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.
  • 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.
  • Optimal scheduling of secondary content for aggregation in video-on-demand systems

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

    We present and evaluate an optimal scheduling algorithm for inserting secondary content for improving resource utilization in VoD systems. The algorithm runs in polynomial time, and is optimal with respect to the total bandwidth usage over the merging interval. We present constraints on content insertion which make the overall QoS of the delivered stream acceptable, and show how our algorithm can ... View full abstract»

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