Analysing routing strategies in sporadic networks

dc.contributor.author	Melville, S
dc.contributor.editor	Linck, M.H.
dc.date.accessioned	2018-08-06T13:40:38Z
dc.date.available	2018-08-06T13:40:38Z
dc.date.issued	1991
dc.identifier.citation	Melville, S. (1991) Analysing routing strategies in sporadic networks. Proceedings of the 6th Southern African Computer Symposium, De Overberger Hotel, Caledon, 2-3 July 1991	en
dc.identifier.uri	http://hdl.handle.net/10500/24567
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.iso	en	en
dc.title	Analysing routing strategies in sporadic networks	en