A Superposition of Bursty Sources in a LAN Interconnection Environment

  • Johan M. Karlsson


Designed as a solution for future public networks, ATM is now quickly being adapted to low cost LANs and private networks. As a true international standard, it is already widely supported by the communications and computer industries as a way of ensuring interoperability and protecting existing and future investments. The rapid changes in technology and service requirements make it increasingly important to find an efficient way to evaluate different network configurations. The problem with a different evolution of raw computing power, memory size and communication rates is pointed out. A LAN interconnection scenario is discussed, and a model (IBP) for bursty arrivals is presented. Finally, a queuing model with superposition of these bursty sources as arrival process is developed in order to capture the behaviour of a LAN interconnection environment. The resulting arrival process has two important characteristics: firstly, it captures the periodical behaviour due to the deterministic character of a single active source and secondly, the new process is modulated by the number of sources connected.


Time Slot Arrival Rate Buffer Size Arrival Process Local Area Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    CCITT Recommendation, I Series (B-ISDN), Nov, 1990.Google Scholar
  2. [2]
    C. E. Catlett, ”Balancing resources”, IEEE Spectrum, Sept, 1992. Google Scholar
  3. [3]
    CCITT Recommendation, H and J series, Nov, 1988.Google Scholar
  4. [4]
    K. Sriram and W. Whitt, ”Characterizing superposition arrival processes in packet multiplexers for voice and data”, IEEE Journal on Selected Areas in Communications, vol. 4, no. 6, Sept, 1986. CrossRefGoogle Scholar
  5. [5]
    J. S. Kaufman, ”Blocking in a Shared Resource Environment”, IEEE Transactions on Communications, Vol 29, No. 10, October 1981. Google Scholar
  6. [6]
    J. D. C. Little, ”A Proof of the Queueing Formula L = λW”, Operations Research, No. 9, 1961. Google Scholar
  7. [7]
    D. Anick, D. Mitra and M. M. Sondhi, ”Stochastic theory of a data handling system with multiple sources”, Bell Syst. Technical Journal, vol. 61, 1982. Google Scholar

Copyright information

© Springer Science+Business Media New York 1993

Authors and Affiliations

  • Johan M. Karlsson
    • 1
  1. 1.Department of Communication SystemsLund Institute of TechnologyLundSweden

Personalised recommendations