By Topic

Communications, IEEE Transactions on

Issue 12 • Date December 1978

Filter Results

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

    Publication Year: 1978 , Page(s): 0
    Save to Project icon | Request Permissions | PDF file iconPDF (262 KB)  
    Freely Available from IEEE
  • Message from the President

    Publication Year: 1978 , Page(s): 1793
    Save to Project icon | Request Permissions | PDF file iconPDF (70 KB)  
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 1978 , Page(s): 0
    Save to Project icon | Request Permissions | PDF file iconPDF (3375 KB)  
    Freely Available from IEEE
  • Combinatorial Issues in Mobile Packet Radio Networks

    Publication Year: 1978 , Page(s): 1821 - 1826
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (504 KB)  

    A Packet Radio Network is a store-and-forward packet system employing radio links. A Mobile Packet Radio Network generalizes this system by allowing every radio unit to be independently in motion. In this paper a model for the analysis of connectivity as a function of time in such a network is presented and used to solve for parameters of interest. The model and the related analysis are guides for developing procedures for monitoring connectivity. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Traffic Characteristics of the No.3 ESS Network

    Publication Year: 1978 , Page(s): 1796 - 1801
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (544 KB)  

    A traffic study and the results of a full scale simulation of the No. 3 ESS switching network are presented. Following a brief description of the network and the simulation techniques, the various parameters affecting network performance are discussed and the load-service curves are given for these parameters. In particular, the network capacity is studied for various numbers of concentrator groups and the differences between blocking probabilities of intraand interconcentrator group calls are discussed. The network is analyzed with different path-hunt algorithms. A path-hunt procedure, which yields a significantly higher average load per terminal (at objective service level) than any other tested, is found and discussed in detail. The results are first obtained for the case Where the network terminals are loaded equally. Then, the effect of a nonuniform load distribution is studied and the results are shown. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Review of the Development and Performance of the ARPANET Routing Algorithm

    Publication Year: 1978 , Page(s): 1802 - 1811
    Cited by:  Papers (33)  |  Patents (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1208 KB)  

    This paper presents a comprehensive review of the ARPANET routing algorithm, from its original implementation to our plans for future modifications. We hope that by collecting this information, and by providing considerable details, we can provide others with a useful reference document concerning some of the practical problems of network algorithm design. Much of the discussion below assumes a basic familiarity with the principles of packet switching, the ARPANET implementation, and some of the relevant terminology, information which can be found, for example, in [4]. Sections 1 and 2 give a brief summary of basic routing concepts and of the original routing algorithm, respectively. The following two sections describe in detail subsequent modifications and the actual implementation currently in use. Section 5 then discusses some problems that have developed over the past few years, as network usage has grown considerably. The final sections outline some explanations for these problems and some mechanisms for improving performance. We are in the process of implementing these and other changes to the routing algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optical Channels: Practical Limits with Photon Counting

    Publication Year: 1978 , Page(s): 1819 - 1821
    Cited by:  Papers (84)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (328 KB)  

    In optical communication, ideal amplification of the received signal leads to a limiting signaling rate of 1 nat per photon. This is much inferior to the optimum limit of kT joules/nat, which we can theoretically approach by counting photons. Practically, the rates we can attain by photon counting will be limited by how elaborate codes we can instrument rather than by thermal photons. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tracking Properties of Phase-Locked Loops in Optical Communication Systems

    Publication Year: 1978 , Page(s): 1811 - 1818
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (656 KB)  

    This paper analyzes the performance of a phase-locked loop driven by the photodetector current in an optical receiver. The variance of the phase-errors of the loop is found as a function of the relevant system parameters. The results are in good agreement with experimental data obtained via computer simulation. 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
Robert Schober
University of British Columbia