Notice
There is currently an issue with the citation download feature. Learn more

IEEE Transactions on Communications

Issue 4 • April 1981

Filter Results

Displaying Results 1 - 20 of 20
  • [Front cover and table of contents]

    Publication Year: 1981, Page(s): 0
    Request permission for commercial reuse | PDF file iconPDF (234 KB)
    Freely Available from IEEE
  • Congestion Control: Preview and Some Comments

    Publication Year: 1981, Page(s):373 - 375
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (377 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routing, Flow, and Congestion Control in the Datapac Network

    Publication Year: 1981, Page(s):386 - 391
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (713 KB)

    Datapac is the TransCanada Telephone System's public packet-switched network, based on the Northern Telecom SL-10 Packet Switching System. The primary packet-switched communications facility offered by the SL-10 in Datapac is a virtual circuit service for which several types of customer interfaces are available. The virtual circuit service relies on a datagram facility for basic internodal communi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new approach to performance-oriented flow control

    Publication Year: 1981, Page(s):427 - 435
    Cited by:  Papers (66)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (942 KB)

    Flow control is proposed as a means of obtaining an "optimal tradeoff" between low delay and high throughput in computer networks. Several versions of "optimal tradeoff" are defined based on network power. A class of algorithms which attempt to optimize network performance are investigated. These algorithms operate on the design principles of dynamic, distributed execution and use of local informa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Need for Adaptive Routing in the Chaotic and Unbalanced Traffic Environment

    Publication Year: 1981, Page(s):481 - 490
    Cited by:  Papers (13)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1020 KB)

    By classifying traffic conditions into four categories, we investigate the preference for a deterministic or an adaptive routing strategy with respect to a traffic category. The four categories are: 1) balanced, emulating known and stationary traffic conditions; 2) balanced with surge, emulating a balanced traffic condition with possible unexpected sudden increases in traffic demands between some ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • [Back cover]

    Publication Year: 1981, Page(s): 0
    Request permission for commercial reuse | PDF file iconPDF (331 KB)
    Freely Available from IEEE
  • Analysis of Packet Network Congestion Control Using Sparse Matrix Algorithms

    Publication Year: 1981, Page(s):453 - 465
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (920 KB)

    The purpose of this study is twofold. First the study illustrates the utility of applying sparse matrix methods to packet network models. Secondly, these methods are used to give new results about the control of store and forward congestion in packet networks. Store and forward congestion (node to node blocking) reduces the effective traffic carrying capacity of the network by unnecessarily idling... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Drop and Throttle Flow Control Policy for Computer Networks

    Publication Year: 1981, Page(s):444 - 452
    Cited by:  Papers (16)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    Store-and-forward packet switched networks are subject to congestion under heavy load conditions. In this paper a distributed drop and throttle flow control (DTFC) policy based on a nodal buffer management scheme is proposed. Two classes of traffic are identified: "new" and "transit" traffic. Packets that traveled over one or more hops are considered as transit packets. Packets that are candidates... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Advances in Verifiable Fail-Safe Routing Procedures

    Publication Year: 1981, Page(s):491 - 497
    Cited by:  Papers (12)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB)

    Two new versions of a distributed protocol for establishing and maintaining loop-free routing tables for communication networks with changing topology are presented. The protocols here possess significant advantages over previous versions in terms of complexity of the node algorithm and of the validation procedure, as well as the communication and storage needs. In addition, we present a procedure... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flow Control Based on Buffer Classes

    Publication Year: 1981, Page(s):436 - 443
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (760 KB)

    The problem of combining flow control and deadlock prevention is considered from a technical point of view. A possible solution is provided by congestion control based on buffer classes, which have been implemented within the GMD-network. This approach facilitates the realization of many variants of flow control mechanisms by adaptation of buffer class limits to the traffic conditions. Some of the... 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 a Semidynamic Deterministic Routing Rule

    Publication Year: 1981, Page(s):498 - 504
    Cited by:  Papers (23)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    The best deterministic rule, newly proposed in this paper is similar in nature to the best stochastic rule [3], except that 1) a maximum traffic bifurcation flow distribution is chosen and 2) deterministic routing sequences are used. Analysis shows that the best deterministic rule always gives better delay performance than the best stochastic rule. A semidynamic version of this rule is introduced ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Technique for Adaptive Routing in Networks

    Publication Year: 1981, Page(s):474 - 480
    Cited by:  Papers (8)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (840 KB)

    A two-level adaptive routing scheme for packet-switched computer communication networks is proposed and investigated. The first level is quasi-static and based on the global network status. The second level is dynamic with decisions being made at each node in an attempt to obtain the savings in average delay predicted by a multiserver model of the node. Simulations confirm the predicted improvemen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Prevention of Deadlocks in Packet-Switched Data Transport Systems

    Publication Year: 1981, Page(s):512 - 524
    Cited by:  Papers (92)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1656 KB)

    This paper first Surveys a number of potential deadlocks inherent in store-and-forward networks and outlines corresponding countermeasures. It then goes on to a more detailed treatment of the most important deadlock types. Finally, necessary and sufficient conditions are given and proven for the use of process ordering and generalized resource ordering techniques to avoid deadlocks in arbitrary sy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Traffic Measurements in Data Networks, Recent Measurement Results, and Some Implications

    Publication Year: 1981, Page(s):525 - 535
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1040 KB)

    Traffic statistics are a necessary base for network modeling, performance analysis, and network traffic control. This paper deals with results of recent traffic measurements in teleprocessing systems and their implications. In the introductory sections the range of traffic measurement problems in present networks and publications in the field of measurement results are surveyed. The main parts foc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Theory of Flow Control in Shared Networks and Its Application in the Canadian Telephone Network

    Publication Year: 1981, Page(s):399 - 413
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1416 KB)

    A shared network is largely oversubscribed by independent users who make random demands on the network. Network flow control is required for the orderly operation of the network under all potential traffic loads. This paper presents a qualitative analysis of the theory of flow control to circuit-switched and packet-switched networks and pro- ,. poses 4 complementary controls and 1 subtended contro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Join-Biased-Queue Rule and Its Application to Routing in Computer Communication Networks

    Publication Year: 1981, Page(s):505 - 511
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    A routing rule similar in nature to delta-routing [8] is studied in this paper. The approach is to superimpose, local adaptivity on top of a fixed traffic flow distribution. The fixed flow distribution we choose is obtained from the best stochastic (BS) rule [3]. The adaptive part is called the join-biased-queue (JBQ) rule. The resultant JBQ-BS rule is analyzed on small networks and is shown to pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network Management and Congestion in the U.S. Telecommunications Network

    Publication Year: 1981, Page(s):376 - 385
    Cited by:  Papers (26)  |  Patents (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1176 KB)

    Several significant steps have been taken to respond to the need for better network management for the evolving U.S. telecommunications network. The current approach provides an economical balance between automatic and manual network management capabilities. With the rapid introduction of Stored Program Controlled (SPC) switching systems and the Common Channel Interoffice Signaling (CCIS) system, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Methods, Tools, and Observations on Flow Control in Packet-Switched Data Networks

    Publication Year: 1981, Page(s):413 - 426
    Cited by:  Papers (15)  |  Patents (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1696 KB)

    Flow control covers several concepts. In an end-to-end connection, it intends to adapt sender's output to receiver's capabilities. In a shared resources communication network, it attempts to prevent congestion by restricting traffic flows. Flow control mechanisms are built with a small number of basic throttling tools. However, they are always tied into a resource management problem, which depends... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routing and Flow Control in TYMNET

    Publication Year: 1981, Page(s):392 - 398
    Cited by:  Papers (44)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (872 KB)

    TYMNET uses two mechanisms for moving data: a tree structure for supervisory control of the original network and a virtual circuit approach for everything else. Each mechanism is described. The routing and flow control is contrasted with ideal routing and flow control, and also with conventional packet-switched networks. One of the mechanisms described, the virtual circuit as implemented in TYMNET... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flow Control in Packet-Switched Networks by Gradual Restrictions of Virtual Calls

    Publication Year: 1981, Page(s):466 - 473
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    A network flow control method in virtual circuit-oriented packet-switched networks, such as international packet-switched networks based on the CCITT X.75 protocol, is proposed. Lengths of individual queues to outgoing routes are observed constantly in a switch (or node), and the virtual calls connected to a congested outgoing route are restricted gradually depending upon the queue length. Being p... View full abstract»

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

Aims & Scope

IEEE Transactions on Communications focuses on all telecommunications including telephone, telegraphy, facsimile, and point-to-point television by electromagnetic propagation.

 

 

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Naofal Al-Dhahir
University of Texas at Dallas