By Topic

Networking, IEEE/ACM Transactions on

Issue 3 • Date Jun 1999

Filter Results

Displaying Results 1 - 14 of 14
  • Random algorithms for scheduling multicast traffic in WDM broadcast-and-select networks

    Publication Year: 1999, Page(s):425 - 434
    Cited by:  Papers (24)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (552 KB)

    We develop and analyze simple algorithms for scheduling multicast traffic in wavelength division multiplexing (WDM) broadcast-and-select networks with N nodes, W wavelengths, and a single receiver per node that can be tuned to any of the W wavelengths. Each message is addressed to κ randomly chosen nodes. Since optimal message scheduling in a WDM network is known to be very difficult, we stu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance bounds for flow control protocols

    Publication Year: 1999, Page(s):310 - 323
    Cited by:  Papers (54)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB)

    We discuss a simple conceptual framework for analyzing the flow of data in integrated services networks. The framework allows us to easily model and analyze the behavior of open loop, rate based flow control protocols, as well as closed loop, window based flow control protocols. Central to the framework is the concept of a service curve element, whose departure process is bounded between the convo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IP lookups using multiway and multicolumn search

    Publication Year: 1999, Page(s):324 - 334
    Cited by:  Papers (90)  |  Patents (58)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB)

    IP address lookup is becoming critical because of increasing routing table sizes, speed, and traffic in the Internet. Given a set S of prefixes and an IP address D, the IP address lookup problem is to find the longest matching prefix of D in set S. This paper shows how binary search can be adapted for solving the best-matching prefix problem. Next, we show how to improve the performance of any bes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routing with end-to-end QoS guarantees in broadband networks

    Publication Year: 1999, Page(s):365 - 374
    Cited by:  Papers (65)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB)

    We consider routing schemes for connections with end-to-end delay requirements, and investigate several fundamental problems. First, we focus on networks which employ rate-based schedulers and, hence, map delay guarantees into nodal rate guarantees, as done with the guaranteed service class proposed for the Internet. We consider first the basic problem of identifying a feasible route for the conne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A virtual circuit deflection protocol

    Publication Year: 1999, Page(s):335 - 349
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    We propose a communication protocol, called the virtual circuit deflection (VCD) protocol, which combines some of the individual characteristics of virtual circuit switching and deflection routing. An advantage of the VCD protocol over previous (datagram) deflection schemes is that deflections in the former occur on a per session basis (or a per subsession basis, if sessions need to be split to fi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal WDM schedules for optical star networks

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

    We consider single-hop wavelength-division multiplexed networks in which the transmitters take a nonzero amount of time, called tuning latency, to tune from one wavelength to another. For such networks, we show that, under certain conditions on the traffic matrix, there exist polynomial-time algorithms that produce the optimal schedule. Further, the tuning latency is masked in the length of the op... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • End-to-end Internet packet dynamics

    Publication Year: 1999, Page(s):277 - 292
    Cited by:  Papers (334)  |  Patents (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (196 KB)

    We discuss findings from a large-scale study of Internet packet dynamics conducted by tracing 20000 TCP bulk transfers between 35 Internet sites. Because we traced each 100-kbyte transfer at both the sender and the receiver, the measurements allow us to distinguish between the end-to-end behavior due to the different directions of the Internet paths, which often exhibit asymmetries. We: (1) charac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Workload models of VBR video traffic and their use in resource allocation policies

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

    The load generated by new types of communications services related to multimedia and video transmission is becoming one of the major sources of traffic in WAN networks. Modeling this type of load is a prerequisite for any performance study. We approach the load-characterization problem from a global point of view by analyzing a set of 20 video streams. We developed resource-, subject-, and scene-o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Wavelength requirements for multicasting in all-optical networks

    Publication Year: 1999, Page(s):414 - 424
    Cited by:  Papers (50)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (196 KB)

    Multicasting in a network is needed for a number of applications where a session requires connectivity between more than two participants. In this paper, we consider a wavelength-division multiplexing (WDM)-based all-optical network. We derive asymptotic upper bounds on the number of wavelengths needed to support multicasting capability in an all-optical network. The number of wavelengths in a WDM... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On scheduling all-to-all personalized connection and cost-effective designs in WDM rings

    Publication Year: 1999, Page(s):435 - 445
    Cited by:  Papers (39)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    We consider the problem of scheduling all-to-all personalized connections (AAPC) in WDM rings. Scheduling one connection for every source-destination pair in a network of limited connectivity provides a way to reduce routing control and guarantee throughput. For a given number of wavelengths K and a given number of transceivers per node T, we first determine the lower bound (LB) on the schedule le... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • QoS routing in networks with inaccurate information: theory and algorithms

    Publication Year: 1999, Page(s):350 - 364
    Cited by:  Papers (163)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (260 KB)

    This paper investigates the problem of routing flows with quality-of-service (QoS) requirements through one or more networks, when the information available for making such routing decisions is inaccurate. Inaccuracy in the information used in computing QoS routes, e.g., network state such as link and node metrics, arises naturally in a number of different environments that are reviewed in the pap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A framework for robust measurement-based admission control

    Publication Year: 1999, Page(s):293 - 309
    Cited by:  Papers (77)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1028 KB)

    Measurement-based admission control (MBAC) is an attractive mechanism to concurrently offer quality of service (QoS) to users, without requiring a priori traffic specification and on-line policing. However, several aspects of such a system need to be dearly understood in order to devise robust MBAC schemes, i.e., schemes that can match a given QoS target despite the inherent measurement uncertaint... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalable feedback for large groups

    Publication Year: 1999, Page(s):375 - 386
    Cited by:  Papers (47)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB)

    We investigate the scalability of feedback in multicast communication and propose a new method of probabilistic feedback based on exponentially distributed timers. By analysis and simulation for up to 106 receivers, we show that feedback implosion is avoided while feedback latency is low. The mechanism is robust against the loss of feedback messages and works well in case of homogeneous... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling one- and two-layer variable bit rate video

    Publication Year: 1999, Page(s):398 - 413
    Cited by:  Papers (39)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB)

    This paper presents a source model for VBR video traffic. A finite-state Markov chain is shown to accurately model one- and two-layer video of all activity levels on a per source basis. Our model captures the source dynamics, including the short-term correlations essential for studying network performance. The modeling technique is shown to be applicable for both H.261 and MPEG2 encoded video of a... View full abstract»

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

Aims & Scope

The IEEE/ACM Transactions on Networking’s high-level objective is to publish high-quality, original research results derived from theoretical or experimental exploration of the area of communication/computer networking.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
R. Srikant
Dept. of Electrical & Computer Engineering
Univ. of Illinois at Urbana-Champaign