SEAL2: An SDN‐enabled all‐Layer2 packet forwarding network architecture for multitenant datacenter networks

This paper presents the design and development of a new network virtualization scheme to support multitenant datacenter networking (MT‐DCN) based on software‐defined networking (SDN) technologies. Effective multitenancy supports are essential and challenging for datacenter networking designs. In this study, we propose a new network virtualization architecture framework for efficient packet forwarding in MT‐DCN. Traditionally, an internet host uses IP addresses for both host identification and location information, which causes mobile IP problems whenever the host is moved from one IP subnet to another. Unfortunately, virtual machine (VM) mobility is inevitable for cloud computing in datacenters for reasons such as server consolidation and network traffic flow optimization. To solve the problems, we decouple VM identification and location information with two independent values neither by IP addresses. We redefine the semantics of Ethernet MAC address to embed tenant ID information to the MAC address field without violating its original functionality. We also replace traditional Layer2/Layer3 two‐stage routing schemes (MAC/IP) with an all‐Layer2 packet forwarding mechanism that combines MAC addresses (for VM identification and forwarding in local server groups under an edge switch gateway) and multiprotocol label switching (MPLS) labels (for packet transportation between edge switch gateways across the core label switching network connecting all the edge gateways). To accommodate conventional IP packet architecture in a multitenant environment, SDN (OpenFlow) technology is used to handle all this complex network traffics. We verified the design concepts by a simple system prototype in which all the major system components were implemented. Based on the prototype system, we evaluated packet forwarding efficiency under the proposed network architecture and compared it with conventional IP subnet routing approaches. We also evaluated the incurred packet processing overhead caused by each of the packet routing components.     

A comparative study of name resolution and routing mechanisms in information-centric networks

Information-Centric Networking (ICN) is an innovative paradigm for the future internet architecture, which addresses IP network limitations in supporting content distribution and information access by decoupling content from hosts and providing the ability to retrieve a content object by its name (identifier), rather than its storage location (IP address). Name resolution and routing is critical for content retrieval in ICN networks. In this research, we perform a comparative study of two widely used classes of ICN name resolution and routing schemes, namely flooding and Distributed Hash Table (DHT). We consider the flooding-based routing in Content-Centric Networks due to its wide acceptance. For the DHT scheme, we design a multi-level DHT that takes into account the underlying network topology and uses name aggregation to further reduce control overhead and improve network efficiency. Then, we compare the characteristics and performance of these two classes of name resolution and routing through extensive simulations. The evaluation results show that the performances of these two approaches are reliant on several factors, including network size, content location dynamics, and content popularity. Our study reveals insights into the design tradeoffs and offers guidelines for design strategies.     

Location based routing addressing mechanism of integrated satellite and terrestrial network

The ever-changing characteristics of the connection between the satellite network and the terrestrial network caused by the high-speed movement of the satellites have always been one of the most important problem that plagues the routing mechanism of the satellite network and integrated network.To address this problem,a location addressing based routing mechanism of integrated satellite and terrestrial network (LA-ISTN) was proposed.LA-ISTN exploited the user’s physical location in the user’s IP address to calculate the routing orientation.Based on the orientation,LA-ISTN could choose the best forward interface.Theoretical analysis and simulation experiments show that compared with snapshot protocol and OSPF routing protocol,LA-ISTN significantly reduces the route table storage overhead,with no routing updates cost caused by neighbor packet switching and communication.Inter-satellite route selection is not dependent on the prediction of link connection relations,with strong robustness,can always guarantee the network’s availability.     

移动自组织网络中可扩展的定位符/标识符分离路由协议

In the traditional Internet Protocol (IP) architecture, there is an overload of IP semantic problems. Existing solutions focused mainly on the infrastructure for the fixed network, and there is a lack of support for Mobile Ad Hoc Networks (MANETs). To improve scalability. A routing protocol for MANETs is presented based on a locator named Tree-structure Locator Distance Vector (TLDV). The hard core of this routing method is the identifier/locator split by the Distributed Hash Table (DHT ) method, which provides a scalable routing service. The node locator indicates its relative location in the network and should be updated whenever topology changes . Locator space is organized as a tree-structure, and the basic routing operation of the TLDV protocol is presented. TLDV protocol is compared to some classical routing protocols for MANETs on the NS2 platform. Results show that TLDV has better scalability.     

A Domain-Based Routing Protocol for SSM Source Mobility in Mobile IPv6 Networks

