File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: More on the Efficiency of Interval Routing

TitleMore on the Efficiency of Interval Routing
Authors
Tse, SSHLau, FCM
Issue Date1998
PublisherOxford University Press. The Journal's web site is located at http://comjnl.oxfordjournals.org/
Citation
Computer Journal, 1998, v. 41 n. 4, p. 238-242 How to Cite?
AbstractInterval routing is a space-efficient routing method for computer networks. The method is said to be optimal if it can generate optimal routing paths for any source-destination node pair. A path is optimal if it is a shortest path between the two nodes involved. A seminal result in the area, however, has pointed out that 'the interval routing algorithm cannot be optimal in networks with arbitrary topology'. The statement is correct but the lower bound on the longest routing path that was derived is not. We give the counterproof in this paper and the corrected bound.
Persistent Identifierhttp://hdl.handle.net/10722/89078
ISSN
0010-4620
2023 Impact Factor: 1.5
2023 SCImago Journal Rankings: 0.520
ISI Accession Number ID
WOS:000076241800004
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorTse, SSHen_HK
dc.contributor.authorLau, FCMen_HK
dc.date.accessioned2010-09-06T09:52:07Z-
dc.date.available2010-09-06T09:52:07Z-
dc.date.issued1998en_HK
dc.identifier.citationComputer Journal, 1998, v. 41 n. 4, p. 238-242en_HK
dc.identifier.issn0010-4620en_HK
dc.identifier.urihttp://hdl.handle.net/10722/89078-
dc.description.abstractInterval routing is a space-efficient routing method for computer networks. The method is said to be optimal if it can generate optimal routing paths for any source-destination node pair. A path is optimal if it is a shortest path between the two nodes involved. A seminal result in the area, however, has pointed out that 'the interval routing algorithm cannot be optimal in networks with arbitrary topology'. The statement is correct but the lower bound on the longest routing path that was derived is not. We give the counterproof in this paper and the corrected bound.en_HK
dc.languageengen_HK
dc.publisherOxford University Press. The Journal's web site is located at http://comjnl.oxfordjournals.org/en_HK
dc.relation.ispartofComputer Journalen_HK
dc.rightsThe Computer Journal. Copyright © Oxford University Press.en_HK
dc.titleMore on the Efficiency of Interval Routingen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0010-4620&volume=41&spage=238&epage=242&date=1998&atitle=More+on+the+Efficiency+of+Interval+Routingen_HK
dc.identifier.emailLau, FCM:fcmlau@cs.hku.hken_HK
dc.identifier.authorityLau, FCM=rp00221en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.scopuseid_2-s2.0-0032319921en_HK
dc.identifier.hkuros41147en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0032319921&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume41en_HK
dc.identifier.issue4en_HK
dc.identifier.spage238en_HK
dc.identifier.epage242en_HK
dc.identifier.isiWOS:000076241800004-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridTse, SSH=7006643113en_HK
dc.identifier.scopusauthoridLau, FCM=7102749723en_HK
dc.identifier.issnl0010-4620-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats