Identifier-Based Discovery in Large-Scale Networks

The design of any network mechanism that requires collaboration among selfish agents could only benefit from accounting for the complex social and economic interactions and incentives of the agents using the design. This chapter presents a broad treatment of the main economic issues that arise in the context of identifier-based discovery on large scale networks, particularly on the Internet. An “identified” object (such as a node or service), referred to as a player, demands to be discoverable by the rest of the network on its “identifier”. A discovery scheme provides such a service to the players and incurs a cost for doing so. Providing such a service while accounting for the cost and making sure that the incentives of the players are aligned is the general economic problem that we address in this work. After introducing the identifier-based discovery problem, we present a taxonomy of discovery schemes and proposals based on their business model and we pose several questions that are becoming increasingly important as we proceed to design the inter-network of the future. An incentive model for distributed discovery in the context of the Border Gateway Protocol (BGP) and path-vector protocols in general is then presented. We model BGP route distribution and computation using a game in which a BGP speaker advertises its prefix to its direct neighbors promising them a reward for further distributing the route deeper into the network. The neighbors do the same thing with their direct neighbors, and so on. The result of this cascaded route distribution is a globally advertised prefix and hence discoverability. We present initial results on the existence of equilibria in the game and we motivate our ongoing work

An Overview of Distributed Energy-Efficient Topology Control for Wireless Ad Hoc Networks

A wireless ad hoc network is composed of several tiny and inexpensive device such as wireless sensor networks (WSNs) which have limited energy. In this network energy, efficiency is one of the most crucial requirements. Data transmitting in minimum power level is one way of maximizing energy efficiency. Thus, transmission power level of nodes should be managed in a smart way to improve energy efficiency. Topology control is one of the main algorithms used in a wireless network to decrease transmission power level while preserving network connectivity. Topology control could improve energy efficiency by reasonably tuning the transmission power level while preserving network connectivity in order to increase network capacity and lifetime. In pursuit of energy efficiency and connectivity, nodes can be selfish and are conflicting with each other. Therefore to overcome the conflict, game theory is used to construct energy efficient topology, as well as minimizing energy consumption. In this paper, the main goal and most recent energy efficient topology control algorithms in WSNs and ad hoc network are classified and studied according to their specific goals

Resource Allocation, and Survivability in Network Virtualization Environments

Network virtualization can offer more flexibility and better manageability for the future Internet by allowing multiple heterogeneous virtual networks (VN) to coexist on a shared infrastructure provider (InP) network. A major challenge in this respect is the VN embedding problem that deals with the efficient mapping of virtual resources on InP network resources. Previous research focused on heuristic algorithms for the VN embedding problem assuming that the InP network remains operational at all times. In this thesis, we remove that assumption by formulating the survivable virtual network embedding (SVNE) problem and developing baseline policy heuristics and an efficient hybrid policy heuristic to solve it. The hybrid policy is based on a fast re-routing strategy and utilizes a pre-reserved quota for backup on each physical link. Our evaluation results show that our proposed heuristic for SVNE outperforms baseline heuristics in terms of long term business profit for the InP, acceptance ratio, bandwidth efficiency, and response time