On the Feasibility of Dynamic, Efficient, and Scalable Name-Based Discovery Systems

摘要: Traditionally, the design of name-based discovery systems on Internet has assumed existence some underlying “efficient” routing scheme(s) that is location-aware along with a means to map from higher level names location-based identifiers (or locators). The alternative redesign scheme operate location-independent identifiers) without need for locators. literature replete such proposals, and indeed, there been renewed attention in networking community revisiting question: what if we start persistent attempt whose main currency names? Starting appealing as it eliminates notion “location” complications come overloading even separating) identity location identifiers. This potentially allows named objects relocate more seamlessly. discovery/routing however raises many questions feasibility approaches. chapter explores general models aimed at studying alternatives designing Internet. Designing system commonly challenged providing three desirable properties: scalability, efficiency, adaptability which describe shortly. While are several other dimensions involved, focus these keep space tractable explore fundamental tradeoffs designer generally faced with.