Download the full-sized PDF of A Cluster-Based, Scalable and Efficient RouterDownload the full-sized PDF


Download  |  Analytics

Export to: EndNote  |  Zotero  |  Mendeley


This file is in the following communities:

Faculty of Graduate Studies and Research


This file is not currently in any collections.

A Cluster-Based, Scalable and Efficient Router Open Access


Other title
Congestion Control
Type of item
Degree grantor
University of Alberta
Author or creator
Ye, Qinghua
Supervisor and department
MacGregor, Mike H.(Computing Science)
Examining committee member and department
Yeung, Kwan L.(Electrical and Electronic Engineering)
Lu, Paul(Computing Science)
Elliott, Duncan(Electrical and Computer Engineering)
Yuan, Liyan(Computing Science)
Department of Computing Science

Date accepted
Graduation date
Doctor of Philosophy
Degree level
A cluster-based router is a new router architecture that is composed of a cluster of commodity processing nodes interconnected by a high-speed and low-latency network. It inherits packet processing extensibility from the software router, and forwarding performance scalability from clustering. In this thesis, we describe a prototype cluster-based router, including the design of the cluster-based router architecture and the addressing of critical issues such as the design of a highly efficient communication layer, reduction of operating system overheads, buffer recycling and packet packing. By experimental evaluation, we expose its forwarding capacity scalability and latency variance. We also evaluate and analyze the potential hardware bottlenecks of its commodity processing nodes, and present the correlation between the reception and transmission capabilities of an individual port as well as ports on the same bus. We propose an adaptive scheduling mechanism based on system state information to manage the adverse effect of this correlation on the router performance. We also investigate internal congestion in the cluster-based router. To manage the internal congestion, we propose two backward explicit congestion notification schemes: a novel queue scheduling method and an optimal utility-based scheme. We show the effectiveness of these schemes either by ns-3 simulation, experimental evaluation, or both. We also analyze the stability of the optimal utility-based BECN internal congestion control scheme through theoretical proof, simulation and experimental evaluation.
License granted by Qinghua Ye ( on 2010-06-09T19:25:37Z (GMT): Permission is hereby granted to the University of Alberta Libraries to reproduce single copies of this thesis and to lend or sell such copies for private, scholarly or scientific research purposes only. Where the thesis is converted to, or otherwise made available in digital form, the University of Alberta will advise potential users of the thesis of the above terms. The author reserves all other publication and other rights in association with the copyright in the thesis, and except as herein provided, neither the thesis nor any substantial portion thereof may be printed or otherwise reproduced in any material form whatsoever without the author's prior written permission.
Citation for previous publication

File Details

Date Uploaded
Date Modified
Audit Status
Audits have not yet been run on this file.
File format: pdf (Portable Document Format)
Mime type: application/pdf
File size: 4083936
Last modified: 2015:10:12 14:26:39-06:00
Filename: Ye_Qinghua_Fall 2010.pdf
Original checksum: b1979aefa3a6dd353439064a02444b3c
Well formed: true
Valid: true
Page count: 165
Activity of users you follow
User Activity Date