A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit <a rel="external noopener" href="http://mmlab.snu.ac.kr/courses/2008_topics_in_internet/paper/11.5/autoi.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Self-organising Management Overlays for Future Internet Services
[chapter]
<span title="">2008</span>
<i title="Springer Berlin Heidelberg">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a>
</i>
Preserved Fulltext
Networks are becoming service-aware implying that all relevant business goals pertaining to a service are fulfilled, and also the network resources are used optimally. Future Internet Networks (FIN) have time varying topology (e.g. such networks are envisaged in Autonomic Internet [1], FIND program [2], GENI program [3], FIRE program [4], Ambient Networks [5], Adhoc networks [6] ) and service availability and service context change as nodes join and leave the networks. In this paper we propose
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-87355-6_7">doi:10.1007/978-3-540-87355-6_7</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kdcw6jq3xfbrnf2mgndub5z63m">fatcat:kdcw6jq3xfbrnf2mgndub5z63m</a>
</span>
more »
... nd evaluate a new selforganising service management system that manages such changes known as the Overlay Management Backbones (OMBs). The OMB is a self-organising solution to the problem space in which each OMB node is dynamically assigned a different service context task. The selection of OMB nodes is conducted automatically, without the need of relatively heavy-weighted dynamic negotiations. Our solution relies on the scalability and dynamicity advantages of Distributed Hash Tables (DHTs). This system is needed to select continuously, automatically, and dynamically a set of network nodes, to become responsible for collecting the availability information of service context in the changing network. This solution advances the state of the art avoiding dynamic negotiations between all network nodes reducing management complexity and cost for bandwidth-limited environments.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809110529/http://mmlab.snu.ac.kr/courses/2008_topics_in_internet/paper/11.5/autoi.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/f7/5c/f75c9160b74ac46c5ebf22374324574431a071ae.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-87355-6_7">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
springer.com
</button>
</a>