Guilherme B. Araújo, M. Peixoto, Leobino N. Sampaio
We present NDN for Inter-Vehicle Communication (NDN4IVC) framework for simulating realistic VANET applications over the NDN architecture. The project uses two popular simulators in the literature for VANET simulation, the network simulator ns3, with the ndnSIM module installed, and SUMO, a simulator for urban mobility. NDN4IVC allows real-time bidirectional communication between SUMO and ns3 to support more data about road traffic and vehicular mobility.
{"title":"NDN4IVC","authors":"Guilherme B. Araújo, M. Peixoto, Leobino N. Sampaio","doi":"10.1145/3517212.3559483","DOIUrl":"https://doi.org/10.1145/3517212.3559483","url":null,"abstract":"We present NDN for Inter-Vehicle Communication (NDN4IVC) framework for simulating realistic VANET applications over the NDN architecture. The project uses two popular simulators in the literature for VANET simulation, the network simulator ns3, with the ndnSIM module installed, and SUMO, a simulator for urban mobility. NDN4IVC allows real-time bidirectional communication between SUMO and ns3 to support more data about road traffic and vehicular mobility.","PeriodicalId":165903,"journal":{"name":"Proceedings of the 9th ACM Conference on Information-Centric Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123742175","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
An NDN network is made of named entities with various trust relations between each other. Entities are organized into trust zones. Each trust zone contains the entities under the same administrative control. This work-in-progress explores an approach to establishing trust relations between trust zones.
{"title":"Intertrust","authors":"Tianyuan Yu, Xinyu Ma, Hongcheng Xie, Yekta Kocaoğullar, Lixia Zhang","doi":"10.1145/3517212.3559489","DOIUrl":"https://doi.org/10.1145/3517212.3559489","url":null,"abstract":"An NDN network is made of named entities with various trust relations between each other. Entities are organized into trust zones. Each trust zone contains the entities under the same administrative control. This work-in-progress explores an approach to establishing trust relations between trust zones.","PeriodicalId":165903,"journal":{"name":"Proceedings of the 9th ACM Conference on Information-Centric Networking","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122326059","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Named Data Networking (NDN) redefines the concept of network security from securing the channel that transports data to securing the data itself by singing each Data packet at the network layer. Trust schema, which defines the relationship between a Data packet and its signer, plays a vital role in NDN security. However, to ensure the proper use of trust schema, it should be easy to define, user-friendly, and most importantly, automated. The recently proposed Versec trust schema is a promising next step for this automation and user-friendliness. Although Versec is designed for versatile security, the initial design choices are mainly targeted at a local environment. However, we want to use Versec in more generalized environments and analyze whether the current binary encoding can achieve it as it is or not. Based on our analysis, we identified several ways to make Versec more versatile.
{"title":"On improving versatility of Versec trust schema","authors":"P. Podder, A. Afanasyev","doi":"10.1145/3517212.3559487","DOIUrl":"https://doi.org/10.1145/3517212.3559487","url":null,"abstract":"Named Data Networking (NDN) redefines the concept of network security from securing the channel that transports data to securing the data itself by singing each Data packet at the network layer. Trust schema, which defines the relationship between a Data packet and its signer, plays a vital role in NDN security. However, to ensure the proper use of trust schema, it should be easy to define, user-friendly, and most importantly, automated. The recently proposed Versec trust schema is a promising next step for this automation and user-friendliness. Although Versec is designed for versatile security, the initial design choices are mainly targeted at a local environment. However, we want to use Versec in more generalized environments and analyze whether the current binary encoding can achieve it as it is or not. Based on our analysis, we identified several ways to make Versec more versatile.","PeriodicalId":165903,"journal":{"name":"Proceedings of the 9th ACM Conference on Information-Centric Networking","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125073677","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Incremental deployment of new Internet architecture is a key challenge for the smooth evolution of the current Internet. In NDN, the overlay-based deployment is considered as one of the promising options to provide NDN services over the Internet. To achieve an incremental deployment, it is required to design a bootstrapping mechanism that allows consumers to consistently access to an overlay NDN network in a situation where Autonomous Systems (AS) are gradually deploying NDN routers. In this paper, we analyzed the current bootstrapping and identified its potential issue in specifying the IP address of the closest NDN router. We propose a robust bootstrapping architecture that can work without specifying the exact IP address of a single NDN router. By using in-network indirection, our scheme can provide consistent access to the NDN network independent of the deployment status of each AS.
{"title":"Towards an incremental deployment of NDN: robust bootstrapping using in-network indirection","authors":"Kazuaki Ueda, C. Sasaki, A. Tagami","doi":"10.1145/3517212.3559486","DOIUrl":"https://doi.org/10.1145/3517212.3559486","url":null,"abstract":"Incremental deployment of new Internet architecture is a key challenge for the smooth evolution of the current Internet. In NDN, the overlay-based deployment is considered as one of the promising options to provide NDN services over the Internet. To achieve an incremental deployment, it is required to design a bootstrapping mechanism that allows consumers to consistently access to an overlay NDN network in a situation where Autonomous Systems (AS) are gradually deploying NDN routers. In this paper, we analyzed the current bootstrapping and identified its potential issue in specifying the IP address of the closest NDN router. We propose a robust bootstrapping architecture that can work without specifying the exact IP address of a single NDN router. By using in-network indirection, our scheme can provide consistent access to the NDN network independent of the deployment status of each AS.","PeriodicalId":165903,"journal":{"name":"Proceedings of the 9th ACM Conference on Information-Centric Networking","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127932406","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Routing, forwarding strategy, and dataset synchronization (sync) are three well-known components of Named Data Networking (NDN). This poster reports a work-in-progress evaluation on the relationship between routing, forwarding strategy, and sync, especially for scenarios with ad hoc mobile conditions with intermittent connectivity.
{"title":"On supporting forwarding strategies and sync protocols through NDN distance vector routing","authors":"I. Brito, L. Sampaio, Lixia Zhang","doi":"10.1145/3517212.3559490","DOIUrl":"https://doi.org/10.1145/3517212.3559490","url":null,"abstract":"Routing, forwarding strategy, and dataset synchronization (sync) are three well-known components of Named Data Networking (NDN). This poster reports a work-in-progress evaluation on the relationship between routing, forwarding strategy, and sync, especially for scenarios with ad hoc mobile conditions with intermittent connectivity.","PeriodicalId":165903,"journal":{"name":"Proceedings of the 9th ACM Conference on Information-Centric Networking","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130999411","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Zhanghuixian Luo, Tianlong Li, Qianyu Zhang, Ran Zhu, Tian Song
A global name mapping system is required for ICN-IP coexistence. This poster presents a global name mapping system to provide general name mapping services while ensuring query performance and scalability. With efficient general name mapping and dynamic update mechanisms, the system can serve as a common infrastructure in ICN-IP coexistence architecture. We implement the name mapping system, and the preliminary evaluation results show that it outperforms legacy DNS for query performance and is scalable. Compared to BIND 9, the QPS of the system is improved by 130%, and the response time is reduced by more than 60%.
{"title":"A global name mapping system for ICN-IP coexistence","authors":"Zhanghuixian Luo, Tianlong Li, Qianyu Zhang, Ran Zhu, Tian Song","doi":"10.1145/3517212.3559492","DOIUrl":"https://doi.org/10.1145/3517212.3559492","url":null,"abstract":"A global name mapping system is required for ICN-IP coexistence. This poster presents a global name mapping system to provide general name mapping services while ensuring query performance and scalability. With efficient general name mapping and dynamic update mechanisms, the system can serve as a common infrastructure in ICN-IP coexistence architecture. We implement the name mapping system, and the preliminary evaluation results show that it outperforms legacy DNS for query performance and is scalable. Compared to BIND 9, the QPS of the system is improved by 130%, and the response time is reduced by more than 60%.","PeriodicalId":165903,"journal":{"name":"Proceedings of the 9th ACM Conference on Information-Centric Networking","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127676319","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Information-centric networks (ICNs) intrinsically support multipath transfer and thus have been seen as an exciting paradigm for IoT and edge computing, not least in the context of 5G mobile networks. One key to ICN's success in these and other networks that have to support a diverse set of services over a heterogeneous network infrastructure is to schedule traffic over the available network paths efficiently. This paper presents and evaluates ZQTRTT, a multipath scheduling scheme for ICN that load balances bulk traffic over available network paths and schedules latency-sensitive, non-bulk traffic to reduce its transfer delay. A new metric called zero queueing time (ZQT) ratio estimates path load and is used to compute forwarding fractions for load balancing. In particular, the paper shows through a simulation campaign that ZQTRTT can accommodate the demands of both latency-sensitive and -insensitive traffic as well as evenly distribute traffic over available network paths.
{"title":"ZQTRTT","authors":"B. Ahlgren, Karl-Johan Grinnemo","doi":"10.1145/3517212.3558080","DOIUrl":"https://doi.org/10.1145/3517212.3558080","url":null,"abstract":"Information-centric networks (ICNs) intrinsically support multipath transfer and thus have been seen as an exciting paradigm for IoT and edge computing, not least in the context of 5G mobile networks. One key to ICN's success in these and other networks that have to support a diverse set of services over a heterogeneous network infrastructure is to schedule traffic over the available network paths efficiently. This paper presents and evaluates ZQTRTT, a multipath scheduling scheme for ICN that load balances bulk traffic over available network paths and schedules latency-sensitive, non-bulk traffic to reduce its transfer delay. A new metric called zero queueing time (ZQT) ratio estimates path load and is used to compute forwarding fractions for load balancing. In particular, the paper shows through a simulation campaign that ZQTRTT can accommodate the demands of both latency-sensitive and -insensitive traffic as well as evenly distribute traffic over available network paths.","PeriodicalId":165903,"journal":{"name":"Proceedings of the 9th ACM Conference on Information-Centric Networking","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131419189","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The native multicast support in Named Data Networking (NDN) is an attractive feature, as multicast content delivery can reduce the redundant traffic and improve the network performance, especially in the wireless edge network. With the awareness of content, NDN routers automatically aggregate the same requests from different end hosts and establish network-layer multicast. However, the current link-layer multicast based on host-centric MAC address management is inflexible. Consequently, supporting NDN dynamic multicast with the current link-layer architecture remains a challenge. In this paper, we propose iCast, short for dynamic information-centric multicast, to enable dynamic multicast in the link layer. Our work has three major contributions. First, iCast collaborates NDN native multicast with the host-centric link layer and meanwhile keeps the host-centric property of the current link layer. Second, iCast achieves per-packet dynamic multicast in the link layer and we further propose a hash-based iCast variant for dynamic connection. Third, iCast is implemented in real testbed and the evaluation results show that iCast reduces up to 59.53% traffic compared with vanilla NDN. iCast bridges the gap between NDN multicast and the host-centric link-layer multicast.
{"title":"iCast","authors":"Tianlong Li, T. Song, Yating Yang, Jike Yang","doi":"10.1145/3517212.3558082","DOIUrl":"https://doi.org/10.1145/3517212.3558082","url":null,"abstract":"The native multicast support in Named Data Networking (NDN) is an attractive feature, as multicast content delivery can reduce the redundant traffic and improve the network performance, especially in the wireless edge network. With the awareness of content, NDN routers automatically aggregate the same requests from different end hosts and establish network-layer multicast. However, the current link-layer multicast based on host-centric MAC address management is inflexible. Consequently, supporting NDN dynamic multicast with the current link-layer architecture remains a challenge. In this paper, we propose iCast, short for dynamic information-centric multicast, to enable dynamic multicast in the link layer. Our work has three major contributions. First, iCast collaborates NDN native multicast with the host-centric link layer and meanwhile keeps the host-centric property of the current link layer. Second, iCast achieves per-packet dynamic multicast in the link layer and we further propose a hash-based iCast variant for dynamic connection. Third, iCast is implemented in real testbed and the evaluation results show that iCast reduces up to 59.53% traffic compared with vanilla NDN. iCast bridges the gap between NDN multicast and the host-centric link-layer multicast.","PeriodicalId":165903,"journal":{"name":"Proceedings of the 9th ACM Conference on Information-Centric Networking","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122028916","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Named data networking (NDN) can improve the consumer data retrieval throughput with its built-in multicast data delivery, innetwork caching, and ability to support multi-path forwarding. However, their realization brings challenges. In this work, we first examine how multi-path forwarding and in-network caching can interfere with consumer measurements for congestion control. Based on the results, we propose a congestion control solution, NDN-QSF, that can work effectively in the presence of in-network caching. In NDN-QSF, forwarders estimate upstream bandwidth and use queue size as congestion feedback to inform downstream routers to limit interest transmission rates. We further adapt and extend NDN-QSF to enable routers to make informed multi-path forwarding decisions. We evaluated NDN-QSF through simulation experimentation and our results show that NDN-QSF can effectively control congestion by using queue size as congestion feedback and improve network throughput with multi-path forwarding.
{"title":"Effective NDN congestion control based on queue size feedback","authors":"Sichen Song, Lixia Zhang","doi":"10.1145/3517212.3558088","DOIUrl":"https://doi.org/10.1145/3517212.3558088","url":null,"abstract":"Named data networking (NDN) can improve the consumer data retrieval throughput with its built-in multicast data delivery, innetwork caching, and ability to support multi-path forwarding. However, their realization brings challenges. In this work, we first examine how multi-path forwarding and in-network caching can interfere with consumer measurements for congestion control. Based on the results, we propose a congestion control solution, NDN-QSF, that can work effectively in the presence of in-network caching. In NDN-QSF, forwarders estimate upstream bandwidth and use queue size as congestion feedback to inform downstream routers to limit interest transmission rates. We further adapt and extend NDN-QSF to enable routers to make informed multi-path forwarding decisions. We evaluated NDN-QSF through simulation experimentation and our results show that NDN-QSF can effectively control congestion by using queue size as congestion feedback and improve network throughput with multi-path forwarding.","PeriodicalId":165903,"journal":{"name":"Proceedings of the 9th ACM Conference on Information-Centric Networking","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130361654","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we introduce an information-centric service mesh for autonomous in-network computing. The information-centric service mesh offers service-centric networking, not connectivity-based networking provided by the current container orchestration, like Kubernetes (K8s). We implement the information-centric service mesh by adopting an ambassador container style and using Cefore and Cefpyco which is the CCNx software implementation developed by NICT in Japan. For the proof-of-concept test, we demonstrate the end-to-end delay of more complex service chain models (up to 17 nodes) on our K8s cluster.
{"title":"Information-centric service mesh for autonomous in-network computing","authors":"Kenji Kanai, T. Tsuda, H. Nakazato, J. Katto","doi":"10.1145/3517212.3559481","DOIUrl":"https://doi.org/10.1145/3517212.3559481","url":null,"abstract":"In this paper, we introduce an information-centric service mesh for autonomous in-network computing. The information-centric service mesh offers service-centric networking, not connectivity-based networking provided by the current container orchestration, like Kubernetes (K8s). We implement the information-centric service mesh by adopting an ambassador container style and using Cefore and Cefpyco which is the CCNx software implementation developed by NICT in Japan. For the proof-of-concept test, we demonstrate the end-to-end delay of more complex service chain models (up to 17 nodes) on our K8s cluster.","PeriodicalId":165903,"journal":{"name":"Proceedings of the 9th ACM Conference on Information-Centric Networking","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126199811","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：