A longstanding problem in the context of computer networks is the issue of recovery from link failures. A promising solution to safeguard all single link failures (SLF) is through partial up gradation of certain IP ro...
详细信息
A longstanding problem in the context of computer networks is the issue of recovery from link failures. A promising solution to safeguard all single link failures (SLF) is through partial up gradation of certain IP routers (Internet Protocol(IP)) to Software Defined Networking (SDN) switches using CSA (candidate selection algorithms). The resultant network comprises a combination of IP routers and SDN switches, forming a hybrid IP/SDN network. Most of the existing approaches primarily address SLFs, yet real-world scenarios may involve multiple link failures (MLF). Hence, it's crucial to investigate CSA for Hybrid IP/SDN with MLF. In this paper, we first introduce four CSA strategies tailored for hybrid IP/SDN networks with MLF. Subsequently, we present a CSA designed to accommodate network scaling or expansion. We emphasize the advantage of CSAs based on non-shortest path approach. Additionally, we propose a budget constraint-based CSA to aid in selecting suitable candidate switches within a specified budget. We evaluate the performance of hybrid IP/SDN networks employing the proposed CSAs, considering average repair path length (AMLU) and average maximum link utilization (AMLU) in the post-recovery network across diverse real-world network topologies. It will be shown that the hybrid IP/SDN with proposed CSA for MLFs will reduce the ARPL by 31.37%, 22.15%, and 18.64%, respectively, for NSF, Attmpls, and Abilene networks.
In hybrid Internet Protocol(IP)/Software Defined Network (SDN) only few of the IP nodes are replaced with SDN switches to reduce cost and implementation complexity. These SDN switches are called as candidate switches....
详细信息
ISBN:
(纸本)9798350309843
In hybrid Internet Protocol(IP)/Software Defined Network (SDN) only few of the IP nodes are replaced with SDN switches to reduce cost and implementation complexity. These SDN switches are called as candidate switches. In this paper, we study the performance of hybrid IP/SDN network to tolerate bidirectional link failures. We first obtain the candidate switches using two candidate selection algorithms (CSAs) referred to as Greedy CSA and Minimum CSA. Next, we study Greedy and Minimum CSAs by considering only one shortest path between any two nodes in the network. Later, we extend these CSAs by considering all shortest paths between all nodes in the network. Moreover, we address the problem of deploying additional candidate switches if the constraints on budget (Number of candidate switches) are relaxed. The performance of the considered CSAs are evaluated in terms of average repair path length and maximum link utilization on various real world network topologies.
Opportunistic Routing protocols use broadcast nature of wireless communication to improve packet delivery from source to destination in mobile ad hoc network (MANET). In traditional routing protocols for MANET, each n...
详细信息
Opportunistic Routing protocols use broadcast nature of wireless communication to improve packet delivery from source to destination in mobile ad hoc network (MANET). In traditional routing protocols for MANET, each node uses the best neighbor for forwarding packet to destination. In opportunistic routing, a node selects and prioritizes multiple nodes which can act as potential packet forwarders. Similar to traditional routing protocols, opportunistic routing assumes that all nodes participating in the network are honest and cooperative. However, this is practically difficult in an open MANET. Few nodes participating in the network may behave selfishly;these nodes drop packets and do not offer service to other nodes. Such behavior exhibited by the nodes may cause a collapse of MANET communication. The selfish behavior attack is addressed by researchers for many existing MANET routing protocols. There are just a few works, which address selfish nodes attack for opportunistic routing protocols. The paper proposes an opportunistic routing protocol which can overcome the presence of selfish nodes. The proposed protocol discovers reliable candidate nodes for packet forwarding using a new metric called 'path goodness'. The path goodness metric takes into account trustworthiness of the nodes on a path to the destination. The protocol decides trustworthiness of the nodes using packet forwarding behavior of the nodes. The work is a trust based extension of CORMAN opportunistic routing protocol. Simulation results show that, the proposed opportunistic routing protocol improves the packet delivery ratio by approximately 10 % in the presence of selfish nodes.
暂无评论