@conference {cramer06bootstrapping,
	title = {Bootstrapping Chord in Ad hoc Networks: Not Going Anywhere for a While},
	booktitle = {Proceedings of the 3rd IEEE International Workshop on Mobile Peer-to-Peer Computing},
	year = {2006},
	type = {publication},
	address = {Pisa, Italy},
	abstract = {With the growing prevalence of wireless devices, infrastructure-less ad hoc networking is coming closer to reality. Research in this field has mainly been concerned with routing. However, to justify the relevance of ad hoc networks, there have to be applications. Distributed applications require basic services such as naming. In an ad hoc network, these services have to be provided in a decentralized way. We believe that structured peer-to-peer overlays are a good basis for their design. Prior work has been focused on the long-run performance of virtual peer-to-peer overlays over ad hoc networks. In this paper, we consider a vital functionality of any peer-to-peer network: bootstrapping. We formally show that the self-configuration process of a spontaneously deployed Chord network has a time complexity linear in the network size. In addition to that, its centralized bootstrapping procedure causes an unfavorable traffic load imbalance.},
	keywords = {ad-hoc networks, overlay networks, traffic analysis},
	doi = {10.1109/PERCOMW.2006.28},
	url = {http://i30www.ira.uka.de/research/publications/p2p/},
	author = {Cramer, Curt and Thomas Fuhrmann}
}

{"_id":"KXYqvuMoBLYNWju9W","bibbaseid":"cramer-fuhrmann-bootstrappingchordinadhocnetworksnotgoinganywhereforawhile-2006","downloads":0,"creationDate":"2018-07-03T04:50:28.334Z","title":"Bootstrapping Chord in Ad hoc Networks: Not Going Anywhere for a While","author_short":["Cramer, C.","Fuhrmann, T."],"year":2006,"bibtype":"conference","biburl":"https://gnunet.org/bibliography/export/bibtex","bibdata":{"bibtype":"conference","type":"publication","title":"Bootstrapping Chord in Ad hoc Networks: Not Going Anywhere for a While","booktitle":"Proceedings of the 3rd IEEE International Workshop on Mobile Peer-to-Peer Computing","year":"2006","address":"Pisa, Italy","abstract":"With the growing prevalence of wireless devices, infrastructure-less ad hoc networking is coming closer to reality. Research in this field has mainly been concerned with routing. However, to justify the relevance of ad hoc networks, there have to be applications. Distributed applications require basic services such as naming. In an ad hoc network, these services have to be provided in a decentralized way. We believe that structured peer-to-peer overlays are a good basis for their design. Prior work has been focused on the long-run performance of virtual peer-to-peer overlays over ad hoc networks. In this paper, we consider a vital functionality of any peer-to-peer network: bootstrapping. We formally show that the self-configuration process of a spontaneously deployed Chord network has a time complexity linear in the network size. In addition to that, its centralized bootstrapping procedure causes an unfavorable traffic load imbalance.","keywords":"ad-hoc networks, overlay networks, traffic analysis","doi":"10.1109/PERCOMW.2006.28","url":"http://i30www.ira.uka.de/research/publications/p2p/","author":[{"propositions":[],"lastnames":["Cramer"],"firstnames":["Curt"],"suffixes":[]},{"firstnames":["Thomas"],"propositions":[],"lastnames":["Fuhrmann"],"suffixes":[]}],"bibtex":"@conference {cramer06bootstrapping,\n\ttitle = {Bootstrapping Chord in Ad hoc Networks: Not Going Anywhere for a While},\n\tbooktitle = {Proceedings of the 3rd IEEE International Workshop on Mobile Peer-to-Peer Computing},\n\tyear = {2006},\n\ttype = {publication},\n\taddress = {Pisa, Italy},\n\tabstract = {With the growing prevalence of wireless devices, infrastructure-less ad hoc networking is coming closer to reality. Research in this field has mainly been concerned with routing. However, to justify the relevance of ad hoc networks, there have to be applications. Distributed applications require basic services such as naming. In an ad hoc network, these services have to be provided in a decentralized way. We believe that structured peer-to-peer overlays are a good basis for their design. Prior work has been focused on the long-run performance of virtual peer-to-peer overlays over ad hoc networks. In this paper, we consider a vital functionality of any peer-to-peer network: bootstrapping. We formally show that the self-configuration process of a spontaneously deployed Chord network has a time complexity linear in the network size. In addition to that, its centralized bootstrapping procedure causes an unfavorable traffic load imbalance.},\n\tkeywords = {ad-hoc networks, overlay networks, traffic analysis},\n\tdoi = {10.1109/PERCOMW.2006.28},\n\turl = {http://i30www.ira.uka.de/research/publications/p2p/},\n\tauthor = {Cramer, Curt and Thomas Fuhrmann}\n}\n","author_short":["Cramer, C.","Fuhrmann, T."],"key":"cramer06bootstrapping","id":"cramer06bootstrapping","bibbaseid":"cramer-fuhrmann-bootstrappingchordinadhocnetworksnotgoinganywhereforawhile-2006","role":"author","urls":{"Paper":"http://i30www.ira.uka.de/research/publications/p2p/"},"keyword":["ad-hoc networks","overlay networks","traffic analysis"],"downloads":0},"search_terms":["bootstrapping","chord","hoc","networks","going","anywhere","cramer","fuhrmann"],"keywords":["ad-hoc networks","overlay networks","traffic analysis"],"authorIDs":[],"dataSources":["FWsPTwsmjtrBtRS3B"]}