Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Measuring ISP topologies with rocketfuel
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Optimal oblivious routing in polynomial time
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Walking the tightrope: responsive yet stable traffic engineering
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
COPE: traffic engineering in dynamic networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Stanford GraphBase: A Platform for Combinatorial Computing, The
Stanford GraphBase: A Platform for Combinatorial Computing, The
Optimizing OSPF/IS-IS weights in a changing world
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Phenomenal growth of Internet applications in recent years have made it difficult to forecast traffic patterns. Daily and weekly Internet traffic pattern shows that network is vulnerable to malicious attacks, flash crowds and distributed denial of service attacks (DDoS). In this paper we present a Robust Routing Technique (RRT) under dynamic traffic demand condition. Our simulation results are compared with OSPF-TE. Key feature of RRT is its convergence to generate the solution. It converges quickly to produce the simulation result on the family of topologies we consider in this paper. We are aiming a hybrid approach by combining best of proactive and reactive routing approaches in the RRT.