A layered naming architecture for the Internet

被引:66
作者
Balakrishnan, H [1 ]
Lakshminarayanan, K
Ratnasamy, S
Shenker, S
Stoica, I
Walfish, M
机构
[1] MIT, Comp Sci & Artificial Intelligence Lab, Cambridge, MA 02139 USA
[2] Univ Calif Berkeley, Div Comp Sci, Berkeley, CA 94720 USA
[3] Intel Res, Berkeley, CA USA
关键词
naming; Internet architecture; name resolution; distributed hash tables; middleboxes; global identifiers;
D O I
10.1145/1030194.1015505
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Currently the Internet has only one level of name resolution, DNS, which converts user-level domain names into IP addresses. In this paper we borrow liberally from the literature to argue that there should be three levels of name resolution: from user-level descriptors to service identifiers; from service identifiers to endpoint identifiers; and from endpoint identifiers to IP addresses. These additional levels of naming and resolution (1) allow services and data to be first class Internet objects (in that they can be directly and persistently named), (2) seamlessly accommodate mobility and multihoming and (3) integrate middleboxes (such as NATs and firewalls) into the Internet architecture. We further argue that flat names are a natural choice for the service and endpoint identifiers. Hence, this architecture requires scalable resolution of flat names, a capability that distributed hash tables (DHTs) can provide.
引用
收藏
页码:343 / 352
页数:10
相关论文
共 59 条
  • [1] ANDERSEN DG, 2003, 4 USENIX S INT TECHN
  • [2] ANDERSON T, 2003, 2 ACM HOTN WORKSH CA
  • [3] [Anonymous], 17 IEEE COMP SOC INT
  • [4] [Anonymous], 2003, P NETW DISTR SYST SE
  • [5] [Anonymous], 2000, INTERNET REQUEST COM
  • [6] [Anonymous], 1996, 1992 RFC
  • [7] Looking up data in P2P systems
    Balakrishnan, I
    Kaashoek, MF
    Karger, D
    Morris, R
    Stoica, I
    [J]. COMMUNICATIONS OF THE ACM, 2003, 46 (02) : 43 - 48
  • [8] Scalable human-friendly resource names
    Ballintijn, G
    van Steen, M
    Tanenbaum, AS
    [J]. IEEE INTERNET COMPUTING, 2001, 5 (05) : 20 - 27
  • [9] BRADEN R, 2002, 1 ACM HOTN WORKSH PR
  • [10] CALVERT KL, 2002, ACM SIGCOMM