Routing with deceptive information

Recent advancements in Multi-Protocol Label Switching (MPLS) based technology has brought transformation in next generation computer networking by enhancing Traffic Engineering (TE) features and Quality of Service (QoS) service parameters. Nowadays traffic management is successfully controlled by MPLS technology especially in case of underutilized or over-utilized links. The main dissimilarity between Internet Protocol (IP) and MPLS lies in the complexity of routing or switching look-up tables that seem to be less complex in latter type of networks. MPLS network tunneling is relied on a QoS routing algorithm thereby establishing a bandwidth guaranteed and less delay paths from source to destination. In this paper, a hybrid algorithm named Hybrid MPLS Tunneling Algorithm (HMTA) which comprises of bandwidth and delay differentiation techniques as well as on the basis of priority bits contained in each data packet is proposed which improves QoS routing of MPLS networks. In proposed algorithm, the differentiation of links is based on the threshold values of bandwidth and delay which is also named as the link state information. The link differentiation is done to reduce the blocking probability and number of times QoS state exchangestake place resulting in increment of QoS overheads. In order to improve the performance, this new approach is using high priority bits to accurately transmit the data-labeled or content-labeled packets to its destination by using the simulation tool MATLAB to perform the experiments. Finally, the simulation experiments demonstrate that proposed approach results in less blocking probability, high utilized bandwidth, lower packet loss, high network utilization with minimal delay.

The information landscape has become a battleground which has become sophisticated with extensive global impact. Fake news and misinformation is now jeopardizing public trust and constituting a threat to knowledge acquisition. Access to accurate information on social media is challenging. In most cases it is intentionally designed to deceive; hence, it is tagged as fake news. This deceptive information is capable of causing grave danger to the society. The authors affirmed that the use of the internet has improved the quality of education and access to knowledge remarkably; opened the floodgate to an abundance of information, knowledge, and educational resources; and increased prospects and opportunities for learning beyond the traditional classroom environment. Information pollution is a risk to knowledge. Consequently, practising good information hygiene can mitigate misinformation, thus sanitizing the procedure around information manners and helping in preventing deceptive and false information.

This paper presents a Constraint-Based Routing (CBR) algorithm for Multiprotocol Label Switching (MPLS) network which is designed for mapping among any layer-2 protocols and any layer-3 protocols of the OSI model. The MPLS network has capability of routing with some specific constraints for supporting desire Quality of Service (QoS). The most important constraint is the demand bandwidth. The efficient routing algorithm should have low percentage of call-setup request blocking, high network utilization and low calculation complexity. There are many previously proposed algorithms such as minimum hop algorithm, widest shortest path algorithm, and minimum interference routing algorithm. In this paper, a new algorithm is proposed. The proposed algorithm is based on the weight calculation of an amounts of paths routed over each links in the network. From the simulation results, the proposed algorithm has well performance over high network utilization, low blocking percentage and low complexity.

Internet instability, also referred to as route flaps, can propagate to the whole Internet and consume remarkable computational resource of the routers. Route Flap Damping (RFD) [1] is designed to stabilize the Internet by suppressing persistent route flaps. RFD is a penalty basedmechanism.Themagnitude of the penalty value indicates the degree of instability of an inter-domain route.Once the penalty reaches a certain threshold, the route will be suppressed. This simple mechanism does not work perfectly. First, the way it identifies route flaps or accumulates penalty is too aggressive and may suppress a fairly stable route with a few occasional flaps. Second, a route may be suppressed even after it has converged.

An unmanned aerial vehicle communication Networks (UAVCN) is a group of UAVs (unmanned aerial vehicles) that is able to communicate and trigger information to each other for a particular mission. This network node is power limited. However, the routing mechanism should be improved which extend the lifetime and performance of UAV nodes. This manuscript intends to introduce a concept of a cross-layer method for efficient power and routing for UAVCN to increase communication performance. The cross-layer methodology integrates the physical, link and network layer. An efficient power optimized link state routing (EP-OLSR) protocol is proposed which is an extension to optimized link state routing (OLSR) protocol. The proposed routing protocol evaluated by developing scenarios of UAVCN in OPNET modeler 14.5. The simulation is carried out by implementing OLSR and EP-OLSR using different network parameters and compared the routing protocols performance. The results showed that the EP-OLSR maximizes network performance efficiency as compared to OLSR. It minimizes the delay and maximizes the throughput and increases the network performance.

