如同核心無狀態公平佇列 （CSFQ），核心無狀態機制減少了公平佇列的複雜度，例如需要維持資料流狀態，管理緩衝器，以及根據每個資料流狀態來做排程的工作。然而，他們需要寫入標籤，並決定是否丟棄封包。這些複雜度可能避免他們被廣泛的使用。在這篇論文中，我們根據CSFQ提出一個新的架構，但是並不需要對每個封包標上標籤。相同的是，我們將網路架構分成邊界路由器和核心路由器。邊界路由器維持每個資料流狀態，他們採用一個公平佇列機制來公平地分配給每個資料流合理的頻寬，同時根據由出口邊界路由器回傳的回送封包上面的訊息和token bucket來管理每個資料流流量；核心路由器並不維持每個資料流狀態，他們只維持一個先進先出的佇列，同時利用一個碰撞演算法來估算資料流數目，算出公平的速率。我們利用這個資訊來達到提前控制速率的目的。這個新的機制稱為核心無狀態公平速率估算公平佇列。這篇論文中整理了關於公平頻寬分配的相關機制，同時經由詳細的模擬與實做，證明核心無狀態公平速率估算公平佇列可以達到相當好的公平性，並且適用於各種網路狀態。

Core-stateless mechanisms, such as core-stateless fair queuing (CSFQ) [3], reduce the complexity of fair queuing, which usually need to maintain state, manage buffers, and perform flow scheduling on a per flow basis. However, they require executing label rewriting and dropping decision on a per packet basis. This complexity may prevent them from being widely deployed. In this paper, we proposed a novel architecture based on CSFQ without per-packet labeling. Similarly, we distinguish edge routers and core routers. Edge routers maintain per flow state; they employ a fair queuing mechanism to allocate each flow a fair bandwidth share locally and a token bucket mechanism [5] to regulate those flows with feedback packets sent from egress edge routers. Core routers do not maintain per flow state; they use FIFO packet scheduling extended by a fare rate alarm mechanism that uses an estimate of active flow number based on a matching-mismatching algorithm. The novel scheme is called Core-Stateless Fair Rate Estimation Fair Queuing (CSFREFQ). This thesis surveys the relative works about fair bandwidth allocation. Through the detail simulations and implementation, CSFREFQ is proven to provide the pretty fairness and work well in any situation of the network.

[1] A. Demers, S. Keshav, and S. Shenker, “Analysis and Simulation of a Fair Queuing Algorithm,” In Proceedings of ACM SIGCOMM’89, 19(4): 1-12, September 1989
[2] D. Lin and R. Morris, “Dynamic of Random Early Detection,” In Proceedings of ACM SIGCOMM ’97, October 1997
[3] I. Stoica, S. Shenker, H. Zhang, "Core-Stateless Fair Queuing: A Scalable Architecture to Approximate Fair Bandwidth Allocations in High Speed Networks," In Proceedings of ACM SIGCOMM'98, August 1998
[4] David D. Clark and Wenjia Fang, “Explicit Allocation of Best-Effort Packet Delivery Service,” IEEE Transactions on Networking, August 1998.
[5] J. S. TURNER, “New Directions in Communications (or Which Way to the Information Age),” IEEE Commun. Magazine, Oct. 1986
[6] M. Shreedhar and G. Varghese, “Efficient Fair Queuing using Deficit Round Robin,” In Proceedings of ACM SIGCOMM’95, 1995
[7] http://www.csl.sony.co.jp/person/kjc/kjc/software.html
[8] L. Zhang, “Virtual clock: A new traffic control algorithm for packet switching network,” in Proc. ACM SIGCOMM’90, Sept. 1990.
[9] A. K. Parekh and R. G. Gallager, “A Generalized Processor Sharing Approach to Flow Control: The single Node Case,” In Proceedings of IEEE INFOCOM’92, May 1992
[10] Z. Cao, Z. Wang and E. Zegura, “Rainbow Fair Queuing: Fair Bandwidth Sharing Without Per-Flow State,” In Proceedings of IEEE INFOCOM ’2000
[11] M. Nabeshima, T. Shimizu and I. Yamasaki, “Fair queuing with in/out bit in core stateless networks,” in Proceedings of the Eight IEEE/IFIP International Workshop on Quality of Service, 2000
[12] T. Kurimoto and T. Shimizu ,”The study of bandwidth allocation mechanism that encourages users to use rate control in best effort service,” Technical report of IEICE, April 1999
[13] R. Sivakumar, “Achieving Per-flow Weighted Rate Fairness in a Core Stateless Network,” in Proceedings of IEEE ICDCS, 2000
[14] S. Floyd and V. Jacobson, “Random Early Detection gateways for Congestion Avoidance,” IEEE/ACM Transaction on Networking, August 1993
[15] J. S. Li and M. S. Leu, “Fair Bandwidth Share Using Flow Number Estimation,” in Proceedings of IEEE ICC, May 2002.
[16] http://www.isi.edu/nsnam/ns/

[17] http://www-2.cs.cmu.edu/~istoica/csfq/

[18] http://www.pao.lombardiacom.it/wfq.html

[19] http://dast.nlanr.net/Projects/Iperf/
[20] R. Braden et al., “Resource Reservation Protocol (RSVP) Version 1 Functional Specification,” FRC 2205, Proposed Standard, September 1997
[21] S. Blake et al., “A Architecture for Differentiated Services,” IETF RFC 2475, December 1998
[22] http://hsnet.ee.ncku.edu.tw/