Institutional Repository

Analysing routing strategies in sporadic networks

Show simple item record Melville, SW 2018-05-20T01:27:38Z 2018-05-20T01:27:38Z 1992
dc.identifier.citation Melville SW (1992) Analysing routing strategies in sporadic networks. South African Computer Journal, Number 6, 1992 en
dc.identifier.issn 2313-7835
dc.description.abstract Communications networks with sporadically available links pose particular problems in terms of delay analysis. This paper presents an approach to determining the effectiveness of various routing strategies when applied to such networks, the strategies considered being minimum-hop routing, shortest-path routing, and flood routing. The implementation of a simulator package for sporadic networks is discussed, with particular attention to a branch-and-bound algorithm devised for the efficient simulation of flood routing. Meteor-Burst Communications networks are used as primary examples of sporadic networks, and some preliminary results are presented. en
dc.language en
dc.language.iso en en
dc.publisher South African Institute of Computer Scientists and Information Technologists en
dc.subject Sporadic networks en
dc.subject Routing en
dc.subject Meteor-burst communications en
dc.title Analysing routing strategies in sporadic networks en
dc.type Article en

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search UnisaIR


My Account