In Mobile IP, the signaling traffic overhead will be too high since the new Care-of-Address (CoA) of the mobile node (MN) is registered all the way with the home agent (HA) whenever the MN has moved into a new foreign network. To complement Mobile IP in better handling local movement, several IP micro protocols have been proposed. These protocols introduce a hierarchical mobility management scheme, which divides the mobility into micro mobility and macro mobility according to whether the host's movement is intra-domain or inter-domain. Thus, the requirements on performance and flexibility are achieved, especially for frequently moving hosts. This paper introduces a routing protocol for multicast source mobility on the basis of the hierarchical mobile management scheme, which provides a unified global architecture for both uni- and multicast routing in mobile networks. The implementation of multicast services adopts an improved SSM (Source Specific Multicast) model, which combines the advantages of the existing protocols in scalability and mobility transparency. Simulation results show that the proposed protocol has better performance than the existing routing protocols for SSM source mobility.     

A peer-to-peer zone-based two-level link state routing for mobilead hoc networks

A new global positioning system (GPS)-based routing protocol for ad hoc networks, called zone-based hierarchical link state (ZHLS) routing protocol, is proposed. In this protocol, the network is divided into nonoverlapping zones. Each node only knows the node connectivity within its zone and the zone connectivity of the whole network. The link state routing is performed on two levels: focal node and global zone levels. Unlike other hierarchical protocols, there is no cluster head in this protocol. The zone level topological information is distributed to all nodes. This “peer-to-peer” manner mitigates traffic bottleneck, avoids single point of failure, and simplifies mobility management. Since only zone ID and node ID of a destination are needed for routing, the route from a source to a destination is adaptable to changing topology. The zone ID of the destination is found by sending one location request to every zone. Simulation results show that our location search scheme generates less overhead than the schemes based on flooding. The results also confirm that the communication overhead for creating and maintaining the topology in the proposed protocol is smaller than that in the flat LSR protocol. This new routing protocol provides a flexible, efficient, and effective approach to accommodate the changing topology in a wireless network environment     

An Efficient Multicast Routing Protocol in Wireless Mobile Networks

Providing multicast service to mobile hosts in wireless mobile networking environments is difficult due to frequent changes of mobile host location and group membership. If a conventional multicast routing protocol is used in wireless mobile networks, several problems may be experienced since existing multicast routing protocols assume static hosts when they construct the multicast delivery tree. To overcome the problems, several multicast routing protocols for mobile hosts have been proposed. Although the protocols solve several problems inherent in multicast routing proposals for static hosts, they still have problems such as non-optimal delivery path, datagram duplication, overheads resulting from frequent reconstruction of a multicast tree, etc. In this paper, we summarize these problems of multicast routing protocols and propose an efficient multicast routing protocol based on IEFT mobile IP in wireless mobile networks. The proposed protocol introduces a multicast agent, where a mobile host receives a tunneled multicast datagram from a multicast agent located in a network close to it or directly from the multicast router in the current network. While receiving a tunneled multicast datagram from a remote multicast agent, the local multicast agent may start multicast join process, which makes the multicast delivery route optimal. The proposed protocol reduces data delivery path length and decreases the amount of duplicate copies of multicast datagrams. We examined and compared the performance of the proposed protocol and existing protocols by simulation under various environments and we got an improved performance over the existing proposals.     

空中异构战术网络IP通信架构及协议开销分析

空中异构战术无线网络由多种不同类型的无线数据链网络构成，IP通信技术可有效解决空中平台异构无线网络的互联互通问题。给出了空中异构战术无线网络模型，并根据不同类型的无线数据链网络特点，分析了端到端通信协议栈关系以及不同无线数据链网络间协议转换与适配方式。探讨了网络静态和动态IP地址分配方法以及网络的路由架构与寻址方式，提出了不同无线数据链网络间IP报文传输的打包方式。对传输的开销性能仿真对比分析表明，基于通用成帧协议的打包方式的协议开销性能较优。     

A hierarchical multilayer QoS routing system with dynamic SLAmanagement

This paper proposes a hierarchical multilayer QoS routing system with dynamic SLA management for large-scale IP networks. Previously, the promising approach to provide QoS in large-scale IP networks using a mixture of DiffServ-based QoS management and MPLS-based traffic engineering has been actively discussed. However, the introduction of QoS exacerbates the already existing scalability problems of the standard IP routing protocols. In order to address this issue, we propose a new scalable routing framework based on hierarchical QoS-aware path computation. We augment the existing OSPF and CR-LDP protocols to support hierarchical QoS routing, QoS aggregation, and QoS reservation in our MPLS-DiffServ-based hierarchical routing network. In order to provide additional flexibility and cost-efficiency, we augment the network with a policy server which is capable of dynamically handling SLAs between the networks and providing load balancing management within the network. We implement a prototype of the proposed framework and study its performance with a virtual network simulator and specially designed QoS routing algorithm simulator. In our simulations, we evaluate both the implementation complexity and algorithms performance; the results demonstrate the efficiency of the framework and its advantages over the existing proposals     

Bayesian inference approach for establishing efficient routes in wireless ad-hoc networks

