A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf
.
Filters
A model for naming, addressing and routing
1986
ACM Transactions on Information Systems
On this basis, a general model relating names, addresses, and routes is built and then applied recursively throughout a layered architecture, leading to a layered naming and addressing model which may ...
Many definitions for names, addresses, and routes have been proposed, but the exact relations among these concepts are obscure. A taxonomy of names, addresses, and routes is presented. ...
General Model To send a message to a destination entity whose name is known, the name is mapped into an address and then the address is mapped into a route. ...
doi:10.1145/9760.9761
fatcat:yxrj7z3sobhg3k3zqqluksg2ja
Dynamic names and private address maps
2006
Proceedings of the 2006 ACM CoNEXT conference on - CoNEXT '06
A key aspect of our scheme is that routing is based on names rather than on addresses as the latter play a debatable role in ad hoc networks. ...
We discuss the architectural impact of this approach in the bigger context of names, addresses, routability, and self-configuring networks, and report on our implementation. ...
"how to get there") without having to rely on IP addresses for naming, routing and forwarding. ...
doi:10.1145/1368436.1368442
dblp:conf/conext/JelgerT06
fatcat:vm7a57ppnvgnxkkenolhbisjga
On the Memory Requirement of Hop-by-Hop Routing: Tight Bounds and Optimal Address Spaces
2020
IEEE/ACM Transactions on Networking
We derive tight space bounds for many well-known graph families and we propose a simple heuristic to find optimal address spaces for general graphs. ...
Index Terms-Compact routing, name independent and name dependent routing, information theory, routing table entropy. ...
A flat address space for hierarchical routing, on the other hand, would introduce an extra name-to-address mapping step in all communication sessions [12] . ...
doi:10.1109/tnet.2020.2984761
fatcat:jqo5bqnfezaf7mjncesn56ddfe
Networking is IPC
2008
Proceedings of the 2008 ACM CoNEXT Conference on - CONEXT '08
The application processes that make up this facility provide a protocol that implements an IPC mechanism, and a protocol for managing distributed IPC (routing, security and other management tasks). ...
Rather we outline the repeating patterns and structures, and how the proposed model would cope with the challenges faced by today's Internet (and that of the future). ...
In our model, routing is a two-step process: a route is first determined as a sequence of node addresses, then to reach the next-hop (i.e., next node address) along the route, one has to choose a path, ...
doi:10.1145/1544012.1544079
dblp:conf/conext/DayMM08
fatcat:cjz7wkijyjd4nebujiriwwfc6a
Enhanced MILSA Architecture for Naming, Addressing, Routing and Security Issues in the Next Generation Internet
2009
2009 IEEE International Conference on Communications
system, a three-level identifier resolution system, a new hierarchical code based design for locator structure, cooperative mechanisms among the three planes in MILSA model to assist mapping and routing ...
MILSA (Mobility and Multihoming supporting Identifier Locator Split Architecture) [1] has been proposed to address the naming and addressing challenges for NGI (Next Generation Internet). we present several ...
Actually, descriptive name is also used for service discovery in the service model of MILSA which will also be addressed later in this paper. ...
doi:10.1109/icc.2009.5198998
dblp:conf/icc/PanJPBXC09
fatcat:xnbu6sj6rbej7pibopkr4eyacq
A Survey of the Research on Future Internet and Network Architectures
2013
IEICE transactions on communications
This survey paper addresses key research issues and then introduces ongoing research projects from Japan, the United States and the European Union. ...
The Internet was designed for academic use more than 40 years ago. ...
There are two approaches for forwarding packets as shown in Fig. 1 of Sect. 1: (a-2) name resolution and (a-3) name-based routing. Routing based on flat identifiers is discussed in Sect. 3.3.2. ...
doi:10.1587/transcom.e96.b.1385
fatcat:554cvm4bonb6ta4is4lzqfjloy
Page 352 of Communication Abstracts Vol. 15, Issue 3
[page]
1992
Communication Abstracts
Addresses act as bridges between names and routes. ...
A route tells the operator how to get there; routing is the activity of deriving the route from a name, or, in other words, mapping a name into a route. ...
Towards a quantitative comparison of location-independent network architectures
2014
Proceedings of the 2014 ACM conference on SIGCOMM - SIGCOMM '14
Our approach is empirical and is based on real Internet topologies, routing tables from real routers, and a measured workload of the mobility of devices and content across network addresses today. ...
These results suggest that recent proposals for pure name-based networking may be suitable for highly aggregateable content that moves infrequently but may need to be augmented with addressing-assisted ...
We thank the paper's reviewers, the shepherd Scott Shenker, and Antonio Rocha, Dave Oran, Lixia Zhang, and participants at NSF FIA meetings for their feedback. ...
doi:10.1145/2619239.2626333
dblp:conf/sigcomm/GaoVKH14
fatcat:p6b63lhx4bhnfcmutpbho3hvvm
Towards a quantitative comparison of location-independent network architectures
2014
Computer communication review
Our approach is empirical and is based on real Internet topologies, routing tables from real routers, and a measured workload of the mobility of devices and content across network addresses today. ...
These results suggest that recent proposals for pure name-based networking may be suitable for highly aggregateable content that moves infrequently but may need to be augmented with addressing-assisted ...
We thank the paper's reviewers, the shepherd Scott Shenker, and Antonio Rocha, Dave Oran, Lixia Zhang, and participants at NSF FIA meetings for their feedback. ...
doi:10.1145/2740070.2626333
fatcat:p5ls52fyh5h4nknso3evzjcvam
Rapid Prototyping of Routing Protocols with Evolving Tuples
[chapter]
2008
Lecture Notes in Computer Science
In this paper, we describe the evolving tuples model and demonstrate how a simple protocol can be quickly and easily developed. ...
Since the evolving tuples infrastructure serves as a unifying base across heterogeneous platforms, the resulting implementation inherently supports cross-platform deployment, a common scenario for pervasive ...
Acknowledgments The authors would like to thank the Center for Excellence in Distributed Global Environments for providing research facilities and the collaborative environment. ...
doi:10.1007/978-3-540-68642-2_24
fatcat:bnjf73osi5fqri7yxrrgtmr3te
Cyber Threat Trend Analysis Model Using HMM
2007
Third International Symposium on Information Assurance and Security
Our contribution constitutes the first step in designing security models for convergence architectures as part of their design and deployment phases, rather than as retrofitted mechanisms. ...
Current research trends in networks and telecommunications suggest that future architectures will aim for the convergence not only of fixed and mobile infrastructures, but also of different network layer ...
In the following subsections we will present two proposals that address the need for network convergence, namely OCALA and TRAN-SIT. ...
doi:10.1109/ias.2007.19
dblp:conf/IEEEias/KimLJIL07
fatcat:gwhxvfqi4neonlkerryswzugnu
On name-based inter-domain routing
2011
Computer Networks
In this paper, we propose an inter-domain rendezvous design that combines policybased name routing between adjacent networks with hierarchical interconnection overlays for scalable global connectivity. ...
Extensive domain-level simulations show good performance for our solution in terms of overlay-induced latency, inter-domain path stretch and routing load distribution. ...
Before joining RWTH he worked in a variety of research projects on wireless networks at VTT Electronics and at the Centre for Wireless Communications at University of Oulu. ...
doi:10.1016/j.comnet.2010.12.014
fatcat:wjp2b7vw6vcmxmjbngclwririu
Responsible Source Multicasting
[chapter]
2012
Lecture Notes in Computer Science
SSM allows using all the SSM address range for every source IP addresses and limits the address allocation problem inside the host of the source; however, its significant drawback is that the SSM has no ...
To address the recent problems of the Internet wide multisource multicast session a novel IP multicast service model, the Responsible Source Multicasting -RSM is introduced in this paper. ...
The work reported in the paper has been developed in the framework of the project "Talent care and cultivation in the scientific workshops of BME". ...
doi:10.1007/978-3-642-32808-4_19
fatcat:w57rkv545fatdbiouhzs35rf2u
Plutarch
2003
Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture - FDNA '03
It is widely accepted that the current Internet architecture is insufficient for the future: problems such as address space scarcity, mobility and non-universal connectivity are already with us, and stand ...
To handle this heterogeneity, we introduce the notions of context and interstitial function, and describe a supporting architecture. ...
This leads to a requirement for globally-bound names and addresses. ...
doi:10.1145/944759.944763
dblp:journals/ccr/CrowcroftHMRW03
fatcat:2dusayzmlzbc7kaqva6stpuruq
A survey of naming and routing in information-centric networks
2012
IEEE Communications Magazine
through the Korea Science and Engineering Foundation funded by the Ministry of Education, Science and Technology (Project No. ...
ACKNOWLEDGMENT This work was supported in part by the Natural Science and Engineering Council of Canada (NSERC) under its Strategic program, in part by Orange Labs France, and in part by the WCU program ...
REQUIREMENTS OF AN IDEAL CONTENT NAMING AND ROUTING MODEL: OUR PERSPECTIVE Based on our analysis, we now present our perspective on suitable design choices for naming and routing models in ICN. ...
doi:10.1109/mcom.2012.6384450
fatcat:7slzzbsewbfslpsgb2ovps6que
« Previous
Showing results 1 — 15 out of 436,186 results