ACM Home Page
Please provide us with feedback. Feedback
Measurement-based admission control at edge routers
Full text PdfPdf (653 KB)
Source IEEE/ACM Transactions on Networking (TON) archive
Volume 16 ,  Issue 2  (April 2008) table of contents
Pages 410-423  
Year of Publication: 2008
ISSN:1063-6692
Authors
Seung Yeob Nam  Department of Information and Communication Engineering, Yeungnam University, Gyeongsan, Korea and CNR Lab, Korea Advanced Institute of Science and Technology (KAIST) and the CyLab, Carnegie Mellon University
Sunggon Kim  Department of Information Statistics, Gyeongsang National University, Jinju, Korea
Dan Keun Sung  Division of Electrical Engineering, School of Electrical Engineering and Computer Science, KAIST, Daejeon, Korea
Publisher
IEEE Press  Piscataway, NJ, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 134,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: 10.1109/TNET.2007.900403

ABSTRACT

It is very important to allocate and manage resources for multimedia traffic flows with real-time performance requirements in order to guarantee quality of service (QoS). In this paper, we develop a scalable architecture and an algorithm for admission control of real-time flows. Since individual management of each traffic flow on each transit router can cause a fundamental scalability problem in both data and control planes, we consider that each flow is classified at the ingress router and data traffic is aggregated according to the class inside the core network as in a DiffServ framework. In our approach, admission decision is made for each flow at the edge (ingress) routers, but it is scalable because per-flow states are not maintained and the admission algorithm is simple. In the proposed admission control scheme, an admissible bandwidth, which is defined as the maximum rate of a flow that can be accommodated additionally while satisfying the delay performance requirements for both existing and new flows, is calculated based on the available bandwidth measured by edge routers. The admissible bandwidth is a threshold for admission control, and thus, it is very important to accurately estimate the admissible bandwidth. The performance of the proposed algorithm is evaluated by taking a set of simulation experiments using bursty traffic flows.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
 
4
[4] E. Lochin, L. Dairaine, and G. Jourjon, "gTFRC, a TCP friendly QoS-aware rate control for DiffServ assured service," Telecommun. Syst., vol. 33, no. 1-3, pp. 3-21, Dec. 2006.
 
5
6
 
7
[7] F. P. Kelly, P. B. Key, and S. Zachary, "Distributed admission control," IEEE J. Sel. Areas Commun., vol. 18, no. 12, pp. 2617-2628, Dec. 2000.
 
8
[8] S. Crosby et al., "Statistical properties of a near-optimal measurement-based CAC algorithm," in Proc. IEEE ATM'97, May 1997, pp. 103-112.
 
9
 
10
[10] S. Floyd, "Comments on "Measurement-based admission control for controlled-load services"," Lawrence Berkeley Lab., Tech. Rep., Jul. 1997.
 
11
[11] R. Gibbens and F. Kelly, "Measurement-based connection admission control," in 15th Int. Teletraffic Congr., Jun. 1997.
 
12
[12] R. J. Gibbens, F. P. Kelly, and P. B. Key, "A decision-theoretic approach to call admission control in ATM networks," IEEE J. Sel. Areas Commun., vol. 13, no. 6, pp. 1101-1114, Aug. 1995.
13
 
14
[14] M. Grossglauser and D. Tse, "A time-scale decomposition approach to measurement-based admission control," in Proc. IEEE INFOCOM, Mar. 1999, vol. 3, pp. 1539-1547.
 
15
 
16
 
17
[17] L. Breslau and S. Jamin, "Comments on the performance of measurement-based admission control algorithms," in Proc. IEEE INFOCOM, Mar. 2000, vol. 3, pp. 1233-1242.
 
18
[18] R. Guerin, H. Ahmadi, and M. Naghshineh, "Equivalent capacity and its application to bandwidth allocation in high-speed networks," IEEE J. Sel. Areas Commun., vol. 9, no. 7, pp. 968-981, Sep. 1991.
 
19
[19] A. Elwalid, D. Mitra, and R. H. Wentworth, "A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in an ATM node," IEEE J. Sel. Areas Commun., vol. 13, no. 6, pp. 1115-1127, Aug. 1995.
 
