On the self-similar nature of Ethernet traffic
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Wide-area traffic: the failure of Poisson modeling
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
End-to-end performance analysis with traffic aggregation
Computer Networks: The International Journal of Computer and Telecommunications Networking - Pioneering tomorrow's Internet Selected papers from the TERENA Networking Conference 2000 22–25 May 2000, Lisbon, Portugal
Chaotic maps for traffic modelling and queueing performance analysis
Performance Evaluation
A Calculus for End-to-end Statistical Service Guarantees
A Calculus for End-to-end Statistical Service Guarantees
On the aggregation of deterministic service flows
Computer Communications
| Hi-index | 0.00 |
The scope of this paper is to derive a set of simple formulas providing a traffic aggregation in important points of an Internet access networks. The paper shows that the resources associated to the access network depend on user type-, technology and service parameter. Existing calculation methodologies applies on individual approximations whereas this proposal exposes the combined application of these individual and well-known approximations providing a scheme of generic dimensioning formulas. The dimensioning formulas for a generic applications are derived for the three main levels: connection, session and burst level, and the traffic aggregation is considered through three different and combined variables describing users, accesses and services forming a cube with three axes. The adaptation of corresponding parameters following the different axes allows the calculation of complete access network traffic scenarios, grouped by the so called CASUAL concept: Cube of Accesses / Services / Users. A set of CASUAL based tools allows an estimation of the aggregated traffic in different access points as multiplexers, IP point of presence or edge routers.