The paper presents approaches for fault tolerance and load balancing in QoS provisioning using multiple alternate paths The pro posed multiple QoS path computation algorithm searches for maximally disjoint i e minimally overlapped multiple paths such that the im pact of link node failures becomes signi cantly reduced and the use of multiple paths renders QoS services more robust in unreliable n...

In this article, a measure that quantifies the relational structure within and between groups is proposed, comprising not only analysis of disjoint or non-disjoint groups, but also fuzzy groups. This based on existing known as EI index. The current index homophily applied to networks with presence although large scale rarely exist in many empirical networks. addition, combination edge node weig...

Mobile ad-hoc network (MANET) is a dynamic collection of mobile computers without the need for any existing infrastructure. Nodes in a MANET act as hosts and routers. Designing of robust routing algorithms for MANETs is a challenging task. Disjoint multipath routing protocols address this problem and increase the reliability, security and lifetime of network. However, selecting an optimal multi...

Wireless sensor networks are subject to sensor node and link failures due to various reasons. This paper proposes an energy-efficient, k-disjoint-path routing algorithm that adaptively varies the number of disjoint paths (k) according to changing data patterns and a target-delivery ratio of critical events. The proposed algorithm sends packets through a single path (k=1) under no occurrence of ...

In an optical wavelength division multiplexing (WDM) network establishing a survivable connection involves computation of least cost disjoint (working and protection) paths. In this work we study the problem of computing edge/node disjoint path pair in WDM networks with full wavelength converters for providing shared protection. To enable greater resource sharing among protection paths we intro...

Mobile Ad Hoc network is an infrastructure less network which operates with the coordination of each node. Each node believes to help another node, by forwarding its data to/from another node. Unlike a wired network, nodes in an ad hoc network are resource (i.e. battery, bandwidth computational capability and so on) constrained. Such dependability of one node to another and limited resources of...

We are given a bipartite graph B = (U ∪̇V, E) on two disjoint node sets U and V ; each edge connects a node in U to a node in V . In the following, we define a 2-claw to be a set of three distinct nodes {u, x, y} such that u ∈ U , x, y ∈ V and there is an edge from u to both nodes x and y. We consider the following maximization problem on the graph B: Find a largest possible set of vertexdisjoin...

The QoS of Mobile Ad hoc Network is mostly affected by the congestion at any intermediate node in a selected routing path. In this paper, we propose a congestion avoidance basedload balanced routing scheme for mobile ad hoc network. Each node keeps track of the number of data packets transmitted byhim as well as the data packets transmitted by its one hop neighboring nodes along with their flag...

The objective of every sensor node in a sensor network is to send the sensed data in the phenomena to a sink node. The network lifetime is maximal, when the energy consumption of each node is uniform. Many routing protocols select an optimal path to increase the network lifetime in sensor networks. The energy of the nodes along this optimal path is consumed more, causing their early death. In t...

a r t i c l e i n f o a b s t r a c t The class of swapped or OTIS (optical transpose interconnect system) networks, built of n copies of an n-node cluster by connecting node i in cluster j to node j in cluster i for i = j, has been studied extensively. One problem with such networks is that node i of cluster i has no intercluster link. This slight asymmetry complicates a number of algorithms a...