標題: 一個利用回饋控制加強無狀態式核心網路之公平佇列方法
An Enhancement to CSFQ with Feedback Control
作者: 黃銘銓
Ming-Chuan Huang
陳耀宗
Yaw-Chung Chen
資訊科學與工程研究所
關鍵字: CSFQ;最大-最小公平性;公平佇列方法;CSFQ;max-min fairness;fair queueing
公開日期: 2001
摘要: CSFQ可以利用低設計複雜度達到網路頻寬公平共享。基於此架構,每個核心路由器只在本身區域決定公平性,而往往忽略可能在下游端發生的壅塞。CSFQ不能避免封包因於中途被丟棄而發生的網路崩潰。 在本篇論文中,我們利用回饋控制加強CSFQ。我們最主要的想法是在出口路由器監測每筆網路串流的標籤,入口路由器則定期地送控制封包至出口路由器。當出口路由器收到入口路由器送來的控制封包,它會將先前監測到的流量平均速率送回去。而入口路由器再根據回傳的控制封包來決定對該筆網路串流應調整的速度。 這篇論文最主要的貢獻在於使得CSFQ避免造成網路的崩潰,並達到全域最大-最小公平性。由模擬數據顯示我們的方法是一個達到此目的之簡單方法。
The Core-Stateless Fair Queueing (CSFQ) is designed to achieve fair bandwidth sharing with low implementation complexity. It makes the decisions locally at each router and ignores congestion that may occur downstream. CSFQ can not prevent congestion collapse from undelivered packets. In this thesis, we enhance CSFQ with the feedback control. The key idea is to monitor each flow’s label in the egress router. The ingress router periodically sends control packet to the egress router. When the forward control packet arrives at the egress router, the egress router takes the result of average fair share rate into the feedback control packet and turns it around. The ingress router uses the information carried in the backward control packet to regulate the rate of the flow. Our key contribution is to enhance CSFQ such that it prevents congestion collapse from undelivered packets and achieves global max-min fairness. Through the simulation, we show that our enhancement is a feasible way that allows CSFQ to achieve the global max-min fairness.
URI: http://140.113.39.130/cdrfb3/record/nctu/#NT900392099
http://hdl.handle.net/11536/68507
顯示於類別:畢業論文