Cart (Loading....) | Create Account
Close category search window

On the space requirement of interval routing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tse, S.S.H. ; Dept. of Comput. Sci. & Inf. Syst., Hong Kong Univ., Hong Kong ; Lau, F.C.M.

Interval routing is a space-efficient method for point-to-point networks. It is based on labeling the edges of a network with intervals of vertex numbers (called interval labels). An M-label scheme allows up to M labels to be attached on an edge. For arbitrary graphs of size m, n the number of vertices, the problem is to determine the minimum RP necessary for achieving optimality in the length of the longest routing path. The longest routing path resulted from a labeling is an important indicator of the performance of any algorithm that runs on the network. We prove that there exists a graph with D=Ω(n1/3) such that if M⩽n/18D-O(√n/D) the longest path is no shorter than D+Θ(D/√M). As a result, for any M-label 1RS, if the longest path is to be shorter than D+Θ(D/√M), at least M=Θ(n/D) labels per edge would be necessary

Published in:

Computers, IEEE Transactions on  (Volume:48 ,  Issue: 7 )

Date of Publication:

Jul 1999

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.