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    
Theoretical Computer Science
Volume 381, Issues 1-3, 22 August 2007, Pages 44-56
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (548 K)

  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.tcs.2007.04.008    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2007 Elsevier Ltd All rights reserved.

The increase of the instability of networks due to Quasi-Static link capacitiesstar, open

Dimitrios Koukopoulosa, b, Corresponding Author Contact Information, E-mail The Corresponding Author, Marios Mavronicolasc, d, E-mail The Corresponding Author and Paul Spirakise, b, E-mail The Corresponding Author

aDepartment of Applied Informatics in Management and Finance, Technological Education Institute of Ionian Islands, Greece bRACTI, 61 Riga Fereou, 26221 Patras, Greece cDepartment of Computer Science, University of Cyprus, 1678 Nicosia, Cyprus dFaculty of Computer Science, Electrical Engineering and Mathematics, University of Paderborn, 33102 Paderborn, Germany eDepartment of Computer Engineering and Informatics, University of Patras, Greece

Received 6 February 2005; 
revised 13 February 2007; 
accepted 3 April 2007. 
Communicated by D. Peleg. 
Available online 13 April 2007.

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.

Abstract

In this work, we study the impact of the dynamic changing of the network link capacities on the stability properties of packet-switched networks. Especially, we consider the Adversarial, Quasi-Static Queuing Theory model, where each link capacity may take on only two possible (integer) values, namely 1 and C>1 under a (w,ρ)-adversary. We obtain the following results:

• Allowing such dynamic changes to the link capacities of a network with just ten nodes that uses the LIS (Longest-in-System) protocol for contention–resolution results in instability at rates View the MathML source and for large enough values of C.

• The combination of dynamically changing link capacities with compositions of contention–resolution protocols on network queues suffices for similar instability bounds: The composition of LIS with any of SIS (Shortest-in-System), NTS (Nearest-to-Source), and FTG (Furthest-to-Go) protocols is unstable at rates View the MathML source for large enough values of C.

• The instability bound of the network subgraphs that are forbidden for stability is affected by the dynamic changes to the link capacities: we present improved instability bounds for all the directed subgraphs that were known to be forbidden for stability on networks running a certain greedy protocol.

Keywords: Adversarial Queuing Theory; Adversarial Quasi-Static Queuing Theory; Network stability; Greedy protocols


 
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.