TY - GEN
T1 - Fuzzy interest forwarding
AU - Chan, Kevin
AU - Ko, Bongjun
AU - Mastorakis, Spyridon
AU - Afanasyev, Alexander
AU - Zhang, Lixia
N1 - Funding Information:
This work is partially sponsored by the U.S. Army Research Laboratory and the U.K. Ministry of Defence under Agreement Number W911NF-16-3-0001, and the National Science Foundation under awards CNS-1345318 and CNS-1629922. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the U.S. Army Research Laboratory, the U.S. Government, the U.K. Ministry of Defence or the U.K. Government. The U.S. and U.K. Governments are authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation hereon.
Funding Information:
This work is partially sponsored by the U.S. Army Research Laboratory and the U.K. Ministry of Defence under Agreement Number W911NF-16-3-0001, and the National Science Foundation under awards CNS-1345318 and CNS-1629922. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the U.S. Army Research Laboratory, the U.S. Government, the U.K. Ministry of Defence or the U.K. Government.
Publisher Copyright:
© 2017 Association for Computing Machinery.
PY - 2017/11/20
Y1 - 2017/11/20
N2 - In the current Named Data Networking implementation, forwarding a data request requires finding an exact match between the prefix of the name carried in the request and a forwarding table entry. However, consumers may not always know the exact naming, or an exact prefix, of their desired data. The current approach to this problem-establishing naming conventions and performing name lookup-can be infeasible in highly ad hoc, heterogeneous, and dynamic environments: the same data can be named using different terms or even languages, naming conventions may be minimal if they exist at all, and name lookups can be costly. In this paper, we present a fuzzy Interest forwarding approach that exploits semantic similarities between the names carried in Interest packets and the names of potentially matching data in CS and entries in FIB. We describe the fuzzy Interest forwarding approach and outline the semantic understanding function that determines the name matching.
AB - In the current Named Data Networking implementation, forwarding a data request requires finding an exact match between the prefix of the name carried in the request and a forwarding table entry. However, consumers may not always know the exact naming, or an exact prefix, of their desired data. The current approach to this problem-establishing naming conventions and performing name lookup-can be infeasible in highly ad hoc, heterogeneous, and dynamic environments: the same data can be named using different terms or even languages, naming conventions may be minimal if they exist at all, and name lookups can be costly. In this paper, we present a fuzzy Interest forwarding approach that exploits semantic similarities between the names carried in Interest packets and the names of potentially matching data in CS and entries in FIB. We describe the fuzzy Interest forwarding approach and outline the semantic understanding function that determines the name matching.
KW - Fuzzy matching
KW - Interest forwarding
KW - Named data networking
UR - http://www.scopus.com/inward/record.url?scp=85040626375&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85040626375&partnerID=8YFLogxK
U2 - 10.1145/3154970.3154975
DO - 10.1145/3154970.3154975
M3 - Conference contribution
AN - SCOPUS:85040626375
T3 - Asian Internet Engineering Conference, AINTEC 2017
SP - 31
EP - 37
BT - Asian Internet Engineering Conference, AINTEC 2017
PB - Association for Computing Machinery, Inc
T2 - 13th Asian Internet Engineering Conference, AINTEC 2017
Y2 - 20 November 2017 through 22 November 2017
ER -