题名: |
BIT-STREAM REPRESENTATION OF TIME-DEPENDENT DATA : APPLICATIONS TO DATA COMMUNICATION AND PROCESSING. |
作者: |
Chabini-Ismail; Yadappanavar-Vinay |
关键词: |
Computer-algorithms; Data-communications; Data-transmission-systems; Parallel-processing; Routing-; Travel-time |
摘要: |
In this paper, we present two applications of a new and compact representation of link exit times. The first application is efficient communication of travel time functions between different geographical locations. The second is to solve the one-to-all fastest path problem in dynamic networks. We develop the new space efficient representation that exploits the nature of link travel times in dynamic networks. We present its application in communication of travel time functions that lies at the heart of Intelligent Transportation Systems operations. We then describe the fastest path algorithm and illustrate its working on a simple network. This algorithm performs logical operations on 0 and 1 bits only. Furthermore, one could develop parallel algorithms that operate at the bit-level on registers. The ideas behind the development of this algorithm are extendable to the development of algorithms operating at the bit-level, to solve other variants of dynamic shortest path problems as well as other dynamic network flow problems. The developments of this paper then open new horizons in the research area of communication of dynamic functions and development of solution algorithms for dynamic network problems. |
总页数: |
ITS America. Meeting (10th : 2000 : Washington, D.C..). revolutionary thinking, real results : ITS 2000 : conference proceedings. 2000. pp20 |
报告类型: |
科技报告 |