返回Google圖書搜尋

Linear Interval Routing Schemes

出版	Department of Computer Science, Utrecht University, 1991
URL	http://books.google.com.hk/books?id=SCfCtgAACAAJ&hl=&source=gbs_api

註釋Abstract: "We study a variant of Interval Routing [SK85, vLT86] where the routing range associated with every link is represented by a linear (i.e., contiguous) interval with no wrap-around. This kind of routing schemes arises naturally in the study of dynamic Prefix Routing [BvLT90]. Linear Interval Routing schemes are precisely the Prefix Routing schemes that use an alphabet of one symbol. We characterize the type of networks that admit optimum Linear Interval Routing schemes. It is shown that several well-known interconnection networks such as hypercubes, certain n-toruses, and n-dimensional grids all with unit-cost links, have optimum Linear Interval Routing schemes