By Topic

IEEE/ACM Transactions on Networking

Issue 3 • Date Jun 1994

Filter Results

Displaying Results 1 - 10 of 10
  • The token grid network

    Publication Year: 1994, Page(s):279 - 287
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    An overwhelming majority of local and metropolitan area network products (LANs and MANs) are based upon linear topologies such as buses and rings. Such networks are economical for high speed operation since the station interfaces are simple and require very little transit buffering. However because of their linear structure, the total throughput is restricted by the transmission rate of the media ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Schemes for slot reuse in CRMA

    Publication Year: 1994, Page(s):269 - 278
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (960 KB)

    Several schemes for slot reuse in CRMA are studied. A major challenge in CRMA is to incorporate slot reuse together with continuous message transmissions, i.e., to ensure that every message is transmitted in a stream of contiguous slots on the bus. Schemes based on the ideas of erasure nodes and destination release are developed and simulation results are presented View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On protective buffer policies

    Publication Year: 1994, Page(s):240 - 246
    Cited by:  Papers (16)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    Studies buffering policies which provide different loss priorities to packets/cells, while preserving packet ordering (space priority disciplines). These policies are motivated by the possible presence, within the same connection, of packets with different loss probability requirements or guarantees, e.g., voice and video coders or rate control mechanisms. The main contribution of the paper is the... View full abstract»

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

    Publication Year: 1994, Page(s):252 - 262
    Cited by:  Papers (2)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1028 KB)

    Investigates the problem of management and control in a large and, for simplicity, homogeneous packet-switched network. Specifically the authors focus on routing, an important function of network management. The network consists of several individually controlled domains. Domains are interconnected via gateway links. Each domain is controlled by its own network control center, while the overall ne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The design and analysis of an ATM multicast switch with adaptive traffic controller

    Publication Year: 1994, Page(s):288 - 298
    Cited by:  Papers (29)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (848 KB)

    The paper describes several improvements to a nonblocking copy network proposed previously for multicast packet switching. The improvements provide a complete solution to some system problems inherent in multicasting. The input fairness problem caused by overflow is solved by a cyclic running adder network (CRAN), which can calculate running sums of copy requests starting from any input port. The ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient algorithm for virtual topology design in multihop lightwave networks

    Publication Year: 1994, Page(s):217 - 225
    Cited by:  Papers (18)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    One of the major challenges in the virtual topology design of a WDM star based system, is to incorporate in the optimization process both realistic objective functions and real system behavior. The authors present an efficient discrete optimization algorithm that meets these goals while incorporating the prevailing traffic conditions. They simulate the real system and then approximate the objectiv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • “Session swapping”: a new approach for optimal bandwidth sharing of ring circuit switched channels

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

    The paper introduces a new approach, called session swapping, for bandwidth sharing of circuit switched channels in a ring network. This approach enables to divide a single channel among several sessions in a fair manner, with no loss of bandwidth. According to this approach, packets are removed from the ring before reaching their destination, and retransmitted later. The paper proves that any pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of hypercube routing schemes with or without buffering

    Publication Year: 1994, Page(s):299 - 311
    Cited by:  Papers (9)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1140 KB)

    Considers two different hypercube routing schemes, which are called the simple and the priority schemes. The authors evaluate the throughput of both the unbuffered and the buffered version of these schemes for random multiple node-to-node communications. The results obtained are approximate, but very accurate as simulations indicate, and are given in particularly interesting forms. They find that ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network transparency: the plaNET approach

    Publication Year: 1994, Page(s):226 - 239
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1532 KB)

    Fast packet-switching has been chosen as the basis for future high speed, “universal” networks. The successful deployment of such networks will clearly depend on a wide range of factors such as cost and technology, but the authors believe that foremost among all is how well they will support existing and future applications. Emphasizing an application oriented perspective is one of the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polynomial time optimal algorithms for time slot assignment of variable bandwidth systems

    Publication Year: 1994, Page(s):247 - 251
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB)

    Considers the optimal (i.e., minimum length) time slot assignment problem for variable bandwidth switching systems. Existing algorithms for this problem are known to be pseudo-polynomial. The practical question of finding a fast optimal algorithm, as well as the theoretical question of whether the above problem is NP-complete were left open. The authors present a technique to show polynomial time ... 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