iTETRIS: An Integrated Wireless and Traffic Platform for Real-Time Road Traffic Management Solutions

Wireless vehicular cooperative systems have been identified as an attractive solution to improve road traffic management, thereby contributing to the European goal of safer, cleaner, and more efficient and sustainable traffic solutions. V2V-V2I communication technologies can improve traffic management through real-time exchange of data among vehicles and with road infrastructure. It is also of great importance to investigate the adequate combination of V2V and V2I technologies to ensure the continuous and costefficient operation of traffic management solutions based on wireless vehicular cooperative solutions. However, to adequately design and optimize these communication protocols and analyze the potential of wireless vehicular cooperative systems to improve road traffic management, adequate testbeds and field operational tests need to be conducted. Despite the potential of Field Operational Tests to get the first insights into the benefits and problems faced in the development of wireless vehicular cooperative systems, there is yet the need to evaluate in the long term and large dimension the true potential benefits of wireless vehicular cooperative systems to improve traffic efficiency. To this aim, iTETRIS is devoted to the development of advanced tools coupling traffic and wireless communication simulators

On Compact Routing for the Internet

While there exist compact routing schemes designed for grids, trees, and Internet-like topologies that offer routing tables of sizes that scale logarithmically with the network size, we demonstrate in this paper that in view of recent results in compact routing research, such logarithmic scaling on Internet-like topologies is fundamentally impossible in the presence of topology dynamics or topology-independent (flat) addressing. We use analytic arguments to show that the number of routing control messages per topology change cannot scale better than linearly on Internet-like topologies. We also employ simulations to confirm that logarithmic routing table size scaling gets broken by topology-independent addressing, a cornerstone of popular locator-identifier split proposals aiming at improving routing scaling in the presence of network topology dynamics or host mobility. These pessimistic findings lead us to the conclusion that a fundamental re-examination of assumptions behind routing models and abstractions is needed in order to find a routing architecture that would be able to scale ``indefinitely.''Comment: This is a significantly revised, journal version of cs/050802