Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/52513
Title: Data center ethernet : data traffic congestion control
Authors: Ang, Yu Bin
Keywords: DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks
Issue Date: 2013
Abstract: Data Centre Networks have begun to grow in sizes and utilizations. To provide quality services to users, the efficiency and reliability of the interconnected links is of great importance in running a Data centre. In ensuring that quality of service (QOS) is met, congestion control has become one of the critical topics being tackled. In this project we will focus on two different areas in our efforts of congestion control. First we will be working on searching of a network simulator which allows us to run the current OpenFlow based congestion control protocols as well as future development of the protocol. Secondly, we will be constructing an actual Openflow Network to run performance test Equal-Cost multi-path as well as Edge to Edge Lowest cost routing with and without congestion re-routing. The results of both test will be compared to see which algorithm fares better. In the search for a suitable simulator, we discover NS-3 network simulator which is able to intergrade with the Click modular router. The integration of both system, named NS-3-Click, allow us to us Openflow Click element to simulate an OpenFlow network. This configuration gives us the ability to future expands the functionality of an OpenFlow switch if needed. However we met with an incompatibility issue with OpenFlow Click element. We have concluded that it is possible to resolve the incompatibility; unfortunately we do not have sufficient time to resolve the issue. For the performance test, it was discovered that for busty traffics, both routing algorithm performed equally and there is no difference in performance with or without congestion re-routing. On the other hand, ECMP performed significantly better than lowest cost algorithm when no rerouting is implemented as well as when rerouting is implemented for both itself and lowest cost with non-busty traffic.
URI: http://hdl.handle.net/10356/52513
Rights: Nanyang Technological University
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
SCE85.pdf
  Restricted Access
1.34 MBAdobe PDFView/Open

Page view(s) 50

197
checked on Oct 31, 2020

Download(s) 50

9
checked on Oct 31, 2020

Google ScholarTM

Check

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.