Mobile ad hoc networks (MANETs) are dynamic wireless networks that have no fixed infrastructures and do not require predefined configurations. In this infrastructure-less paradigm, nodes in addition of being hosts, they also act as relays and forward data packets for other nodes in the network. Due to limited resources in MANETs such as bandwidth and power, the performance of the routing protocol plays a significant role. A routing protocol in MATET should not introduce excessive control messages to the network in order to save network bandwidth and nodes power. In this paper, we propose a probabilistic approach based on Bayesian inference to enable efficient routing in MANETs. Nodes in the proposed approach utilize the broadcast nature of the wireless channel to observe the network topology by overhearing wireless transmissions at neighboring nodes in a distributed manner, and learn from these observations when taking packet forwarding decision on the IP network layer. Our simulation results show that our routing approach reduces the number of control message (routing overhead) by a ratio up to 20 % when the network size is 60 nodes, while maintaining similar average route establishment delay as compared to the ad-hoc on demand routing protocol.     

Location management in mobile ad hoc wireless networks using quorums and clusters

Position‐based reactive routing is a scalable solution for routing in mobile ad hoc networks. The route discovery algorithm in position‐based routing can be efficiently implemented only if the source knows the current address of the destination. In this paper, a quorum‐based location management scheme is proposed. Location servers are selected using the minimum dominating set (MDS) approach, and are further organized into quorums for location update and location query. When a mobile node moves, it updates its location servers in the update quorum; when a node requests the location information of another node, it will send a query message to the location servers in the query quorum. We propose to use the position‐based quorum system, which is easy to construct and guarantees that the update quorums always intersect with the query quorums so that at least one location server in the query quorum is aware of the most recent location of the mobile node. Clusters are introduced for large scale ad hoc networks for scalability. Experiment results show that the proposed scheme provides good scalability when network size increases. Copyright © 2005 John Wiley & Sons, Ltd.     

Chord上拓扑不匹配的研究和改进

Chord系统中没有考虑到逻辑网络拓扑和物理网络拓扑不相匹配而导致的路由效率低下,由此提出了一种利用节点IP地址信息使节点得以聚类从而达到系统逻辑网络拓扑与物理网络拓扑在一定程度上的匹配,对Chord系统改进得到了TChord系统模型,通过仿真实验证明了TChord系统在路由延迟和覆盖网络路由跳数方面比Chord系统有明显的改进,从而效提高路由效率.     

A location-based routing method for mobile ad hoc networks

Using location information to help routing is often proposed as a means to achieve scalability in large mobile ad hoc networks. However, location-based routing is difficult when there are holes in the network topology and nodes are mobile or frequently disconnected to save battery. Terminode routing, presented here, addresses these issues. It uses a combination of location-based routing (terminode remote routing, TRR), used when the destination is far, and link state-routing (terminode local routing, TLR), used when the destination is close. TRR uses anchored paths, a list of geographic points (not nodes) used as loose source routing information. Anchored paths are discovered and managed by sources, using one of two low overhead protocols: friend assisted path discovery and geographical map-based path discovery. Our simulation results show that terminode routing performs well in networks of various sizes. In smaller networks; the performance is comparable to MANET routing protocols. In larger networks that are not uniformly populated with nodes, terminode routing outperforms, existing location-based or MANET routing protocols.     

Scalability enhancement of AODV using local link repairing

Dynamic change in the topology of an ad hoc network makes it difficult to design an efficient routing protocol. Scalability of an ad hoc network is also one of the important criteria of research in this field. Most of the research works in ad hoc network focus on routing and medium access protocols and produce simulation results for limited-size networks. Ad hoc on-demand distance vector (AODV) is one of the best reactive routing protocols. In this article, modified routing protocols based on local link repairing of AODV are proposed. Method of finding alternate routes for next-to-next node is proposed in case of link failure. These protocols are beacon-less, means periodic hello message is removed from the basic AODV to improve scalability. Few control packet formats have been changed to accommodate suggested modification. Proposed protocols are simulated to investigate scalability performance and compared with basic AODV protocol. This also proves that local link repairing of proposed protocol improves scalability of the network. From simulation results, it is clear that scalability performance of routing protocol is improved because of link repairing method. We have tested protocols for different terrain area with approximate constant node densities and different traffic load.     

Multicast support for mobile hosts using Mobile IP: Design issues and proposed architecture