Internet service providers face a daunting challenge in provisioning network resources, due to the rapid growth of the Internet and wide fluctuations in the underlying traffic patterns. The ability of dynamic routing to circumvent congested links and improve application performance makes it a valuable traffic engineering tool. However, deployment of load-sensitive routing is hampered by the overheads imposed by link-state update propagation, path selection, and signaling. Under reasonable protocol and computational overheads, traditional approaches to load-sensitive routing of IP traffic are ineffective, and can introduce significant route flapping, since paths are selected based on out-of-date link-state information. Although stability is improved by performing load-sensitive routing at the flow level, flapping still occurs, because most IP flows have a short duration relative to the desired frequency of link-state updates. To address the efficiency and stability challenges of load-sensitive routing, we introduce a new hybrid approach that performs dynamic routing of long-lived flows, while forwarding short-lived flows on static preprovisioned paths. By relating the detection of long-lived flows to the timescale of link-state update messages in the routing protocol, route stability is considerably improved. Through simulation experiments using a one-week ISP packet trace, we show that our hybrid approach significantly outperforms traditional static and dynamic routing schemes, by reacting to fluctuations in network load without introducing route flapping.

Internet service providers face a daunting challenge in provisioning network resources, due to the rapid growth of the Internet and wide fluctuations in the underlying traffic patterns. The ability of dynamic routing to circumvent congested links and improve application performance makes it a valuable traffic engineering tool. However, deployment of load-sensitive routing is hampered by the overheads imposed by link-state update propagation, path selection, and signaling. Under reasonable protocol and computational overheads, traditional approaches to load-sensitive routing of IP traffic are ineffective, and can introduce significant route flapping, since paths are selected based on out-of-date link-state information. Although stability is improved by performing load-sensitive routing at the flow level, flapping still occurs, because most IP flows have a short duration relative to the desired frequency of link-state updates. To address the efficiency and stability challenges of load-sensitive routing, we introduce a new hybrid approach that performs dynamic routing of long-lived flows, while forwarding short-lived flows on static preprovisioned paths. By relating the detection of long-lived flows to the timescale of link-state update messages in the routing protocol, route stability is considerably improved. Through simulation experiments using a one-week ISP packet trace, we show that our hybrid approach significantly outperforms traditional static and dynamic routing schemes, by reacting to fluctuations in network load without introducing route flapping.

Previous studies on routing and wavelength assignment algorithms assumed that the global link state information is obtained without delays. However, in distributed lightpath establishment, the probability of request blocking strongly depends on both the accuracy of the global link state information and the distributed protocol for wavelength reservation. In this paper, we evaluate how the frequency of link state information exchange affects the blocking probability in lightpath establishment. The evaluation is performed based on forward and backward reservation protocols in three network topologies. Simulation results show that while the forward reservation protocol is greatly affected by the frequency of link state information exchange and the amount of this information, the backward reservation protocol does not need as detailed information about the link state and as frequent link state exchange for routing as does the forward protocol.

An ad hoc network, a self-organizing wireless network is made up of mobile nodes, each node act as relay for providing data communication. The topology of the ad hoc networks changes often and needs large and frequent exchange of data among the network nodes for efficient routing. Existing routing protocols are distance vector method and link state routing protocols. The location information of the adhoc network nodes are broadcasted within the transmission range. The enemy can receive the location information of the nodes. Current position aided routing protocols were not designed for use in high risk environment. We have proposed a method for secured routing in adhoc network. It is a hierarchical method to solve the above problem. This method need not maintain the route information explicitly. This reduces the number of query control messages and suits well in dynamic environment. This method is better adaptive to dynamic environment than the present proactive, reactive and zone routing protocol methods (ZRP) and improves the security, efficiency and performance in ad-hoc routing.

