CLAMP: Differentiated capacity allocation in access networks

被引:8
作者
Andrew, L [1 ]
Hanly, S [1 ]
Mukhtar, R [1 ]
机构
[1] Univ Melbourne, Dept Elect & Elect Engn, ARC Special Res CUBINA, Parkville, Vic 3052, Australia
来源
2003 IEEE INTERNATIONAL PERFORMANCE, COMPUTING, AND COMMUNICATIONS CONFERENCE PROCEEDINGS | 2003年
关键词
D O I
10.1109/PCCC.2003.1203729
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents a solution for providing differentiated capacity allocation in an access network. The system is based on CLAMP, an algorithm that can differentiate between flows sharing the same FIFO queue. The system is suitable for access networks, such as those based on DSL and HFC modems and wireless LAN access points. The deployment of CLAMP is completely contained within the access network; no changes to the remainder of the network are required. CLAMP provides the opportunity to enforce local policies on TCP flows that originate from sources distributed globally. The performance of CLAMP is verified by both simulation and analysis.
引用
收藏
页码:451 / 458
页数:8
相关论文
共 14 条
[1]  
ANDREW L, 2002, P 4 AS CONTR C SING, P47
[2]  
ANDREW LLH, 2002, UNPUB CLAMP MAXIMIZI
[3]  
[Anonymous], QUEUEING SYSTEMS
[4]  
[Anonymous], 1633 RFC IETF
[5]  
[Anonymous], 1997, 2205 RFC IETF
[6]  
BLAKE S, 1998, 2475 RFC IETF
[7]   ROUND-ROBIN SCHEDULING FOR MAX MIN FAIRNESS IN DATA-NETWORKS [J].
HAHNE, EL .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1991, 9 (07) :1024-1039
[8]  
KATABI D, 2002, P ACM SIGC 2002 AUG
[9]  
LOW SH, 2002, P ITC SPEC SEM IP TR
[10]  
MORGAN S, 1989, P INFOCOM IEEE, V2, P711