In this paper, we consider the problem of providing multicast to mobile hosts using Mobile IP for network routing support. Providing multicast in an internetwork with mobile hosts is made difficult because many multicast protocols are inefficient when faced with frequent membership or location changes. This basic difficulty can be handled in a number of ways, but three main problems emerge with most solutions. The tunnel convergence problem, the duplication problem, and the scoping problem are identified in this paper and a set of solutions are proposed. The paper describes an architecture to support IP multicast for mobile hosts using Mobile IP. The basic unicast routing capability of Mobile IP is used to serve as the foundation for the design of a multicast service facility for mobile hosts. We believe that our scheme is transparent to higher layers, simple, flexible, robust, scalable, and, to the extent possible, independent of the underlying multicast routing facility. For example, our scheme could interoperate with DVMRP, MOSPF, CBT, or PIM in the current Internet. Where differences exist between the current version of IP (IPv4) and the next generation protocol (IPv6), these differences and any further optimizations are discussed. This revised version was published online in June 2006 with corrections to the Cover Date.     

DDRP: An efficient data‐driven routing protocol for wireless sensor networks with mobile sinks

Introduction of mobile sinks into a wireless sensor network can largely improve the network performance. However, sink mobility can cause unexpected changes of network topology, which may bring excessive protocol overhead for route maintenance and may offset the benefit from using mobile sinks. In this paper, we propose an efficient data‐driven routing protocol (DDRP) to address this problem. The design objective is to effectively reduce the protocol overhead for data gathering in wireless sensor networks with mobile sinks. DDRP exploits the broadcast feature of wireless medium for route learning. Specifically, each data packet carries an additional option recording the known distance from the sender of the packet to target mobile sink. The overhearing of transmission of such a data packet will gratuitously provide each listener a route to a mobile sink. Continuous such route‐learning among nodes will provide fresh route information to more and more nodes in the network. When no route to mobile sink is known, random walk routing simply is adopted for data packet forwarding. Simulation results show that DDRP can achieve much lower protocol overhead and longer network lifetime as compared with existing work while preserving high packet delivery ratio. Copyright © 2012 John Wiley & Sons, Ltd.     

Study of MANET routing protocols by GloMoSim simulator

This paper compares ad hoc on‐demand distance vector (AODV), dynamic source routing (DSR) and wireless routing protocol (WRP) for MANETs to distance vector protocol to better understand the major characteristics of the three routing protocols, using a parallel discrete event‐driven simulator, GloMoSim. MANET (mobile ad hoc network) is a multi‐hop wireless network without a fixed infrastructure. Following are some of our key findings: (1) AODV is most sensitive to changes in traffic load in the messaging overhead for routing. The number of control packets generated by AODV became 36 times larger when the traffic load was increased. For distance vector, WRP and DSR, their increase was approximately 1.3 times, 1.1 times and 7.6 times, respectively. (2) Two advantages common in the three MANET routing protocols compared to classical distance vector protocol were identified to be scalability for node mobility in end‐to‐end delay and scalability for node density in messaging overhead. (3) WRP resulted in the shortest delay and highest packet delivery rate, implying that WRP will be the best for real‐time applications in the four protocols compared. WRP demonstrated the best traffic scalability; control overhead will not increase much when traffic load increases. Copyright © 2005 John Wiley & Sons, Ltd.     

Location‐Aided Routing (LAR) in mobile ad hoc networks

A mobile ad hoc network consists of wireless hosts that may move often. Movement of hosts results in a change in routes, requiring some mechanism for determining new routes. Several routing protocols have already been proposed for ad hoc networks. This paper suggests an approach to utilize location information (for instance, obtained using the global positioning system) to improve performance of routing protocols for ad hoc networks. By using location information, the proposed Location‐Aided Routing (LAR) protocols limit the search for a new route to a smaller “request zone” of the ad hoc network. This results in a significant reduction in the number of routing messages. We present two algorithms to determine the request zone, and also suggest potential optimizations to our algorithms. This revised version was published online in July 2006 with corrections to the Cover Date.     

Internet exterior routing protocol development: problems, issues,and misconceptions

Global routing in the Internet continues to have scalability problems which underscore weaknesses in the design and implementation of the various TCP/IP exterior routing protocols. This article explores the historical design and development relative to the decision-making process in the specification and implementation of Internet external routing protocols, in particular discussing problems associated with provider-based address space allocation     

Hierarchical routing overhead in mobile ad hoc networks

Hierarchical techniques have long been known to afford scalability in networks. By summarizing topology detail via a hierarchical map of the network topology, network nodes are able to conserve memory and link resources. Extensive analysis of the memory requirements of hierarchical routing was undertaken in the 1970s. However, there has been little published work that assesses analytically the communication overhead incurred in hierarchical routing. This paper assesses the scalability, with respect to increasing node count, of hierarchical routing in mobile ad hoc networks (MANETs). The performance metric of interest is the number of control packet transmissions per second per node (/spl Phi/). To derive an expression for /spl Phi/, the components of hierarchical routing that incur overhead as a result of hierarchical cluster formation and location management are identified. It is shown here that /spl Phi/ is only polylogarithmic in the node count.