This paper presents the study of the performance study of five protocols that represent various routing categories in MANET. The set of applications for MANET’s is diverse, ranging from small, static networks that are constrained by power sources, to large-scale, mobile, highly dynamic networks. The design of network routing for these networks is a complex issue. Irrespective of application, MA...

With the increasing density of VLSI circuits, interconnection wires are getting packed even closer. This has increased the effect of interaction between wires on circuit performance and hence, the importance of controlling crosstalk. Maze routing is a robust and general approach which can be used in many situations including multi-layer interconnections. In this paper, we consider crosstalk avo...

In wireless ad hoc networks, energy-constrained operation is very important due to the limited battery capacity. One of the reasons for excessive energy expenditure in this network is irregularly distributed node patterns which impose large interference range on a certain area. In this paper, we present a simple and energy efficient on-demand routing scheme by using discrete level of power cont...

CDNs can provide scalable service that can meet aggregate user demand while improving the performance and quality of delivery. Several issues arise in the architecture of the CDNs. In this paper, we consider the routing of the user requests to the most suitable surrogates or CDNs. We model the problem as a delay-constrained routing problem and develop a near-optimal routing algorithm. We evalua...

|Multipath routing employs multiple parallel paths between a traÆc source and destination in order to relax the most heavily congested link in Internet backbone. A large bandwidth path can be easily set up too. Although multipath routing is useful, the total network resources, i.e. sum of link bandwidths consumed, could be wasted when the acquired path is larger(in terms of number of hops) than...

This paper presents a new traÆc engineering technique for dynamic constrained multicast routing, where routing request of traÆc arrives one-by-one. The objective we adopted in this paper is to minimize the maximum of link utilization. Although this traÆc engineering is useful to relax the most heavily congested link in Internet backbone, the total network resources, i.e. sum of link bandwidth c...

TikiriMC is a wireless ad-hoc routing protocol, designed for resource constrained networking environments. It provides application programming interfaces to easily implement unicasting, broadcasting and multicasting. Flexible configuration of TikiriMC allows one to easily adopt it into a desired platform. TikiriMC uses tree network topology, where there can be many such trees in a single networ...

The modern network service of finding a feasible or an optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. gives rise to the multi-path constrained (MCP) or multi-constrained optimal-path (MCOP) QoS routing problems, which are NP-complete. In this paper, these problems are solved through exact algorithms. Even though exact algorithms...

Proposed in this paper is a new approach for VLSI interconnect global routing that can optimize both congestion and delay, which are often competing objectives. The authors’ approach provides a general framework that may use any single-net routing algorithm and any delay model in global routing. It is based on the observation that there are several routing topology flexibilities that can be exp...

Multicast routing algorithms that are capable of providing quality of service (QoS) to its members will play an important role in future communications networks. This paper discusses some fundamental properties of multicast routing subject to multiple QoS requirements. We will show that guaranteeing QoS and optimizing resource utilization are conflicting objectives and require a trade-off. We a...