Gleaning network wide congestion information from packet markings
| dc.contributor.advisor | Ng, T. S. Eugene | |
| dc.creator | Dinu, Florin | |
| dc.date.accessioned | 2011-07-25T02:05:25Z | |
| dc.date.available | 2011-07-25T02:05:25Z | |
| dc.date.issued | 2010 | |
| dc.description.abstract | Congestion information can greatly benefit network level decisions. For example, fast-reroute algorithms should leverage congestion information when computing backup paths. They could also use the information to monitor if the re-routing decision itself causes congestion in the network. Today, most solutions for inferring congestion work at the end-host level and relay end-to-end congestion information to transport protocols. Network level decisions, on the other hand, may need link level congestion information. Unfortunately, the mechanisms that routers can use to infer link level congestion information are insufficient. Such information could potentially be obtained by periodically sharing estimates between routers. However, this solution increases the traffic load on the network and has difficulty in reliably delivering the estimates during periods of congestion. In this thesis we show that routers inside an autonomous system can easily and accurately infer congestion information about each other. Routers first measure path level congestion information only from the congestion markings in the traffic that they forward. Next, we propose that routers combine routing information with the path level congestion information to obtain a more detailed description of the congestion in the network. Link level congestion information can be computed using this approach. Our techniques never add supplementary traffic into the network and use little router resources. They can be deployed incrementally or in heterogeneous environments. We show that the accuracy of the inference is good using experiments with multiple traffic patterns and various congestion levels. | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.callno | THESIS COMP.SCI. 2010 DINU | |
| dc.identifier.citation | Dinu, Florin. "Gleaning network wide congestion information from packet markings." (2010) Master’s Thesis, Rice University. <a href="https://hdl.handle.net/1911/62025">https://hdl.handle.net/1911/62025</a>. | |
| dc.identifier.uri | https://hdl.handle.net/1911/62025 | |
| dc.language.iso | eng | |
| dc.rights | Copyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder. | |
| dc.subject | Computer science | |
| dc.subject | Engineering | |
| dc.title | Gleaning network wide congestion information from packet markings | |
| dc.type | Thesis | |
| dc.type.material | Text | |
| thesis.degree.department | Computer Science | |
| thesis.degree.discipline | Engineering | |
| thesis.degree.grantor | Rice University | |
| thesis.degree.level | Masters | |
| thesis.degree.name | Master of Science |
Files
Original bundle
1 - 1 of 1