An Analysis of flow-based routing

Since their development in the early 1970\u27s, the underlying function of IP routers has not changed - they still support a best effort delivery method in order to pass frames from source to destination. With the advent of newer, bandwidth intensive Internet-based services and applications, such as video conferencing and telemedicine, many individuals wonder if the current approach to routing is the most practical. The Internet needs to provide quality of service ( QoS ) as predictably as conventional circuit switching networks. Although some QoS capabilities in an isolated environment have been demonstrated, providing end-to-end QoS at a large scale across the Internet remains an unsolved problem [1]. The alternative to the traditional method of IP routing is a concept known as flow-based routing, whereas traffic is sent across the network as part of a common flow, rather than individually inspecting each packet. As part of this thesis, the differences between flow-based routing and the current standard of IP routing will be investigated. There are many benefits to be had from routing based on flows, for both routers and applications. Some research has already been done on specific aspects of flow-based routing, but because the concept is so cutting-edge, resources are scarce. This study delves into the benefits and obstacles of flow-based routing, and analyzes characteristics such as practicality and security, along with the benefits of this model

Class-based multicast routing in interdomain scenarios

DiffServ-like domains bring new challenges to quality of service (QoS) multicast routing simply by shifting the focus from individual flows into classes of flows. Packets are marked at edge routers and receive differentiated treatment according to the class and not the flow that they belong to. DiffServ therefore became adverse to multicast, as packet replication inside the domain may require classification and remarking functions not present in core nodes. At the interdomain level, no doubt multicast QoS complexity is increased by the interleaving of DiffServ and non-Diffserv domains, making it more difficult to address QoS multicast in an end-to-end perspective. In today’s real interconnection world, classes of service have no meaning in certain links of a full interdomain path. While the problem is not new, as already pointed out, there are no real efforts to bring multicast back to a class-of-service domain without compromising its model of operation. In this article, we present an innovative multicast QoS routing strategy, clearly designed for the new class-of-service paradigm. The solution is based upon the construction of multiple trees, one per class of service available, while still allowing receivers to shift for source-specific trees in its own class of service. The strategy is presented in a full end-to-end perspective. Intradomain trees use differentiated routing paths thus helping traffic differentiation. Intradomain receivers are allowed to shift from shared trees into an adequate class-of-service source tree. At interdomain level, each class-of-service interdomain tree branch is accomplished by means of an improved path probing strategy enabling for QoS path establishment. This paper presents this new strategy, and associated protocols, for constructing several multicast and directed distribution trees, one per class of service, within each multicast group. This new strategy and associated protocols are then simulated using NS-2 platform. Simulation results are analyzed and compared with other multicast routing solutions, both at intra- and interdomain levels

Generalized Virtual Networking: an enabler for Service Centric Networking and Network Function Virtualization

In this paper we introduce the Generalized Virtual Networking (GVN) concept. GVN provides a framework to influence the routing of packets based on service level information that is carried in the packets. It is based on a protocol header inserted between the Network and Transport layers, therefore it can be seen as a layer 3.5 solution. Technically, GVN is proposed as a new transport layer protocol in the TCP/IP protocol suite. An IP router that is not GVN capable will simply process the IP destination address as usual. Similar concepts have been proposed in other works, and referred to as Service Oriented Networking, Service Centric Networking, Application Delivery Networking, but they are now generalized in the proposed GVN framework. In this respect, the GVN header is a generic container that can be adapted to serve the needs of arbitrary service level routing solutions. The GVN header can be managed by GVN capable end-hosts and applications or can be pushed/popped at the edge of a GVN capable network (like a VLAN tag). In this position paper, we show that Generalized Virtual Networking is a powerful enabler for SCN (Service Centric Networking) and NFV (Network Function Virtualization) and how it couples with the SDN (Software Defined Networking) paradigm

Efficient Data Collection in IoT Networks using Trajectory Encoded with Geometric Shapes

The mobile edge computing (MEC) paradigm changes the role of edge devices from data producers and requesters to data consumers and processors. MEC mitigates the bandwidth limitation between the edge server and the remote cloud by directly processing the large amount of data locally generated by the network of the internet of things (IoT) at the edge. An efficient data-gathering scheme is crucial for providing quality of service (QoS) within MEC. To reduce redundant data transmission, this paper proposes a data collection scheme that only gathers the necessary data from IoT devices (like wireless sensors) along a trajectory. Instead of using and transmitting location information (which may leak the location anonymity), a virtual coordinate system called \u27distance vector of hops to anchors\u27 (DV-Hop) is used. The proposed trajectory encoding algorithm uses ellipse and hyperbola constraints to encode the position of interest (POI) and the trajectory route to the POI. Sensors make routing decisions only based on the geometric constraints and the DV-Hop information, both of which are stored in their memory. Also, the proposed scheme can work in heterogeneous networks (with different radio ranges) where each sensor can calculate the average one-hop distance within the POI dynamically. The proposed DV-Hop updating algorithm enables the users to collect data in an IoT network with mobile nodes. The experiments show that in heterogeneous IoT networks, the proposed data collection scheme outperforms two other state-of-the-art topology-based routing protocols, called ring routing, and nested ring. The results also show that the proposed scheme has better latency, reliability, coverage, energy usage, and provide location privacy compared to state-of-the-art schemes

Recoverable DTN Routing based on a Relay of Cyclic Message-Ferries on a MSQ Network

An interrelation between a topological design of network and efficient algorithm on it is important for its applications to communication or transportation systems. In this paper, we propose a design principle for a reliable routing in a store-carry-forward manner based on autonomously moving message-ferries on a special structure of fractal-like network, which consists of a self-similar tiling of equilateral triangles. As a collective adaptive mechanism, the routing is realized by a relay of cyclic message-ferries corresponded to a concatenation of the triangle cycles and using some good properties of the network structure. It is recoverable for local accidents in the hierarchical network structure. Moreover, the design principle is theoretically supported with a calculation method for the optimal service rates of message-ferries derived from a tandem queue model for stochastic processes on a chain of edges in the network. These results obtained from a combination of complex network science and computer science will be useful for developing a resilient network system.Comment: 6 pages, 12 figures, The 3rd Workshop on the FoCAS(Fundamentals of Collective Adaptive Systems) at The 9th IEEE International Conference on SASO(Self-Adaptive and Self-Organizing systems), Boston, USA, Sept.21, 201

QuLa: service selection and forwarding table population in service-centric networking using real-life topologies

The amount of services located in the network has drastically increased over the last decade which is why more and more datacenters are located at the network edge, closer to the users. In the current Internet it is up to the client to select a destination using a resolution service (Domain Name System, Content Delivery Networks ...). In the last few years, research on Information-Centric Networking (ICN) suggests to put this selection responsibility at the network components; routers find the closest copy of a content object using the content name as input. We extend the principle of ICN to services; service routers forward requests to service instances located in datacenters spread across the network edge. To solve this problem, we first present a service selection algorithm based on both server and network metrics. Next, we describe a method to reduce the state required in service routers while minimizing the performance loss caused by this data reduction. Simulation results based on real-life networks show that we are able to find a near-optimal load distribution with only minimal state required in the service routers