Search

Intelligent transportation systems (ITSs) have become increasingly important for public transportation in Shanghai, China. In response, ShanghaiGrid (SG) aims to provide abundant intelligent transportation services to improve traffic conditions. A fundamental service in SG is to locate the nearest desirable vehicles for users. In this paper, we propose an innovative protocol called ANTS to locate a desirable vehicle close to the querying user. The protocol finely mimics the efficient searching strategy adopted by a lost ant searching for its nest. Taking query locality into account, ANTS can retrieve the closest vehicles satisfying the query with high probability but incurs small query latency and modest network traffic. ANTS is a fully distributed and robust protocol and, therefore, has good scalability. Extensive simulations based on the real road network and the trace data of vehicle movements in Shanghai demonstrate the efficacy of ANTS. [ABSTRACT FROM AUTHOR]

Intelligent transportation systems have become increasingly important for the public transportation in Shanghai. In response, ShanghaiGrid (SG) project aims to provide abundant intelligent transportation services to improve the traffic condition. A challenging service in SG is to accurately locate the positions of moving vehicles in real time. In this paper, we present an innovative scheme, Hierarchical Exponential Region Organization (HERO), to tackle this problem. In SG, the location information of individual vehicles is actively logged in local nodes which are distributed throughout the city. For each vehicle, HERO dynamically maintains an advantageous hierarchy on the overlay network of local nodes to conservatively update the location information only in nearby nodes. By bounding the maximum number of hops the query is routed, HERO guarantees to meet the real-time constraint associated with each vehicle. A small-scale prototype system implementation and extensive simulations based on the real road network and trace data of vehicle movements from Shanghai demonstrate the efficacy of HERO. [ABSTRACT FROM AUTHOR]

Peer-to-peer (P2P) networks have been emerging as one of the most promising approaches to improve the scalability of video-on-demand (VoD) service over Internet. Although a number of architectures and streaming protocols have been proposed in past years, there is few work to study the practical performance of P2P-based VoD service especially considering the real user behavior which actually has significant impact on the system scalability. Therefore, in this paper, we first characterize the user behavior by analyzing a large amount of real traces from a popular VoD system supported by the biggest television station in China, cctv.com. Then, we examine the practical scalability of P2P-based VoD service through extensive trace-driven simulation under a general system framework. The results show that P2P networks scale well in providing VoD service under real user behavior by saving a considerable percentage of server bandwidth. Moreover, it is observed that adopting hard cache at client side achieves much better system scalability than that with soft cache. We also identify the impact of various aspects of user behavior upon system scalability through detailed simulation. We believe that our study will shine insightful light on the understanding of practical scalability of P2P-based VoD service and be helpful to future system design and optimization. [ABSTRACT FROM AUTHOR]