F. Baccelli, P. Br6maud, F. Brichet, L. Massoulil, J. et al., Elements of Queuing Theory, Stochastic ordering and the notion of negligible CDV. Proceedings of ITC 15, 1994.

A. Chamy and J. Boudec, Delay bounds in a network with aggregate scheduling, QofLS Workshop, 2000.

N. , G. Duftield, and N. O. Connell, Large Deviations and overflow probabilities for the general single server queue with applications, 1995.

R. , G. , F. Kelly, and P. Key, A decision theoretic approach to call admission control in ATM networks, IEEE J.SAC!, vol.13, pp.1101-1114, 1995.

P. Goyal, A. Greenberg, C. Kalmanek, W. Marshall, P. Mishra et al., integration of call signaling and resource management for 1P telephony, IEEE Network, pp.24-32, 1999.

M. Grossglauser, S. , and K. , On CBR service, IrI Proceedings of IN- FOCOM96, pp.129-137, 1996.

R. Gu&in and V. Pla, Aggregation and Conformance in Differentiated Service Networks: A Case Study, 2000.

V. , J. , K. Nichols, K. , and P. , An Expedited Forwarding PHB, 1999.

W. , M. , K. Sohraby, and C. Bidiskian, Jitter calculus in ATM netwurks, Mrrlitple nodes, IEEE/ACM Trans on Networking, vol.5, issue.1, pp.122-133, 1997.

J. Roberts, U. Mocci, J. , J. Sahni, P. Goyal et al., Broadband Network Teletraffic (Final Report of COST 242) Scheduling CBR flows: FIFO or perflow queuing, Proceedings of NOSS-DAV99, AT&T Learning Center, 1155.

R. Szekli, Stochastic Ordering and Dependence in Applied Probability, 1995.
DOI : 10.1007/978-1-4612-2528-7