Performance guarantees in communication networks
bandwidth functionconstrained traffic regulationdelaydeterministic boundsdynamic service guaranteesfilteringmin-plus algebramultiple inputs and multiple outputspacket loss probabilitiesperformance guaranteesqueue lengthtail distributionstelecommunication networkstraffic characterization
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Network design and communication in computer systems (68M10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Communication networks in operations research (90B18)
Performance is one of the key factors that influences the design, development, configuration and tuning of computer and communication systems. The author introduces the theoretical development in the last decade for performance guarantees in telecommunication networks. This volume presents a comprehensive and up-to-date treatment of the recent developments in performance guarantees for telecommunication networks. The book consist of two parts. The first part deals with deterministic (hard) guarantees, where the author shows how deterministic bounds for delay and queue length can be achieved. The second part addresses stochastic (soft) guarantees, focusing mainly on tail distributions of queue lengths and packet loss probabilities. For the deterministic theory he introduces a new traffic characterization by \textit{Rene Cruz} [IEEE Trans. Inf. Theory 37, 114-131, 132-141 (1991; Zbl 0712.94028)] and the associated calculus for multiplexing, work conserving links, output characterization and routing. This concept is generalised and explained systematically by a filtering theory under the min-plus algebra. The stochastic theory introduces the effective bandwidth function for traffic characterization. Its associated calculus is then built upon the mathematical theory of the large deviation principle. The first six chapters deal with deterministic guarantees. Chapter 1 deals with the \((\sigma,\rho)\)-traffic characterization and its associated calculus. Chapter 2 develops the filtering theory under the \((\min,+)\) algebra, where one replaces the usual addition by the min operator and the usual multiplication by the addition operator. Chapter 3 addresses the parameterization problem for the constraint functions needed for deterministic traffic regulation and service guarantees. Chapter 4 extends the filtering theory to the matrix setting so that systems with multiple inputs and multiple outputs (MIMO) can be analyzed. Chapter 5 solves the problem of constrained traffic regulation and develops a calculus for dynamic service guarantees. Chapter 6 introduces a direct treatment for providing deterministic quality-of-service guarantees in networks with variable length packets. The last three chapters discuss stochastic service guarantees and theory of effective bandwidth based on the author's work [IEEE Trans. Autom. Control 39, 913-931 (1994; Zbl 0818.90050)]. Chapter 7 discusses stochastic ordering of random variables and exponential upper and lower bounds. Chapter 8 introduces the large deviation principle and the last chapter obtains the lower bounds for bandwidth via the large deviation principle. The treatment is not only more appropriate for understanding, but even more effective. The work provides an easily accessible, but concise introduction to the subject. The book also covers a broad spectrum of interesting problems. Both graduate students and professionals will find the book an understandable, absorbing and penetrating treatment of a beautiful theory.
- A general framework for deterministic service guarantees in telecommunication networks with variable length packets
- Stochastic network calculus.
- Network calculus. A theory of deterministic queueing systems for the Internet
- Effective bandwidths and performance bounds in high-speed communication systems
- On deterministic traffic regulation and service guarantees: a systematic approach by filtering
- An algorithmic toolbox for network calculus
- A computation method for providing statistical performance Guarantee to an ATM switch
- \(m\)-balanced words: A generalization of balanced words
- Delay analysis and optimality of the renewal access protocol
- Adaptive tuning of network traffic policing mechanisms for DDoS attack mitigation systems
- Optimal design for dynamic spectrum access in cognitive radio networks under Rayleigh fading
- Analyzing weighted round robin policies with a stochastic comparison approach
- Cross-layer modeling and optimization of multi-channel cognitive radio networks under imperfect channel sensing
- Management of quality of service through chance-constraints in multimedia networks
- A calculus for network delay. I. Network elements in isolation
- An overview for Markov decision processes in queues and networks
- Stochastic bounds in Fork-Join queueing systems under full and partial mapping
- Envelope modeling of renewable resource variability and capacity
- Stochastic network calculus.
- Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint
- On the Identifiability of Link Service Curves from End-Host Measurements
- Indexes of a telecommunication network
- Numerical analysis of worst-case end-to-end delay bounds in FIFO tandem networks
- Application of network calculus to guaranteed service networks
- On deterministic traffic regulation and service guarantees: a systematic approach by filtering
- A general framework for deterministic service guarantees in telecommunication networks with variable length packets
- Stochastic bounds and histograms for active queues management and networks analysis
- Container of (min,+)-linear systems
- QoS in Packet Networks
- Evaluation and improvement of response time bounds for real-time applications under non-pre-emptive Fixed Priority Scheduling
- On the stochastic end-to-end delay analysis in sink trees under independent and dependent arrivals
- A mathematical framework for delay analysis in single source networks
- Timing analysis of rate-constrained traffic in TTEthernet using network calculus
- A Stochastic Ordering Property for Leaky Bucket Regulated Flows in Packet Networks
- Network calculus. A theory of deterministic queueing systems for the Internet
- Extending the network calculus algorithmic toolbox for ultimately pseudo-periodic functions: pseudo-inverse and composition
- Markov decision processes with burstiness constraints
- Asymptotic identity in min-plus algebra: a report on CPNS
- MGF-based SNC for stationary independent Markovian processes with localized application of martingales
- A new delay control method for real-time flows
This page was built for publication: Performance guarantees in communication networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4936327)
