ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Performance Evaluation
Volume 63, Issues 9-10, October 2006, Pages 892-909
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (1107 K)

Article Toolbox
  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.peva.2005.10.001    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2006 Published by Elsevier B.V.

Nonstationary analysis of circuit-switched communication networks

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Khalid Abdulaziz Alnowibeta and Harry Perrosb, Corresponding Author Contact Information, E-mail The Corresponding Author

aDepartment of Statistics and Operations Research, King Saud University, Riyadh 1145, Saudi Arabia

bComputer Science Department, NC State University, Raleigh, NC 27695-7534, United States


Received 5 July 2004; 
revised 23 September 2005. 
Available online 28 November 2005.

Abstract

Circuit-switched communication networks have been analyzed extensively in the stationary case, i.e. where the arrival and/or service rates are independent of time. In this paper, we study a circuit-switched network where the rates of external arrivals at the network are time-dependent functions. The circuit-switched network is modelled as a nonstationary queueing network with population constraints, which is analyzed approximately in order to obtain the blocking probability functions. Using this method we model two circuit-switched networks, namely, a traffic-groomed tandem optical network and a single-orbit LEO satellite network.

Keywords: Queueing networks; Nonstationary arrivals; Circuit-switched networks; Traffic grooming; LEO satellite networks

Article Outline

1. Introduction
2. The nonstationary queueing network with multi-rate loss queues
2.1. The nonstationary single-class loss queue
2.2. The nonstationary multi-rate loss queue
2.3. The nonstationary queueing network with multi-rate loss queues
3. The nonstationary queueing network with multi-rate loss queues and population constraints
4. Applications and numerical examples
4.1. Nonstationary analysis of a traffic-groomed tandem optical network
4.2. A single-orbit LEO satellite network
5. Conclusions
Acknowledgements
References
Vitae









Corresponding Author Contact InformationCorresponding author.

Performance Evaluation
Volume 63, Issues 9-10, October 2006, Pages 892-909
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.