Source-specific routing

Source-specific routing (not to be confused with source routing) is a routing technique where routing decisions depend on both the source and the destination address of a packet. Source-specific routing solves some difficult problems related to multihoming, notably in edge networks, and is therefore a useful addition to the multihoming toolbox. In this paper, we describe the semantics of source-specific packet forwarding, and describe the design and implementation of a source-specific extension to the Babel routing protocol as well as its implementation - to our knowledge, the first complete implementation of a source-specific dynamic routing protocol, including a disambiguation algorithm that makes our implementation work over widely available networking APIs. We further discuss interoperability between ordinary next-hop and source-specific dynamic routing protocols. Our implementation has seen a moderate amount of deployment, notably as a testbed for the IETF Homenet working group

Resilient networking in wireless sensor networks

This report deals with security in wireless sensor networks (WSNs), especially in network layer. Multiple secure routing protocols have been proposed in the literature. However, they often use the cryptography to secure routing functionalities. The cryptography alone is not enough to defend against multiple attacks due to the node compromise. Therefore, we need more algorithmic solutions. In this report, we focus on the behavior of routing protocols to determine which properties make them more resilient to attacks. Our aim is to find some answers to the following questions. Are there any existing protocols, not designed initially for security, but which already contain some inherently resilient properties against attacks under which some portion of the network nodes is compromised? If yes, which specific behaviors are making these protocols more resilient? We propose in this report an overview of security strategies for WSNs in general, including existing attacks and defensive measures. In this report we focus at the network layer in particular, and an analysis of the behavior of four particular routing protocols is provided to determine their inherent resiliency to insider attacks. The protocols considered are: Dynamic Source Routing (DSR), Gradient-Based Routing (GBR), Greedy Forwarding (GF) and Random Walk Routing (RWR)

Inventory-routing model, for a multi-period problem with stochastic and deterministic demand

The need for integration in the supply chain management leads us to consider the coordination of two logistic planning functions: transportation and inventory. The coordination of these activities can be an extremely important source of competitive advantage in the supply chain management. The battle for cost reduction can pass through the equilibrium of transportation versus inventory managing costs. In this work, we study the specific case of an inventory-routing problem for a week planning period with different types of demand. A heuristic methodology, based on the Iterated Local Search, is proposed to solve the Multi-Period Inventory Routing Problem with stochastic and deterministic demand.Inventory-Routing, iterated local search, logistics

Energy Efficient Multicast Routing in Mobile Ad Hoc Networks: Contemporary Affirmation of Benchmarking Models in Recent Literature

The Mobile Ad hoc Networks playing critical role in network aided communication requirements The features such as ad hoc and open architecture based connectivity and node mobility are elevating the mobile ad hoc networks as much as feasible to deploy and use The direct communication between any of two nodes in this network is possible if target node is in the range of source node If not the indirect communication took place which is usually referred as multi hop routing The multi hop routing occurs as either a unicast model one source node to one destination node multicast model one source node to multiple destination nodes or multiple casting manifold unicast routing In these routing strategies provision of service quality in multi hop routing is a challenging task The optimal quality of service in routing magnifies the delivery ratio transmission rate network life span and other expected characteristics of the ad hoc routing Among the quality service provision factors minimal energy conservation is prime factor which is since the nodes involved in routing are self-energized and if discharged early then the route will be destructed that causes discontinued routing The energy consumption is more specific in multicast routing hence it is grabbing the more attention of the current research contribution

Alternative Multiple Spanning Tree Protocol (AMSTP) for Optical Ethernet Backbones

The availability and affordable cost of Gigabit and 10 Gigabit Ethernet switches has impacted the deployment of metropolitan area networks (MAN) and campus networks. This paper presents a new protocol, the alternative multiple spanning tree protocol (AMSTP), that uses multiple source based spanning trees for backbones using Ethernet switches. It provides minimum paths and more efficient usage of optical backbone infrastructure than currently proposed protocols such as resilient packet ring and rapid spanning tree. The protocol exhibits features similar to MAC routing protocols like Link State Over MAC (LSOM) such as optimum path and effective infrastructure usage, without requiring MAC routing due to the use of the spanning tree protocol paradigm. AMSTP is not restricted to specific topologies such as ring or tree, but performs efficiently in arbitrary topologies. Among the application areas are optical backbones of campus and MANs.Publicad

User-space Multipath UDP in Mosh

In many network topologies, hosts have multiple IP addresses, and may choose among multiple network paths by selecting the source and destination addresses of the packets that they send. This can happen with multihomed hosts (hosts connected to multiple networks), or in multihomed networks using source-specific routing. A number of efforts have been made to dynamically choose between multiple addresses in order to improve the reliability or the performance of network applications, at the network layer, as in Shim6, or at the transport layer, as in MPTCP. In this paper, we describe our experience of implementing dynamic address selection at the application layer within the Mobile Shell. While our work is specific to Mosh, we hope that it is generic enough to serve as a basis for designing UDP-based multipath applications or even more general APIs

Calculating the minimum bounds of energy consumption for cloud networks

This paper is aiming at facilitating the energy-efficient operation of an integrated optical network and IT infrastructure. In this context we propose an energy-efficient routing algorithm for provisioning of IT services that originate from specific source sites and which need to be executed by suitable IT resources (e. g. data centers). The routing approach followed is anycast, since the requirement for the IT services is the delivery of results, while the exact location of the execution of the job can be freely chosen. In this scenario, energy efficiency is achieved by identifying the least energy consuming IT and network resources required to support the services, enabling the switching off of any unused network and IT resources. Our results show significant energy savings that can reach up to 55% compared to energy-unaware schemes, depending on the granularity with which a data center is able to switch on/off servers

Understanding edge-connectivity in the Internet through core-decomposition

Internet is a complex network composed by several networks: the Autonomous Systems, each one designed to transport information efficiently. Routing protocols aim to find paths between nodes whenever it is possible (i.e., the network is not partitioned), or to find paths verifying specific constraints (e.g., a certain QoS is required). As connectivity is a measure related to both of them (partitions and selected paths) this work provides a formal lower bound to it based on core-decomposition, under certain conditions, and low complexity algorithms to find it. We apply them to analyze maps obtained from the prominent Internet mapping projects, using the LaNet-vi open-source software for its visualization