20
[20] F. P. Kelly, "Note on effective bandwidth," in Stochastic Networks: Theory and Applications, ser. Royal Statistical Society Lecture Notes, F. P. Kelly, S. Zachary, and I. B. Ziedins, Eds. London, U.K.: Oxford Univ. Press, 1996, vol. 4, pp. 141-168.
 
21
 
22
[22] J. Beran, R. Sherman, M. S. Taqqu, and W. Willinger, "Long-range dependence in variable bit rate video traffic," IEEE Trans. Commun., vol. 43, no. 2/3/4, pp. 1566-1579, Feb./Mar./Apr. 1995.
23
 
24
[24] S. Kim, J. Y. Lee, and D. K. Sung, "A shifted gamma distribution model for long-range dependent Internet traffic," IEEE Commun. Lett., vol. 7, no. 3, pp. 124-126, Mar. 2003.
 
25
[25] N. G. Duffield and N. O'Connell, "Large deviations and overflow probabilities for the general single-server queue, with applications," Math. Proc. Cambridge Philos. Soc., vol. 118, pp. 363-374, 1995.
 
26
[26] J. R. Gallardo, D. Makrakis, and M. Angulo, "Dynamic resource management considering the real behavior of aggregate traffic," IEEE Trans. Multimedia, vol. 3, no. 2, pp. 177-185, Jun. 2001.
 
27
 
28
[28] C. Cetinkaya, V. Kanodia, and E. W. Knightly, "Scalable services via egress admission control," IEEE Trans. Multimedia, vol. 3, no. 1, pp. 69-81, Mar. 2001.
 
29
[29] S. Y. Nam, S. Kim, and D. K. Sung, "Estimation of available bandwidth for an unidentified queueing system," KAIST, Daejeon, Korea, Tech. rep. KAIST-CNR-06-01, 2006.
 
30
[30] S. Y. Nam, S. Kim, J. Kim, and D. K. Sung, "Probing-based estimation of end-to-end available bandwidth," IEEE Commun. Lett., vol. 8, no. 6, pp. 400-402, Jun. 2004.
 
31
[31] S. Y. Nam, "Available bandwidth estimation and measurement-based admission control in IP networks," Ph.D. thesis, Dept. EECS, KAIST, Daejeon, Korea, 2004.
 
32
[32] S. Karlin and H. M. Taylor, A First Course in Stochastic Processes, 2nd ed. New York: Academic, 1975.
 
33
[33] One-Way Transmission Time, ITU-T Recommendation G.114, May 2000.
 
34
[34] A. Shriram and J. Kaur, "Empirical study of the impact of sampling timescales and strategies on measurement of available bandwidth," in Proc. Passive and Active Measurement (PAM) Conf., Mar. 2006.
 
35
[35] B. Melander, M. Bjorkman, and P. Gunningberg, "A new end-to-end probing and analysis method for estimating bandwidth bottlenecks," in Proc. IEEE Globecom, Nov. 2000, pp. 415-421.
 
36
[36] M. Jain and C. Dovrolis, "Pathload: A measurement tool for end-to-end available bandwidth," in Proc. Passive and Active Measurements (PAM) Workshop, Mar. 2002.
 
37
[37] N. Hu and P. Steenkiste, "Evaluation and characterization of available bandwidth probing techniques," IEEE J. Sel. Areas Commun., vol. 21, no. 6, pp. 879-894, Aug. 2003.
 
38
[38] R. H. Riedi, M. S. Crouse, V. J. Ribeiro, and R. G. Baraniuk, "A multifractal wavelet model with application to network traffic," IEEE Trans. Inf. Theory, vol. 45, no. 3, pp. 992-1018, Apr. 1999.
 
39
[39] Services and Service Capabilities, 3GPP Technical Specification 22.105.
 
40
[40] Quality of Service (QoS) Concept and Architecture, 3GPP Technical Specification 23.107.
 
41
[41] R. W. Wolff, Stochastic Modeling and the Theory of Queues. Englewood Cliffs, NJ: Prentice-Hall, 1989.

Collaborative Colleagues:
Seung Yeob Nam: colleagues
Sunggon Kim: colleagues
Dan Keun Sung: colleagues