Traffic scheduling for QOS guarantees in broadband packet-switched networks

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 428
  • Download : 0
Recently, real-time services over the Internet are becoming increasingly popular. A large number of real-time services will have made their way into homes and offices. Since real-time services need far more stringent QoS requirements than the typical sort of data applications, they should be guaranteed minimum bandwidth, jitter, and low end-to-end delays to each flow, regardless of the behavior of other flows. At the same time, data rates continue to increase past OC-12 or gigabit rates to OC-48 towards 10-gigabit Ethernet and the number of users is growing exponentially. All these factors make If QoS with the evolution of the Internet a challenging task. Until now, many mechanisms have presented in order to support QoS guarantees at the network-level. These mechanisms include queuing, traffic scheduling, policing, shaping, and buffer management. It is interesting to observe, however, that the traffic scheduling of all mechanisms is the most critical function in achieving QoS guarantees. This dissertation is on the design, analysis, and implementation framework of traffic scheduling. We first propose a new input arbitration mechanism to reduce synchronization effect of conventional input arbitration. This mechanism is based on a buffered crossbar switch with VOQ at the input. In the proposed method, the starting points of input modules are different from each other in any case. We evaluate the probability that input modules select cells destined for the same output. From the evaluated probability, we identify that the probability is maximized when the input starting points are same. Therefore, we show that the uniqueness of the starting points improves the switch performance. We also confirm the proposed method is better than the conventional methods under the uniform and on-off traffic by simulation. Next, we propose an efficient and simple fair queuing algorithm, called new starting potential fair queuing (NSPFQ). Several algorithms using system virtual...
Advisors
Park, Hong-Shikresearcher박흥식researcher
Description
한국정보통신대학원대학교 : 공학부,
Publisher
한국정보통신대학교
Issue Date
2004
Identifier
392434/225023 / 000985413
Language
eng
Description

학위논문(박사) - 한국정보통신대학원대학교 : 공학부, 2004, [ vii, 117 p. ]

Keywords

Traffic Scheduling for QOS Guarantees

URI
http://hdl.handle.net/10203/54540
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=392434&flag=dissertation
Appears in Collection
School of Engineering-Theses_Ph.D(공학부 박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0