@incollection{furht_data_2008-1,
	title = {Data {Discovery}, {Routing} and {Traffic} {Patterns}},
	copyright = {©2008 Springer-Verlag},
	isbn = {978-0-387-74724-8 978-0-387-78414-4},
	url = {http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_286},
	abstract = {SynonymsStorage retrieval of dynamic contentDefinitionResource discovery and rendezvous mechanisms are necessary to dynamically locate media servers (e.g., the nearest or best servers), data storages, membership servers (for multicast sessions), or peers (e.g., other users) for direct connections.In general, the resource discovery module of CHaMeLeoN can be categorized as either “location-aware” or “location-free.” Location-aware architectures require availability of location information. They typically use geographic or trajectory routing to forward the updates or queries and include geographic rendezvous mechanisms (such as GLS [1], Rendezvous Regions [2], and GHT [3]) and trajectory advertisement schemes (such as TBF [4]). In location-aware networks, geographic-based distributed hash tables [2,3] are utilized to efficiently establish content based routing schemes.In earlier work [2], we designed a geographic rendezvous mechanism based on rendezvous regions. In this ...},
	language = {en},
	urldate = {2016-05-03},
	booktitle = {Encyclopedia of {Multimedia}},
	publisher = {Springer US},
	editor = {Furht, Borko},
	year = {2008},
	note = {00000},
	pages = {133--135}
}

{"_id":"SoWAqB4EXYbvFShKD","bibbaseid":"furht-datadiscoveryroutingandtrafficpatterns-2008","authorIDs":[],"bibdata":{"bibtype":"incollection","type":"incollection","title":"Data Discovery, Routing and Traffic Patterns","copyright":"©2008 Springer-Verlag","isbn":"978-0-387-74724-8 978-0-387-78414-4","url":"http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_286","abstract":"SynonymsStorage retrieval of dynamic contentDefinitionResource discovery and rendezvous mechanisms are necessary to dynamically locate media servers (e.g., the nearest or best servers), data storages, membership servers (for multicast sessions), or peers (e.g., other users) for direct connections.In general, the resource discovery module of CHaMeLeoN can be categorized as either “location-aware” or “location-free.” Location-aware architectures require availability of location information. They typically use geographic or trajectory routing to forward the updates or queries and include geographic rendezvous mechanisms (such as GLS [1], Rendezvous Regions [2], and GHT [3]) and trajectory advertisement schemes (such as TBF [4]). In location-aware networks, geographic-based distributed hash tables [2,3] are utilized to efficiently establish content based routing schemes.In earlier work [2], we designed a geographic rendezvous mechanism based on rendezvous regions. In this ...","language":"en","urldate":"2016-05-03","booktitle":"Encyclopedia of Multimedia","publisher":"Springer US","editor":[{"propositions":[],"lastnames":["Furht"],"firstnames":["Borko"],"suffixes":[]}],"year":"2008","note":"00000","pages":"133–135","bibtex":"@incollection{furht_data_2008-1,\n\ttitle = {Data {Discovery}, {Routing} and {Traffic} {Patterns}},\n\tcopyright = {©2008 Springer-Verlag},\n\tisbn = {978-0-387-74724-8 978-0-387-78414-4},\n\turl = {http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_286},\n\tabstract = {SynonymsStorage retrieval of dynamic contentDefinitionResource discovery and rendezvous mechanisms are necessary to dynamically locate media servers (e.g., the nearest or best servers), data storages, membership servers (for multicast sessions), or peers (e.g., other users) for direct connections.In general, the resource discovery module of CHaMeLeoN can be categorized as either “location-aware” or “location-free.” Location-aware architectures require availability of location information. They typically use geographic or trajectory routing to forward the updates or queries and include geographic rendezvous mechanisms (such as GLS [1], Rendezvous Regions [2], and GHT [3]) and trajectory advertisement schemes (such as TBF [4]). In location-aware networks, geographic-based distributed hash tables [2,3] are utilized to efficiently establish content based routing schemes.In earlier work [2], we designed a geographic rendezvous mechanism based on rendezvous regions. In this ...},\n\tlanguage = {en},\n\turldate = {2016-05-03},\n\tbooktitle = {Encyclopedia of {Multimedia}},\n\tpublisher = {Springer US},\n\teditor = {Furht, Borko},\n\tyear = {2008},\n\tnote = {00000},\n\tpages = {133--135}\n}\n\n","editor_short":["Furht, B."],"key":"furht_data_2008-1","id":"furht_data_2008-1","bibbaseid":"furht-datadiscoveryroutingandtrafficpatterns-2008","role":"editor","urls":{"Paper":"http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_286"},"downloads":0,"html":""},"bibtype":"incollection","biburl":"http://www.telemidia.puc-rio.br/~alan/files/all.bib","creationDate":"2020-03-03T14:08:15.042Z","downloads":0,"keywords":[],"search_terms":["data","discovery","routing","traffic","patterns"],"title":"Data Discovery, Routing and Traffic Patterns","year":2008,"dataSources":["jAxurbvLP8q5LTdLa"]}