Link state has been the dominating IGP routing technology in IP networks for more than a decade. With the advent of wireless ad-hoc networking, the need for light, efficient and robust routing makes it a good candidate to be also used in this constrained environment. One of the key issue in ad-hoc networking is the lack of bandwidth. Thus, in this paper we examine the overhead due to link state routing in an ad-hoc network. More precisely we study the classic link-state protocol OSPF and OLSR, a link state protocol that was developed specifically for ad-hoc networks. Further, we study how this overhead evolves when the node density increases. The last part of the paper presents directions towards extending OSPF for wireless and ad-hoc networks, which would make it a favorite to seamlessly unify wired and mobile IP networks.

Link State Advertisement (LSA) reflects the current status of all incident links of a router in an Autonomous System (AS). A fake LSA with false link status information will pollute the view of the network topology on routers. In this paper, we present two novel attacks that inject malicious Link State Advertisements (LSAs) to modify the routing tables: adjacency spoofing and single path injection. Adjacency spoofing attack makes attacker access to routing networks by disguising as a legitimate router. Single path injection attack evades the “fight-back” mechanism and affects routing advertisements of routers. Unlike existing LSA injection attacks, which need to be launched by malicious routers, a common host can launch these attacks and control the transmission path of data traffic in an AS. Simulation and real-world experiment results show that these two attacks can efficiently modify the routing tables of routers, and further lead to DNS spoofing, phishing Website, eavesdropping, and manin-the-middle attacks. Furthermore, we also implement a security vulnerability detection system to detect the existing vulnerabilities of routing protocol deployed in real-world routers.

The first comparison of the performance of name-based content routing protocols based on distance vectors and link-states is presented. The protocols used for this comparison are the Named-data Link State Routing (NLSR) protocol, which is the main representative of name-based content routing based on link states, and the Distance-based Content Routing (DCR) protocol, which is the first name-based content routing protocol based on distance vectors. In the simulation of NLSR, the signaling of NLSR is simplified to minimize the overhead it incurs sending link state advertisements (LSAs), such that a single transmission is need to send an LSA, rather than multiple transmission as is the case with NLSR. The results of simulations show that the ideal version of NLSR requires fewer control messages to react to changes of name prefixes when the number of replicas is very small, and DCR incurs less signaling overhead to react to topology changes or changes in name prefixes when the number of replicas is large.

OSPF is a commonly used link state routing protocol in order to interconnect network devices inside an Autonomous System. This paper focuses on achieving a detailed modelling for OSPF by performing manual algebraic derivations according to Algebra of Communicating Processes (ACP) axioms. The aim of this detailed model is to get a realistic approach of OSPF dynamics by applying the timers involved and by describing the full Link State Advertisement (LSA) exchange process.DOI: http://dx.doi.org/10.5755/j01.eie.24.4.21484

ATM networks support multimedia traffic where diverse services have to be provided and various QoS requirements have to be met. Routing plays an important role in guaranteeing the QoS. However conventional routing will cause a significant overhead when the network size gets very large or rerouting occurs frequently due to the varying link state. The objective of our dynamic routing scheme is to perform more efficient routing over a more effective and simpler topology which is abstracted from the original full topology based on the dynamic link state. Only those links with high probability to satisfy the QoS of the call are included in the effective topology. It is an efficient way to prevent rerouting from occurring too often because the blocking probability over this effective topology is significantly low. A hierarchical routing model is also proposed to further reduce the amount of information that has to be stored and exchanged for routing. We present the simulation results of our dynamic routing scheme along with the hierarchical routing model and its implementation over QUARTS, a simulation testbed for ATM networks.

Service differentiation in wireless LANs is a growing demand, due to their increasing use for applications with different requirements and the scarcity of wireless channel resources. The contribution of this paper is twofold: First, we investigate how various parameters of the IEEE 802.11 MAC protocol affect service differentiation, in terms of both throughput and delay. Second, we propose a new approach for providing service differentiation, while achieving high wireless network utilization. Simulation investigations demonstrate that our approach can effectively adapt to varying network conditions. The approach can be implemented at the access point of a wireless LAN, while the wireless stations need only to support the emerging IEEE 802.11e standard.