Abstract
Traditionally, routing is the process of selecting best paths in a network. Recently, the term routing is much better described as simply forwarding. Routing is performed for many kinds of networks, including the telephone network, electronic data networks, and transportation networks. In a more narrow sense of the term, routing is often contrasted with bridging in its assumption that network addresses are structured and that similar addresses imply proximity within the network. Nowadays, routing has become the dominant form of addressing on the Internet, and bridging is still widely used within localized environments. This chapter explores routing.
TopCooperative Game Theoretic Online Routing (Cgor) Scheme
During wireless network operations, a widely used performance issue is energy efficiency. Along with the energy efficiency, another desirable property is load balancing. Recently, S. Kim proposed a new integrated routing scheme (Kim, 2010); it is composed of path setup and packet distribution algorithms. Due to the online self-adjustment technique, the path setup algorithm can adaptively estimate link costs and establish routing paths. Based on the Shapley Value approach, the developed packet distribution algorithm can provide a fair and efficient solution for the packet forwarding problem. Under widely different and diversified network situations, this collaborative approach can offer a well-balanced network performance. The most important novelties of the CGOR scheme are its flexibility, adaptability and responsiveness to current traffic conditions.