Dynamic Routing with Security Considerations
Security has become one of the major issues for data communication over wired and wireless networks. Different from the past work on the designs of cryptography algorithms and system infrastructures, we will propose a dynamic routing algorithm that could randomize delivery paths for data transmission. The algorithm is easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol in wired networks and Destination-Sequenced Distance Vector protocol in wireless networks, without introducing extra control messages. Trade-Offs between Stretch Factor and Load-Balancing Ratio in Routing on Growth-Restricted Graphs Abstractâ€An un weighted graph has density _ and growth rate k if the number of nodes in every ball with radius r is bounded by _rk. The communication graphs of wireless networks and peer-to-peer networks often have constant bounded density and small growth rate. In this paper, we study the trade-off between two quality measures for routing in growth-restricted graphs. The two measures we consider are the stretch factor, which measures the lengths of the routing paths, and the load-balancing ratio, which measures the evenness of the traffic distribution. We show that if the routing algorithm is required to use paths with stretch factor c, then its load-balancing ratio is bounded by OÃƒÂ°_1=kÃƒÂ°n=cÃƒÅ¾1_1=kÃƒÅ¾, and the bound is tight in the worst case. We show the application and extension of the trade-off to the wireless network routing and VLSI layout design.