以框架為基礎的公平佇列排程器之硬體設計與實踐

Abstract

隨著網際網路新世紀的來到，各種軟體的應用與開發，使網路的發展朝向寬頻化與智慧化。也因為網路業與電信業領域間的互相合併、跨足，現今的網路中，已經有許多應用服務都有及時性的需求，如網路電話和視訊會議等等。因此，不同的應用所需要的服務品質保證也就不相同。 近年來，隨著網路人口及多媒體資訊的增加，網路流量也日益增加，這使得傳統路由器逐漸成為網路的瓶頸。所以，使用專門硬體來處理封包是一個解決速度問題的辦法。在本篇論文中我們利用FFQ (Frame-based fair queueing)排程演算法來實現固定封包長度的排程器硬體，並且提出'可變長度FFQ演算法'的硬體簡化演算法，減少硬體實現上的複雜度，使整個排程器簡單而有效率以應用於高速網

With the coming of the Internet new era, the network evolution trends to be wide band and intelligent. Also, because of the mergence of traditional telecom industry and network industry, in today's network, many types of application, such as voice over IP, video conference and so on, request real-time service. Therefore, these applications often request quality of service (QoS) guarantee to certain degree. In the recent years, the traffic on the Internet increases rapidly. As a result, conventional routers become network bottleneck. Using the specific hardware to process packets is the better solution to solve the problem of speed. In this thesis, we choose FFQ (Frame-based fair queueing) scheduling algorithm to implement scheduler hardware for the fixed length case, and propose the scheme for the variable length case to reduce the complexity of implementation. Our scheme is efficient and simple, and thus is very attractive for hardware implementation in high-speed network.