簡易檢索 / 詳目顯示

研究生: 施小中
Shi, Xiao-Zhong
論文名稱: 探討壅塞相依封包丟棄機制於差異式服務網路流量管理之研究
A congestion-sensitive packet dropping mechanism for differentiated service network
指導教授: 吳植森
Wu, Chih-Sen
李賢得
Lee, Shine-Der
學位類別: 碩士
Master
系所名稱: 管理學院 - 資訊管理研究所
Institute of Information Management
論文出版年: 2008
畢業學年度: 96
語文別: 英文
論文頁數: 70
中文關鍵詞: 差異式服務網路取樣方法線性區別主動式佇列管理
外文關鍵詞: AQM, FLD, samplingv, DiffServ
相關次數: 點閱:60下載:1
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 隨著多媒體應用程式的發展以及使用者客製化的需求,使得目前網際網路所採用的盡力服務(Best Effort)已不能滿足這些多變化的需求。所以IETF(Internet Engineering Task Force)就提出了將服務分級之差異式服務網路(differentiated service network, DiffServ)架構來提供不同的服務品質等級的網路服務。
    在差異式服務網路當中,核心伺服器(core router)使用隨機早期偵測(Random Early Detection, RED)演算法,此演算法的缺點在於當網路發生壅塞時會以隨機挑選並丟棄網路上封包來維持流量穩定,如此一來會使得路由器的佇列長度變化太大而造成不可預期的佇列延遲。本論文設計了一個在差異式服務網路架構下,以費雪線性區別(Fisher Linear Discriminate, FLD)為基礎,具有壅塞相依的封包丟棄器。使用FLD計算封包丟棄機率除了可以減少運算時間外,還可以避免在RED演算法中隨機挑選丟棄封包的缺點。除此之外,在挑選FLD函數時所需的樣本數上,本論文所提出的壅塞相依的取樣方法會針對實際網路流量的壅塞程度來決定應取樣的樣本間隔及大小,然後挑選出適當的封包數來建立封包丟棄器。
    本論文使用NS2模擬軟體來模擬一個具有動態流量變化及壅塞的網路環境,並與其他著名的主動式佇列管理(Active Queue Management, AQM)方法如RED比較,模擬的結果針對各類別的服務速率、佇列變化、點對點之間的延遲、延遲誤差及傳輸率都有良好的成效和顯著的改善,而壅塞敏感性的取樣方法在偵測實際網路流量上也有顯著的效果。

    The internet is being used by business and user communities with diversified quality of service expectations (QoS), leading to applications with different QoS levels requirements. The Internet Engineering Task Force (IETF) has proposed differentiated service (DiffServ) to provide class-based QoS in IP-based networks for traffic management.
    In a DiffServ network, the core routers use the Random Early Detection (RED) algorithm, which performs random packet dropping schemes when congestion occurs. Since RED follows the probability dropping mechanism, it cannot stabilize the queue length variation, and therefore leads to unpredictable end-to-end delay and jitter. This thesis designs a packet dropping mechanism with a congestion-sensitive sampling method for DiffServ based on the Fisher Linear Discriminate (FLD) approach. Using FLD can abbreviate the calculation of the packet dropping probability and generate the random number which is necessary for all RED schemes. In addition, the congestion-sensitive sampling method obtains a good approximation of the network flow distribution, and then devotes the appropriate number of samples for generating FLD functions.
    This thesis uses simulation software to simulate a congested DiffServ network with flow dynamics and compares it with some popular AQM methods, such as RED and the priority queue scheme. The simulation result shows good performance and significant improvement in the field of stable service, queue length, one way delay, jitters, goodput and packet loss rate. The congestion-sensitive sampling method also has a good result in predicting the actual network situation.

    Abstract I 中文摘要 II Acknowledgement III TABLE OF CONTENTS IV LIST OF TABLES VI LIST OF FIGURES VII Chapter 1 Introduction 1 1.1 Research Motivation 1 1.2 Research Objectives 2 1.3 Research Flow 3 1.4 Contributions 4 1.5 Limitations 4 Chapter 2 Literature Review 6 2.1 DiffServ 6 2.1.1 The DiffServ fields definition 7 2.1.2 Traffic classification and conditioning 7 2.1.3 Per-hop behavior 10 2.2 Queue management and scheduling scheme 12 2.2.1 Packet scheduling scheme 13 2.2.2 Queue management scheme 17 2.3 FLD 23 2.4 Sampling in network traffic 27 2.4.1 Sampling methods 27 2.4.2 Techniques for sample selection 28 Chapter 3 Methodology 30 3.1 Research framework 30 3.2 Sampling time interval 33 3.3 Attributes for Building FLD 34 3.4 DiffServ packet dropper 35 3.5 Threshold and decision rules 39 3.6 Simulation software 39 Chapter 4 Simulation results 41 4.1 Simulation environment 41 4.1.1 Simulation topology 41 4.1.2 The policy of each service class 42 4.1.3 Values of the parameters used in the experiments 43 4.2 Discrepancy measure 44 4.3 Service rate 47 4.4 Delay 51 4.4.1 One-Way Delay (OWD) 51 4.4.2 IP Packet Delay Variation (IPDV) 54 4.5 Queue length variation 56 4.6 Goodput 59 Chapter 5 Conclusions and future work 65 5.1 Conclusions 65 5.2 Future work 66 BIBLIOGRAPHY 67

    Allman, M., Paxson, V., and Stevens, W., TCP Congestion Control, RFC2581, April 1999.

    Almes, G., Kalidindi S., and Zekauskas, M.,A One-Way Delay Metric for IPPM, RFC 2679, September 1999.
    Aweya, J., Ouellette, M., Dasylva, A., and Montuno, D., DRED-MP: Queue management with multiple levels of drop precedence, International Journal of Network Management, Vol. 14, pp. 405-424, 2004.

    Bauer, M. A. and Akhand, H. A., Managing Quality-of-Service in Internet Applications Using Differentiated Services. Journal of Network System Management, Vol. 10, No. 1, March 2002.

    Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., and Weiss, W., An Architecture for Differentiated Services, RFC2475, December 1998.

    Bouras, C. and Sevasti, A., SLA-based QoS pricing in DiffServ networks, Computer Communications, Vol. 27, 2004.

    Bouillet, E., Mitra, D., and Ramakrishnan, K. G., The Structure and Management of Service Level Agreement in Networks, IEEE Journal on Selected Areas in Communications, Vol. 20, No. 4, May 2002.

    Braden, B., et al., Recommendations on Queue Management and Congestion Avoidance in the Internet, RFC2309, April 1998.

    Braden, R., Clark, D., and Shenker, S., Integrated Services in the Internet Architecture: an Overview, RFC1663, July 1994.

    Claffy, K. C., Polyzos, G. C., and Braun, H. W., Application of Sampling Methodologies to Network Traffic Characterization, Proceedings of ACM SIGCOMM ’93, 1993a.

    Claffy, K. C., Polyzos, G. C., and Braun, H. W., Measurement considerations for assessing unidirectional latency, Internetworking: Research and Experience, Vol. 4, No. 3, pp. 121-132, September 1993b.

    Clark, D. D. and Fang, W., Explicit allocation of best-effort packet delivery service, IEEE/ACM Transactions on Networking, Vol. 6, Issue: 4, pp. 362-373, August 1998.

    Davie, B., Charny, A., Bennett, J. C .R., Benson, K., Le Boudec, J. Y., Courtney, W., Davari, S., Firoiu, V., and Stiliadis, D., An Expedited Forwarding PHB (Per-Hop Behavior), RFC3246, March 2002.

    Demichelis, C. and Chimento, P., IP Packet Delay Variation Metric for IP Performance Metrics, RFC 3393, 2002.

    Dhandhere, K., Kim, H., and Pan, J., The Application and Effect of Sampling Methods on Collecting Network Traffic Statistics, Technical Report Carnegie Mellon, April 2001.
    Dovrolis, C. and Ramanathan, P., A Case for Relative Differentiated Services and the Proportional Differentiation Model, IEEE Network, Vol. 13, Issue: 5, pp.
    26-34, September-October 1999.

    Dovrolis, C., Stiliadis, D., and Ramanathan, P., Proportional Differentiated Services: Delay Differentiation and Packet Scheduling, IEEE/ACM Transaction On Networking, Vol. 10, No. 1, February 2002.

    Duda, R. O., Hart, P. E., and Stork, D. G., Pattern Classification, 2nd Edition. New York, NY: Wiley-Interscience Publications, 2000.

    Fatta, G. D., Hoffmann, F., Re, G. L., and Urso, A., A Genetic Algorithm for the Design of a Fuzzy Controller for Active Queue Management, IEEE Transactions on Systems, Man and Cybernetics-Part C:Applications and Reviews, Vol. 33, No. 3, August 2003.

    Feng, W., Kandlur, D., Saha, D., and Shin, K., A self-configuring RED gateway, Proceedings of IEEE INFOCOM' 99, March 1999.

    Feng, W., Shin, K., Kandlur, D., and Saha, D., The BLUE active queue management algorithms, IEEE/ACM Transaction Networking, Vol.10, pp.513-528, August 2002.

    Feng, G., Agarwal, A. K., Jayaraman, A., and Siew, C. K., Modified RED Gateways Under Bursty Traffic, IEEE Communications letters, Vol. 8, May 2004.

    Fisher, R. A., The Use of Multiple Measurements in Taxonomic Problems, Annals of Eugenics, Vol. 7, part II, pp. 179-188, 1936.

    Floyd, S., Gummadi, R., and Shenker, S., Adaptive RED:An Algorithm for In-creasing the Robustness of RED’s Active Queue Management,” Available from: <http://www.icir.org/floyd/papers/adaptiveRed.pdf>., 2001.
    Floyd, S. and Jacobson, V., Random Early Detection gateway for Congestion Avoidance, IEEE/ACM Transactions on Networking, August 1993.

    Floyd, S., and Jacobson, V., Link-sharing and Resource Management Models for Packet Networks, IEEE/ACM Transactions on Networking, Vol. 3 No. 4, pp. 365-386, August 1995.

    Gevros, P., Crowcroft J., Kirstein, P., and Bhatti S., Congestion control mechanisms and the best effort service model, IEEE Network, pp. 16-26, May/June 2001.

    Goodput, In Wikipedia, The Free Encyclopedia. Retrieved 06:40, January 15, 2008, from http://en.wikipedia.org/w/index.php?title= Goodput&oldid=180328893, December, 2007.

    Heinanen, J., Baker, F., Weiss, W., and Wroclawski, J., Assured Forwarding PHB Group, RFC2597, June 1999.
    Jacobson, V., Nichols, K., and Poduri, K., An Expedited Forwarding PHB, RFC2598, June 1999.

    Katevenis, M., Sidiropoulos, S., and Courcoubetis, C., Weighted round-robin cell multiplexing in a general-purpose ATM switch chip, IEEE Journal on Selected Areas in Communications, Vol. 9, Issue: 8, pp. 1265-1279, October 1991.

    Keller, A. and Ludwing H., The WSLA framework: specifying and monitoring service level agreements for web services, Journal of Network and Systems Management, Vol. 11, pp. 57-81, 2003.

    Kiamessoa, D., Hassanein, H. S., and Mouftah, H. T., Analysis of Prioritized Scheduling of Assured Forwarding in DiffServ Architectures, IEEE Conference on Local Computer Networks, pp. 614-623, October 2003.

    Kleinrock, L., Queuing Systems, Vol. 2: Computer Application, New York: Wiley-Interscience, 1976.

    Li, D. C., Wu, C. S., and Chang, F.M., Determination of the parameters in the dynamic weighted Round-Robin method for network load balancing, Computers and Operation Research, Vol. 32, pp. 2129-2145, 2005.

    Lewis, L. and Ray, P., Service level management definition, architecture, and research challenges, Proc. IEEE GLOBECOM, 1999.

    Marilly, E., Martinot, O. S., and Delegue, G., Requirements for service level agreement management, Proc. IEEE Workshop on IP Operations and Management, 2002.

    May, M., Bolot, J., Diot, C., and Lyes, B., Reasons not to deploy RED, Proc. IWQoS, pp. 260-262, March, 1999.

    Nichols, K., Blake, S., Baker, F., and Black, D., Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers, RFC2474, December 1998.

    Parekh, A. K. and Gallager R. G., A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ACM Trans on Networking, Vol. 1, No. 3 pp. 344-357, 1993.

    Paxson, V., Empirically-derived analytic models of wide-area TCP connections, IEEE/ACM Transaction on Networking, Vol. 2, Issue. 4, pp. 316-336, 1994

    Paxson, V., End-to-end routing behavior in the Internet Networking, IEEE/ACM Transactions on Networking, Vol. 5 Issue. 5, pp. 601-615, October 1997.

    Rekhter, L., A Provider Architecture for Differentiated Services and Traffic Engineering, RFC2430, 1998.

    Ren, F., Lin, C., and Huang, X., TCC: A Two-Category Classifier for AQM Routers Supporting TCP Flows, IEEE Communications Letters, Vol. 9, No. 5, pp. 471- 473, May 2005.

    Serban, R., Barakat, C., and Dabbous, W., A CBQ-Based Dynamic Resource Allocation Mechanism for DiffServ Routers, SETIT 2003, March 2003.

    Shimonishi, H., Yoshida, M., Ruixue, F., and Suzuki, H., An improvement of weighted round robin cell scheduling in ATM networks, IEEE Global Telecommunications Conference, GLOBECOM '9, Vol. 2, pp. 1119-1123, 1997.

    Tanenbaum, A. S., Computer Networks 4/e, Prentice Hall, March 2003.

    Turner, J. S., New Directions in Communication, IEEE Communication Magazine, Vol. 24, No. 10, pp. 363-376, 1986.

    Wang, X. and Schulzrinne, H., Pricing Network Resources for Adaptive Applications, IEEE/ACM TRANSACTIONS ON NETWORKING, Vol. 14, No. 3, JUNE 2006.

    下載圖示 校內:2011-07-30公開
    校外:2011-07-30公開
    QR CODE