today, one of the new technologies in the modern era is vehicular ad-hoc network which has takenenormous attention in the recent years. because of rapid topology changing and frequent disconnectionmakes it difficult to design an efficient routing protocol for routing data between vehicles, called v2v orvehicle to vehicle communication and vehicle to roadside infrastructure, called v2i. designin...

A recent result in network calculus theory provided statistical delay bounds for exponentially bounded traffic that grow as O(H log H) with the number of nodes on the network path. In this paper we establish the corresponding lower bound which shows that under these assumptions, typical end-to-end delays can indeed grow as Θ(H log H). The lower bound is obtained by analyzing the end-to-end dela...

This paper addresses the problem of finding the worst case end-to-end delay and buffer occupancy bounds in ATM networks with rate-controlled, non-work conserving servers. A theoretical framework is constructed to analyze such servers in isolation and in tandem. The analysis is based on a simple fluid model, but care is taken so that the computed delay and buffer occupancy values are upper bound...

This paper describes an end-to-end method for extracting moving targets from a real-time video stream, classifying them into predefined categories according to imagebased properties, and then robustly tracking them. Moving targets are detected using the pixel wise difference between consecutive image frames. A classification metric is applied these targets with a temporal consistency constraint...

In this paper we propose an end-to-end approach to scheduling tasks that share resources in a multipro-cessor or distributed systems. In our approach, each task is mapped into a chain of subtasks, depending on its resource accesses. After each subtask is assigned a proper priority, its worst-case response time can be bounded. Consequently the worst-case response time of each task can be obtaine...

In this paper we investigate the relationship between capacity and network topology for Bluetooth scatternets. We start by considering the intrinsic capacity limits of a scatternet structure, and we show that capacity may be approached in the presence of very local traffic only and under specific conditions on the scatternet structure. A worst case analysis is presented, addressing the performa...

Network calculus is an elegant theory which uses envelopes to determine the worst-case performance bounds in a network. Statistical network calculus is the probabilistic version of network calculus, which strives to retain the simplicity of envelope approach from network calculus and use the arguments of statistical multiplexing to determine probabilistic performance bounds in a network. One of...

A recent result in network calculus theory provided statistical delay bounds for exponentially bounded traffic that grow as O(H logH) with the number of nodes on the network path. In this paper we establish the corresponding lower bound which shows that for such such types of traffic, typical end-toend delays can indeed grow as Θ(H logH). The lower bound is obtained by analyzing the end-to-end ...