Access the full text.
Sign up today, get DeepDyve free for 14 days.
P. Fraigniaud, C. Gavoille (1994)
Optimal Interval Routing
M. Flammini, E. Nardelli (1997)
On the path length in interval routing schemes
(1993)
Vit anyi, An Introduction to Kolmogorov Complexity and its Applications
M. Flammini, J. Leeuwen, A. Marchetti-Spaccamela (1995)
The Complexity of Interval Routing on Random GraphsComput. J., 41
J. Leeuwen, R. Tan (1987)
Interval RoutingComput. J., 30
Proc. 22nd Int. Symp. on Mathematical Foundations of Computer Science (MFCS) (Lecture Notes in Computer Science
Rastislav Kralovic, P. Ruzicka, Daniel Stefankovic (1997)
The Complexity of Shortest Path and Dilation Bounded Interval Routing
(1997)
Space-eeciency of routing schemes of stretch factor three
(1996)
RCube: a gigabit serial links low latency adaptive router
This article was processed using the L a T E X macro package with LLNCS style
D. Flynn, Alberto Laender (1985)
Mapping from a Conceptual Schema to a Target Internal SchemaComput. J., 28
S. Tse, F. Lau (1999)
On the Space Requirement of Interval RoutingIEEE Trans. Computers, 48
P. Ruzicka (1988)
On Efficiency of Interval Routing Algorithms
S. Tse, F. Lau (1999)
Some Results on the Space Requirement of Interval Routing
(1987)
Comp. J
S. Tse, F. Lau (1997)
An Optimal Lower Bound for Interval Routing in General Networks
Monowar Bhuyan, D. Bhattacharyya, Hossein Homaei, Hamid Shahriari, Jiankun Hu, Yong Yu, Yi Mu, Guilin Wang, Ying Sun, Hassan Asghar, Josef Pieprzyk, Huaxiong Wang, Jun Zhang, Yang Xiang, Wanlei Zhou, Lei Ye, Lan Zhou, Vijay Varadharajan, M. Hitchens, Lein Harn, Chia-Yin Lee, Changlu Lin, Chin-Chen Chang, Yini Wang, Sheng Wen, Silvio Cesare, Erika Rosas, Olivier Marin, Xavier Bonnaire (1958)
The Computer JournalNature, 181
P. Fraigniaud, C. Gavoille (1998)
Interval Routing SchemesAlgorithmica, 21
D. May, P. Thompson (1990)
Transputers and routers: components for concurrent machines
P. Ruzicka, Vusei-Ar (1991)
A Note on the Efficiency of an Interval Routing AlgorithmComput. J., 34
C. Gavoille, D. Peleg (1999)
The Compactness of Interval RoutingSIAM J. Discret. Math., 12
N. Santoro, Ramez Khatib (1985)
Labelling and Implicit Routing in NetworksComput. J., 28
C. Gavoille, Eric Guévremont (1998)
Worst Case Bounds for Shortest Path Interval RoutingJ. Algorithms, 27
In this paper we deal with interval routing on $n$-node networks of diameter $D$. We show that, for all $n$ and $D$ such that $2 \leq D \leq \Theta(n)$, there exists a network on which every interval routing scheme with less than $\Omega(n/(D\log (n/D)))$ intervals per link has a routing path length at least $\lfloor 3D/2\rfloor-1$. It improves the lower bound on the routing path lengths for the range of a very large number of intervals. Moreover, we build a network of bounded degree, for all $n$ and $D$ such that $\Theta(\log n) \leq D \leq \Theta(n)$, on which every interval routing scheme with less than $\Omega(n/D^2)$ intervals per link has a routing path length at least $3D/2 - O(\log n)$. Received 6 December, 2000. Revised 31 May, 2000. Copyright 2000 « Previous | Next Article » Table of Contents This Article The Computer Journal (2000) 43 (3): 243-249. doi: 10.1093/comjnl/43.3.243 » Abstract Free Full Text (PDF) Free Classifications Article Services Article metrics Alert me when cited Alert me if corrected Find similar articles Similar articles in Web of Science Add to my archive Download citation Request Permissions Citing Articles Load citing article information Citing articles via CrossRef Citing articles via Scopus Citing articles via Web of Science Citing articles via Google Scholar Google Scholar Articles by Gavoille, C. Search for related content Related Content Load related web page information Share Email this article CiteULike Delicious Facebook Google+ Mendeley Twitter What's this? Search this journal: Advanced » Current Issue November 2015 58 (11) Alert me to new issues The Journal About this journal Rights & Permissions Dispatch date of the next issue The Wilkes Award We are mobile – find out more Reviewer Guidelines Guidelines for Editors Review and Appeals Process Journals Career Network Published on behalf of BCS, The Chartered Institute for IT Impact factor: 0.787 5-Yr impact factor: 0.962 View full editorial board For Authors Instructions to authors Online submission instructions Submit a manuscript Self archiving policy Alerting Services Email table of contents Email Advance Access CiteTrack XML RSS feed Corporate Services Advertising sales Reprints Supplements var taxonomies = ("SCI01540"); Most Most Read Fast Implementation of Relational Operations Via Inverse Projections What is the Use of Operating Systems? Defining System Requirements to meet Business Needs: a Case Study Example On the Meaning of Safety and Security A Simplex Method for Function Minimization » View all Most Read articles Most Cited A Simplex Method for Function Minimization How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis Hierarchical grouping methods and stopping rules: an evaluation Function minimization by conjugate gradients A new approach to variable metric algorithms » View all Most Cited articles Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department. Online ISSN 1460-2067 - Print ISSN 0010-4620 Copyright © 2015 British Computer Society Oxford Journals Oxford University Press Site Map Privacy Policy Cookie Policy Legal Notices Frequently Asked Questions Other Oxford University Press sites: Oxford University Press Oxford Journals China Oxford Journals Japan Academic & Professional books Children's & Schools Books Dictionaries & Reference Dictionary of National Biography Digital Reference English Language Teaching Higher Education Textbooks International Education Unit Law Medicine Music Online Products & Publishing Oxford Bibliographies Online Oxford Dictionaries Online Oxford English Dictionary Oxford Language Dictionaries Online Oxford Scholarship Online Reference Rights and Permissions Resources for Retailers & Wholesalers Resources for the Healthcare Industry Very Short Introductions World's Classics function fnc_onDomLoaded() { var query_context = getQueryContext(); PF_initOIUnderbar(query_context,":QS:default","","JRN"); PF_insertOIUnderbar(0); }; if (window.addEventListener) { window.addEventListener('load', fnc_onDomLoaded, false); } else if (window.attachEvent) { window.attachEvent('onload', fnc_onDomLoaded); } var gaJsHost = (("https:" == document.location.protocol) ? "https://ssl." : "http://www."); document.write(unescape("%3Cscript src='" + gaJsHost + "google-analytics.com/ga.js' type='text/javascript'%3E%3C/script%3E")); try { var pageTracker = _gat._getTracker("UA-189672-16"); pageTracker._setDomainName(".oxfordjournals.org"); pageTracker._trackPageview(); } catch(err) {}
The Computer Journal – Oxford University Press
Published: Jan 1, 2000
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.