We study the problem of constructing multicast trees to meet the quality of service requirements of real-time, interactive applications operating in high-speed packet-switched environments. In particular, we assume that multicast communication depends on (a) bounded delay along the paths from the source to each destination, and (b) bounded variation among the delays along these paths. We rst es...

Providing end-to-end delay has been an important issue in Quality of Service enabled networks. If we can assign a call’s end-to-end delay requirement optimally to each node along the route of that call, the whole network can be better utilized. In practice, routers in a network are likely to use different packet scheduling policies. Due to the differences in the scheduling policies, delay bound...

Vehicular ad hoc networks (VANETs) are special case of mobile ad hoc networks (MANETs) with predictable mobility constraints. In VANETs, non real-time applications are appreciated as compared to real time applications because of very frequent network partitions caused by high node mobility. The focus of this paper is on Delay tolerant networks (DTNs). DTNs are special type of networks which fol...

There exist some studies in Proportional Scheduling Algorithms for Differentiated Service Network which schedules the packets between different classes proportionally based on some metrics as bandwidth, loss, delay. In this paper, the behaviors of RJPS (Relative Jitter Packet Scheduler) and another proportional delay scheduler (WTP), as well as its influence at the Playout Buffer which uses Con...

| We study the problem of constructing multi-cast trees to meet the quality of service requirements of real-time interactive applications operating in high-speed packet-switched environments. In particular, we assume that multicast communication depends on (a) bounded delay along the paths from the source to each destination, and (b) bounded variation among the delays along these paths. We rst ...

We describe an efficient and accurate approximation method for calculating the bandwidth that should be allocated on each link along the path of a point-to-point MPLS connection, so that the end-to-end delay D is less than or equal to a given value T with a probability γ, that is, P(D≤T) = γ. We model a connection by a tandem queueing network of infinite capacity queues. The arrival process of ...

An end-to-end round trip time (RTT) is one of the most important communication characteristics for Internet applications. In order to meet the quality of service (QoS) for applications such as streaming services, it is important to understand and predict the delay characteristic accurately. Because characteristics of the packet transmission delay in the Internet vary strongly related to the tim...

End-System multicasting (ESM) is a promising application-layer scheme that has been recently proposed for implementing multicast routing in the application layer as a practical alternative to the IP multicasting. Moreover, ESM is an efficient application layer solution where all the multicast functionality is shifted to the end users. However, the limitation in bandwidth and the fact that the m...

Videoconferencing is an important global application it enables people around tha globe to interact when they are far from one another. In order for the participants in a videoconfierence call to interact naturally, the end-to-end delay should be below human perception about 100 tus. Since the global propagation delay can be about 100 ms, the actual end-to-end delay budget available to the syst...

Conventional methods of discovering network topology require the cooperation of network elements. We present a method of network topology discovery based solely upon end-to-end delay measurements that requires only the cooperation of end systems. Previous work using end-to-end measurements has focused on discovering tree topologies; the method here discovers more general networks. The discovery...