Controllability problemsof dynamical high-order multi-agent systems are concerned. Amethodology on graph topology transformation is proposed, which can help to analyze the controllability. According to this methodology, a path can be regarded as controllability canonical form of graph, and any controllable graph can be transformed into an equivalent path. Besides, controllability of heterogeneo...

Video on Demand applications emerge on campus wide networks Compressed video streams pass switches which do not have any bandwidth reservation mech anism nor any other mechanism against congestion The switches shared among video servers WWW servers and clients get easily congested in critical sit uations hence the switches drop packets and the qual ity of end to end delivery service degrades To...

This paper proposes a fair packet distribution scheme on a multi-interfaced mobile router (MMR) for mobile networks. In the proposed scheme, the MMR with multiple heterogeneous wireless network interfaces effectively and fairly distributes incoming packets over end-to-end multi-path. Each network interface is considered to have a distribution counter associated with corresponding end-to-end pat...

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...

Modeling complicated vehicular traffic behavior and analyzing effects on the communication performance of routing protocols taken by environmental factors have been a challenging task for the past several years. In this paper, we study the performance of multi-path routing protocol. Then, we investigate both multi-path and single-path routing protocol and analyze characteristics such as network...

The paper proposes a Distributed Hash Table (DHT)-based multi-path routing protocol for scalable ad hoc networks. Specifically, we propose a multipath-based improvement to a recently proposed DHT-based shortest-path routing protocol, namely the Dynamic Address RouTing (DART). The resulting protocol, referred to as multi-path DART (M-DART), guarantees multi-path forwarding without introducing an...

The shortest path tree construction is essential in network routing, and the Dijkstra algorithm, which is a static routing algorithm, is widely used. When some links in a network have new weights, dynamic routing algorithms are more efficient than static routing algorithms. This is because the dynamic routing algorithms reduce redundancy by recomputing only the affected sections of the network ...