We deal with routing algorithms on arbitrary n-node networks. A routing algorithm is a deterministic distributed algorithm which routes messages from any source to any destination. It includes not only the classical routing tables, but also the routing algorithm that generates paths with loops. Our goal is to design routing algorithms which minimize, for each router of the network, the amount o...

The building cost of a spanning tree is the sum of weights of the edges used to construct the spanning tree. The routing cost of a source vertex s on a spanning tree T is the total summation of distances between the source vertex s and all the vertices d in T . Given a source vertices set S, the multiple-source routing cost of a spanning tree T is the summation of the routing costs for source v...

In previous papers we proposed the ITB mechanism to improve the performance of up*/down* routing in irregular networks with source routing. With this mechanism, both minimal routing and a better use of network links are guaranteed, resulting on an overall network performance improvement. In this paper, we show that the ITB mechanism can be used with any source routing scheme in the COW environm...

One purpose of Quality-of-Service (QoS) routing is to develop polynomial-time heuristic algorithms to tackle the MCP (multi-constrained-path) problem, which is NPcomplete. In this paper, we introduce a new QoS routing heuristic framework, which focuses on how to increase the success ratio for finding a feasible path subject to multiple additive constraints. The key issue of this framework is to...

We present a new loop-free on-demand routing protocol for ad-hoc networks, the Labeled Successor Routing (LSR) protocol, which identifies loop-free successors to a destination using route-request labels (RRL). Each route request (RREQ) used during the on-demand destination search process is identified uniquely by a sequence number associated with the issuing source address. Route replies (RREP)...

In this paper, we investigate an on-demand, link-state, multi-path QoS (quality-of-service) routing protocol in a MANET, which is important for many real-time multimedia applications. The basic idea of the on-demand, link-state, multi-path routing protocol is to reactively collect link-state information from source to destination in order to dynamically construct a partial network topology whic...

We investigate the interaction of the source coding mechanism and the transport mechanism for real time data packet transmission over dense networks. We show that single path routing does not make efficient use of network capacity whereas multi path routing techniques do (Proposition 1 and 2). We then consider the interaction of single versus multiple description source coding with single versu...

With integration of software routers with embedded platform we can get the most modern routers, but with less price. TV and radio services over IP networks become available just when multicast routing is used. Multicast routing is currently feature only on expensive hardware solutions. XORP open-source platform offers multicast routing through a software router, with the possibility of integrat...

Multicast, also known as one-to-many communication, is the problem of sending a message from a single source node to several destination nodes. In this paper, we study the problem of implementing multicasts via a technique called Unicast-Based Multicast (UBM). In particular, we focus on the problem of nding optimal UBM calling schedules for arbitrary topologies using restricted inclusive routin...

An ad hoc network comprises of few particular connections which collectively collaborate to assist other connections to converse with its associates with the assistance of direct wireless broadcasting. Routing issue in ad hoc broadcasting revised routing problem in a unfavorable situations taking into assumption a secure surrounding. A Node Centric Trust based Secure Dynamic Source Routing (NCT...