By Topic

IEEE/ACM Transactions on Networking

Issue 1 • Date Feb 2001

Filter Results

Displaying Results 1 - 10 of 10
  • List of reviewers

    Publication Year: 2001, Page(s):119 - 121
    Request permission for commercial reuse | PDF file iconPDF (9 KB)
    Freely Available from IEEE
  • Dynamic slot allocation (DSA) in indoor SDMA/TDMA using a smart antenna basestation

    Publication Year: 2001, Page(s):69 - 81
    Cited by:  Papers (84)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB) | HTML iconHTML

    We introduce and study the use of dynamic slot allocation (DSA) in packet-switched space-division-multiple-access (SDMA) systems. In conventional SDMA, a smart antenna is used at the basestation to simultaneously communicate with multiple stations on the same frequency channel. When dynamic slot allocation is added, the basestation uses uplink channel measurements to intelligently construct future... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new approach for asynchronous distributed rate control of elastic sessions in integrated packet networks

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

    We develop a new class of asynchronous distributed algorithms for the explicit rate control of elastic sessions in an integrated packet network. Sessions can request for minimum guaranteed rate allocations (e.g., minimum cell rates in the ATM context), and, under this constraint, we seek to allocate the max-min fair rates to the sessions. We capture the integrated network context by permitting the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the stability of input-queued switches with speed-up

    Publication Year: 2001, Page(s):104 - 118
    Cited by:  Papers (75)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB) | HTML iconHTML

    We consider cell-based switch and router architectures whose internal switching matrix does not provide enough speed to avoid input buffering. These architectures require a scheduling algorithm to select at each slot a subset of input buffered cells which can be transferred toward output ports. We propose several classes of scheduling algorithms whose stability properties are studied using analyti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the wavelength assignment problem in multifiber WDM star and ring networks

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

    This paper studies-the off-line wavelength assignment problem in star and ring networks that deploy multiple fibers between nodes and use wavelength division multiplexing (WDM) for transmission. The results in this paper show that the ability to switch between fibers increases wavelength utilization. In particular, sharper per-fiber bounds on the number of required wavelengths are derived for the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stability and performance analysis of networks supporting elastic services

    Publication Year: 2001, Page(s):2 - 14
    Cited by:  Papers (69)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB) | HTML iconHTML

    We consider the stability and performance of a model for networks supporting services that adapt their transmission to the available bandwidth. Not unlike real networks, in our model, connection arrivals are stochastic, each has a random amount of data to send, and the number of ongoing connections in the system changes over time. Consequently, the bandwidth allocated to, or throughput achieved by... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Topology aggregation for directed graphs

    Publication Year: 2001, Page(s):82 - 90
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB) | HTML iconHTML

    This paper addresses the problem of aggregating the topology of a sub-network in a compact way with minimum distortion. The problem arises from networks that have a hierarchical structure, where each sub-network must advertise the cost of routing between each pair of its border nodes. The straight-forward solution of advertising the exact cost for each pair has a quadratic cost which is not practi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling TCP behavior in a differentiated services network

    Publication Year: 2001, Page(s):31 - 46
    Cited by:  Papers (54)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB) | HTML iconHTML

    The differentiated services architecture has been proposed for providing different levels of services and has received wide attention. A packet in a diff-serv domain is classified into a class of service according to its contract profile and treated differently by its class. While many studies have addressed issues on the diff-serv architecture (e.g., dropper, marker, classifier and shaper), there... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routing in the bidirectional shufflenet

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

    We study the bidirectional shufflenet topology, which is obtained from the well-known (unidirectional) shufflenet by considering bidirectional links. More specifically, we define a shortest path routing algorithm, and derive the diameter and the average distance of the topology. The bidirectional shufflenet is then compared, in terms of average distance, with other variations of the perfect shuffl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Unslotted deflection routing: a practical and efficient protocol for multihop optical networks

    Publication Year: 2001, Page(s):47 - 59
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB) | HTML iconHTML

    This paper is concerned with all-optical networks using deflection routing and time division multiplexing. Slotted networks make use of the synchronous arrival of the packets to the routers to minimize locally the number of deflections. We show that the difference in performance between slotted and unslotted networks is mainly due to the fact that unslotted networks cannot easily perform such loca... 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