By Topic

IEEE/ACM Transactions on Networking

Issue 6 • Date Dec. 2001

Filter Results

Displaying Results 1 - 15 of 15
  • Author index

    Publication Year: 2001, Page(s):845 - 847
    Request permission for commercial reuse | PDF file iconPDF (53 KB)
    Freely Available from IEEE
  • Subject index

    Publication Year: 2001, Page(s):847 - 855
    Request permission for commercial reuse | PDF file iconPDF (85 KB)
    Freely Available from IEEE
  • Adaptive proportional delay differentiated services: characterization and performance evaluation

    Publication Year: 2001, Page(s):801 - 817
    Cited by:  Papers (43)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (399 KB) | HTML iconHTML

    We examine a proportional-delay model for Internet differentiated services. Under this model, an Internet service provider (ISP) can control the waiting-time "spacings" between different classes of traffic. Specifically, the ISP tries to ensure that the average waiting time of class i traffic relative to that of class i-1 traffic is kept at a constant specified ratio. If the waiting-time ratio of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New dynamic SPT algorithm based on a ball-and-string model

    Publication Year: 2001, Page(s):706 - 718
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (238 KB) | HTML iconHTML

    A key functionality in today's widely used interior gateway routing protocols such as OSPF and IS-IS involves the computation of a shortest path tree (SPT). In many existing commercial routers, the computation of an SPT is done from scratch following changes in the link states of the network. As there may coexist multiple SPTs in a network with a set of given link states, such recomputation of an ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • End-to-end congestion control for the Internet: delays and stability

    Publication Year: 2001, Page(s):818 - 832
    Cited by:  Papers (184)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (325 KB) | HTML iconHTML

    Under the assumption that queueing delays will eventually become small relative to propagation delays, we derive stability results for a fluid flow model of end-to-end Internet congestion control. The theoretical results of the paper are intended to be decentralized and locally implemented: each end system needs knowledge only of its own round-trip delay. Criteria for local stability and rate of c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed overload control algorithm for delay-bounded call setup

    Publication Year: 2001, Page(s):780 - 789
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (214 KB) | HTML iconHTML

    As communication networks provide newer services, signaling is becoming more and more compute intensive compared to present day networks. It is known that under overload conditions, the call throughput (goodput) and the network revenue drops to zero even when transport resources are available. A distributed overload control algorithm for delay-bounded call setup is proposed. The end-to-end delay b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the efficiency of multicast

    Publication Year: 2001, Page(s):719 - 732
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB) | HTML iconHTML

    The average number of joint hops in a shortest-path multicast tree from a root to m arbitrary chosen group member nodes is studied. A general theory for all graphs, hence including the graph representation of the Internet, is presented which quantifies the multicast reduction in network links compared to m times unicast. For two special types of graphs, the random graph Gp(N) and the k-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stable Internet routing without global coordination

    Publication Year: 2001, Page(s):681 - 692
    Cited by:  Papers (114)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (175 KB) | HTML iconHTML

    The Border Gateway Protocol (BGP) allows an autonomous system (AS) to apply diverse local policies for selecting routes and propagating reachability information to other domains. However, the BGP permits ASs to have conflicting policies that can lead to routing instability. This paper proposes a set of guidelines for an AS to follow in setting its routing policies, without requiring coordination w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resource sharing for replicated synchronous groupware

    Publication Year: 2001, Page(s):833 - 843
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (343 KB) | HTML iconHTML

    We describe problems associated with accessing data resources external to the application, which we term externalities, in replicated synchronous collaborative applications. Accessing externalities such as files, databases, network connections, environment variables, and the system clock is not as straightforward in replicated collaborative software as in single-user applications or centralized co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed admission control for power-controlled cellular wireless systems

    Publication Year: 2001, Page(s):790 - 800
    Cited by:  Papers (22)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (214 KB) | HTML iconHTML

    It is well known that power control can help to improve spectrum utilization in cellular wireless systems. However, many existing distributed power control algorithms do not work well without an effective connection admission control (CAC) mechanism, because they could diverge and result in dropping existing calls when an infeasible call is admitted. In this work, based on a system parameter defin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The jitter time-stamp approach for clock recovery of real-time variable bit-rate traffic

    Publication Year: 2001, Page(s):746 - 754
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (174 KB) | HTML iconHTML

    When multimedia streams arrive at the receiver, their temporal relationships may be distorted due to jitter. Assuming the media stream is packetized, the jitter is then the packet's arrival time deviation from its expected arrival time. There are various ways to reduce jitter, which include synchronization at the application layer, or synchronization at the asynchronous transfer mode (ATM) adaptat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routing with a clue

    Publication Year: 2001, Page(s):693 - 705
    Cited by:  Papers (5)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (222 KB) | HTML iconHTML

    We suggest a new simple forwarding technique to speed up IP destination address lookup. The technique is a natural extension of IP, requires 5 bits in the IP header (IPv4, 7 in IPv6), and performs IP lookup nearly as fast as IP/Tag switching but with a smaller memory requirement and a much simpler protocol. The basic idea is that each router adds a "clue" to each packet, telling its downstream rou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polynomial cost approximations in Markov decision theory based call admission control

    Publication Year: 2001, Page(s):769 - 779
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (244 KB) | HTML iconHTML

    The problem of call admission control and routing in a multiservice circuit-switched loss network can be solved optimally under certain assumptions by the tools of Markov decision theory. However, in networks of practical size a number of simplifying approximations are needed to make the solution feasible. Assuming link independence, we propose a new method for approximating the state-dependent li... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On inferring autonomous system relationships in the Internet

    Publication Year: 2001, Page(s):733 - 745
    Cited by:  Papers (166)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB) | HTML iconHTML

    The Internet consists of rapidly increasing number of hosts interconnected by constantly evolving networks of links and routers. Interdomain routing in the Internet is coordinated by the Border Gateway Protocol (BGP). The BGP allows each autonomous system (AS) to choose its own administrative policy in selecting routes and propagating reachability information to others. These routing policies are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Loss probability calculations and asymptotic analysis for finite buffer multiplexers

    Publication Year: 2001, Page(s):755 - 768
    Cited by:  Papers (68)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (410 KB) | HTML iconHTML

    We propose an approximation for the loss probability, PL(x), in a finite buffer system with buffer size x. Our study is motivated by the case of a high-speed network where a large number of sources are expected to be multiplexed. Hence, by appealing to central limit theorem type of arguments, we model the input process as a general Gaussian process. Our result is obtained by making a si... 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