Mobile ad hoc network is network with different applications are developing with different service requirement. In particular multimedia applications and other real-time applications e.g. voice transmission. MANET is a autonomous network where communicating entities can communicate without the aid

We give a multicast tree construction method for delay-sensitive applications by first trying to compute a constrained low cost tree spanning as many destination nodes as possible and then applying the shortest path algorithm. Experimental results through simulations show that this method greatly

use the idle spectral band and is becoming increasingly attractive because it can provide a large number of resources for delay sensitive and high-bandwidth applications such as multimedia transmission. In this paper, we show how spectrum agility may be used to satisfy delay sensitive applications

This paper deals with the performance of delay-sensitive applications running over a network that offers multiple classes of service, where the adaption of application rates in response to network feedback is the primary mechanism available for controlling quality of service. We first evaluate

Abstract-We study a wireless network in which multiple users stream delay-sensitive applications such as video conferencing and video streaming. Existing spectrum sharing policies, which determine when users access the spectrum and at what power levels, are either constant (i.e. users transmit

of data gathering is investigated at the network layer by considering the cross-layer interactions between the routing functions and the characteristics of the underwater acoustic channel. Two distributed routing algorithms are introduced for delay-insensitive and delaysensitive applications. The proposed

, when the vertices in the set R are revealed in an online fashion. This problem arises naturally while trying to construct source-based multicast trees of low cost and good delay. The cost of the tree we construct is within an O(log jRj) factor of the optimal cost, and the path length from the root

Abstract. SLA management approaches typically adopt provisioning strategies based on aggregate traffic in order to support end-to-end delay requirements of applications. They do not take into account individual flows needs in terms of delay. However, this delay can be very higher than the one

: We propose a heuristic algorithm for delayconstrained minimum cost multicast routing in the packet-switched networks. The algorithm is computationally efficient since, unlike previous heuristics, it does not rely on any enumerative step that generates a set of delay-bounded paths between a pair

We propose a new distributed delay-constrained unicast routing algorithm which can always find a delay-constrained path with small message complexity if such a path exists. At each network node, limited information about the network state is needed and only a small amount of computation is required