Skip to main content
SpringerLink
Log in
Book cover

Canadian Workshop on Information Theory

ITA 1993: Information Theory and Applications pp 296–309Cite as

Overflow constraint in hybrid nodes with movable boundary scheme

  • Networks and Information Theory
  • Conference paper
  • First Online:

  • 162 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 793))

Abstract

The heterogeneous nature of traffic sources into the Broadband Integrated Services Digital Network (B-ISDN) Communication systems requires the switching centers to allocate resources dynamically. The strategy used to allocates the resources among these streams should consider their particular requirements. We are considering a system with two input traffic, one with high priority which can tolerate some loss, and the lower priority which cannot experience any loss. The switching scheme is a movable boundary system with overflow traffic. This system bounds the observed delay by the overflow traffic by restricting their access.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Delic and P. Papantoni-Kazakos. An optimal policy for competitive processing of high and low priority arrivals. Int'l J. Digital and Analog Commun. Systems, 4:209–224, 1991.

    Google Scholar 

  2. B. Kraimeche and M. Schwartz. Analysis of traffic control strategies in integrated service network. IEEE Trans. Commun., COM-33(10):1085–1093, October 1985.

    Google Scholar 

  3. H. Delic and P. Papantoni-Kazakos. A class os scheduling policies for mixed media data with renewal arrival processes. IEEE Trans. Automatic Control, 38:455–459, March 1993.

    Google Scholar 

  4. I. Lambadaris, X. Chen, J.F. Hayes, and F.G. Moghaddam. Performance evaluation of a circuit-switched node with queuable overflow traffic. Proceedings of Int'l Conf. Commun. in Chicago, pages 516–520, June 1992.

    Google Scholar 

  5. Marcel F. Neuts. Matrix Geometric Solutions in Stochastic Models. Johns Hopkins University Press, Baltimore, Maryland, 1981.

    Google Scholar 

  6. A. Kuczura. The interrupted poisson process as an overflow process. Bell Syst. Tech. J., 52(3):437–448, March 1973.

    Google Scholar 

  7. U. Yechiali and P. Naor. Queuing problems with heterogeneous arrivals and service. Operations Research, 19:722–734, 1971.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, Concordia University, Montréal, Québec

    F. Ghazi-Moghaddam & J. F. Hayes

  2. Department of Systems and Computer Engineering, Carleton University, Ottawa, Ontario

    I. Lambadaris

Authors
  1. F. Ghazi-Moghaddam
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. Lambadaris
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. F. Hayes
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

T. Aaron Gulliver Norman P. Secord

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ghazi-Moghaddam, F., Lambadaris, I., Hayes, J.F. (1994). Overflow constraint in hybrid nodes with movable boundary scheme. In: Gulliver, T.A., Secord, N.P. (eds) Information Theory and Applications. ITA 1993. Lecture Notes in Computer Science, vol 793. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57936-2_46

Download citation

  • DOI: https://doi.org/10.1007/3-540-57936-2_46

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57936-6

  • Online ISBN: 978-3-540-48392-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation