Deflection routing in complex networks
偏轉路由在複雜網絡中的應用
Student thesis: Doctoral Thesis
Author(s)
Related Research Unit(s)
Detail(s)
Awarding Institution | |
---|---|
Supervisors/Advisors |
|
Award date | 15 Feb 2013 |
Link(s)
Permanent Link | https://scholars.cityu.edu.hk/en/theses/theses(17c77922-266b-487d-8da6-2c6f40bc81c3).html |
---|---|
Other link(s) | Links |
Abstract
Deflection routing refers to a protocol consisting of a table-based routing protocol,
plus a software module responsible for deflection. When a link is congested, or a
queueing delay is too long, a packet can be forwarded by the deflection module.
Routing table is overridden and the deflection module "deflects" the packet away
from the normal path, by-passing the congestion point. The packet then arrives
to its next hop and hooks up to another path toward its destination. The packet
may be deflected more than once if needed.
In contrast to adapting to topology changes, adapting to traffic changes is
a more challenging objective. In this thesis, I study using deflection routing to
achieve the aforementioned objective, and report several studies to address the
technical difficulties. Afterward, I propose an enhanced routing protocol based
upon deflection routing - Random Early Deflection (RED-f) routing protocol,
which allows packets to take different paths preemptively before congestion is
developed.
- Routing (Computer network management), Packet switching (Data transmission)