A Robust Connection Admission Control Applicable to Long Range Dependence Traffic (Special Issue on ATM Traffic Control and Performance Evaluation)
スポンサーリンク
概要
- 論文の詳細を見る
In this paper an algorithm of Connection Admission Control in ATM is considered.It is shown that it works under many different kinds of dependence among arrivals, including long range dependence.This point is relevant, since recent papers show that ATM traffic is characterised by self-similarity, and hence by long range dependence.An upper bound for CLR is given, without assuming any specific cell arrival process.Applications to simulated and real data (obtained by segmenting and shaping Ethernet packets) are considered.They show the goodness and the tightness of the considered upper bound.
- 社団法人電子情報通信学会の論文
- 1998-05-25
著者
-
SAITO Hiroshi
NTT Multimedia Networks Laboratories
-
Conti Pier
The Dipartimento Di Statistica Probabilita E Statistiche Applicate University Of "la Sapienza
-
DE GIOVANNI
the University of Molise
関連論文
- Sizing and Provisioning for Physical and Virtual Path Networks Using Self-Sizing Capability (Special Issue on Telecommunications Network Planning and Design)
- A Robust Connection Admission Control Applicable to Long Range Dependence Traffic (Special Issue on ATM Traffic Control and Performance Evaluation)
- Congestion Control through Network Money
- CELL-LOSS-RATIO ANALYSIS WITH INSUFFICIENT KNOWLEDGE OF TRAFFIC CHARACTERISTICS
- Connection Admission Control Guaranteeing Negotiated Cell-Loss Ratio of Cell Streams Passing through Usage Parameter Control