An optimised geographically-aware overlay network

Le, H; Hoang, D; Simmonds, A

An optimised geographically-aware overlay network

Le, H Hoang, D

Simmonds, A

Permalink

Publication Type:: Conference Proceeding
Citation:: 2005 3rd IEEE International Conference on Industrial Informatics, INDIN, 2005, 2005 pp. 372 - 377
Issue Date:: 2005-12-01

Closed Access

	Filename	Description	Size
	2005002455.pdf		3.04 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Le, H	en_US
dc.contributor.author	Hoang, D https://orcid.org/0000-0003-1798-4926	en_US
dc.contributor.author	Simmonds, A	en_US
dc.date.issued	2005-12-01	en_US
dc.identifier.citation	2005 3rd IEEE International Conference on Industrial Informatics, INDIN, 2005, 2005 pp. 372 - 377	en_US
dc.identifier.isbn	0780390946	en_US
dc.identifier.isbn	9780780390942	en_US
dc.identifier.uri	http://hdl.handle.net/10453/2908
dc.description.abstract	The mismatch between current Peer-to-Peer (P2P) overlay structures and the underlying network topology causes high end-to-end latency and inefficient network resource usage. This paper presents a self-organising overlay network that closely reflects the underlying network topology by using the basic idea of a node locating scheme called Geographical Longest Prefix Matching (Geo-LPM) [1]. Geo-LPM combines IP prefixes and a network metric measurement to cluster nodes efficiently. We optimise Geo-LPM to adapt to different geographical locations so that nodes in the same clusters often belong to the same physical network. We propose to implement Geo-LPM in a distributed fashion. As a result, the overlays utilise the underlying network resources more efficiently and reduce the delay from end-to-end. The system is self-organising, distributed, and decentralised with low overhead. © 2005 IEEE.	en_US
dc.relation.ispartof	2005 3rd IEEE International Conference on Industrial Informatics, INDIN	en_US
dc.relation.isbasedon	10.1109/INDIN.2005.1560405	en_US
dc.title	An optimised geographically-aware overlay network	en_US
dc.type	Conference Proceeding
utslib.citation.volume	2005	en_US
utslib.for	0805 Distributed Computing	en_US
dc.location.activity	Perth, Aust	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Systems, Management and Leadership
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US
pubs.volume	2005	en_US

Abstract:

The mismatch between current Peer-to-Peer (P2P) overlay structures and the underlying network topology causes high end-to-end latency and inefficient network resource usage. This paper presents a self-organising overlay network that closely reflects the underlying network topology by using the basic idea of a node locating scheme called Geographical Longest Prefix Matching (Geo-LPM) [1]. Geo-LPM combines IP prefixes and a network metric measurement to cluster nodes efficiently. We optimise Geo-LPM to adapt to different geographical locations so that nodes in the same clusters often belong to the same physical network. We propose to implement Geo-LPM in a distributed fashion. As a result, the overlays utilise the underlying network resources more efficiently and reduce the delay from end-to-end. The system is self-organising, distributed, and decentralised with low overhead. © 2005 IEEE.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/2908