Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Randomized Algorithms for Stability and Robustness Analysis of High Speed Communication
 

Summary: Randomized Algorithms for Stability and
Robustness Analysis of High Speed Communication
Networks
Tansu Alpcan1, Tamer Bas¸ar1, and Roberto Tempo2
(alpcan, tbasar)@control.csl.uiuc.edu, tempo@polito.it
Abstract-- This paper initiates a study toward developing
and applying randomized algorithms for stability of high speed
communication networks. We consider the discrete-time version
of the nonlinear model introduced in [1], which uses as feedback
variations in queueing delay information from bottleneck nodes
of the network. We then linearize this nonlinear model around
its unique equilibrium point at a single bottleneck node, and
perform a robustness analysis for a special, symmetric case, where
certain utility and pricing parameters are the same across all
active users. In this case, we derive closed-form necessary and
sufficient conditions for stability and robustness under parameter
variations. In addition, the ranges of values for the utility
and pricing parameters for which stability is guaranteed are
computed exactly. These results also admit counterparts for the
case when the pricing parameters vary across users, but the

  

Source: Alpcan, Tansu - Deutsche Telekom Laboratories & Technische Universität Berlin

 

Collections: Engineering