Proceedings of the 14th International Conference on Future Internet Technologies最新文献

筛选
英文 中文
Delayed Packet Forwarding for Information-Centric Networking 以信息为中心的延迟报文转发
Yuichi Yasuda, Ryo Nakamura, H. Ohsaki
{"title":"Delayed Packet Forwarding for Information-Centric Networking","authors":"Yuichi Yasuda, Ryo Nakamura, H. Ohsaki","doi":"10.1145/3341188.3341194","DOIUrl":"https://doi.org/10.1145/3341188.3341194","url":null,"abstract":"In this paper, we analytically derive the average content delivery delay with delayed packet forwarding in ICN (Information-Centric Networking), which is a mechanism to intentionally delay forwarding of a content request packet (Interest packet) at routers. In ICNs, when a router receives multiple Interest packets requesting the identical content, it can aggregate those Interest packets into a single Interest packet. This makes it possible to reduce the number of Interest packets and Data packets transferred through a network. In this paper, we focus on the delayed packet forwarding that intentionally delays Interest packet forwarding at routers, which aims to increase the aggregation probability at routers. By introducing the delayed packet forwarding to a router, we expect that the aggregation probability is increased, which leads to the reduction in the amount of traffic transfer. In contrast, to intentionally delay packet forwarding at routers might increase content delivery delay between an entity and a repository. In this paper, we therefore derive the average content delivery delay and throughput with and without the delayed packet forwarding in a dumb-bell network topology to quantitatively reveal the effectiveness of delayed packet forwarding. We also investigate the effectiveness of delayed packet forwarding through numerical examples and simulation experiments. Our findings include that, by introduction of delayed packet forwarding, the throughput can be improved by 12% when the output buffer of the repository is small.","PeriodicalId":237715,"journal":{"name":"Proceedings of the 14th International Conference on Future Internet Technologies","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131823110","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}
引用次数: 0
Multiple-Cache Pairing for Fine-Grained Scalable Video Caching and Networking 用于细粒度可扩展视频缓存和网络的多缓存配对
Qiushi Gong, J. Woods, K. Kar, Jacob Chakareski
{"title":"Multiple-Cache Pairing for Fine-Grained Scalable Video Caching and Networking","authors":"Qiushi Gong, J. Woods, K. Kar, Jacob Chakareski","doi":"10.1145/3341188.3341196","DOIUrl":"https://doi.org/10.1145/3341188.3341196","url":null,"abstract":"In this paper, we consider fine-grained scalable video caching to provide video-on-demand (VoD) service, where exclusive-or (XOR) network coding is adopted to reduce data traffic. To further reduce backhaul data traffic, caches are grouped into pairs, which can be modeled as a maximum-weighted matching (MWM) problem. A heuristic harmony search algorithm is employed to solve the problem. Numerical results show that cache cooperating in pairs can help limiting backhaul data traffic. Further, the algorithm is shown to achieve greater backhaul traffic savings than other approximate MWM solutions.","PeriodicalId":237715,"journal":{"name":"Proceedings of the 14th International Conference on Future Internet Technologies","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124892026","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}
引用次数: 0
Probing Firewalls of Malware-Infected Networks with Honeypot 利用蜜罐探测恶意软件感染网络的防火墙
Hyuga Kobayashi, Zhiqing Zhang, H. Ochiai, H. Esaki
{"title":"Probing Firewalls of Malware-Infected Networks with Honeypot","authors":"Hyuga Kobayashi, Zhiqing Zhang, H. Ochiai, H. Esaki","doi":"10.1145/3341188.3341190","DOIUrl":"https://doi.org/10.1145/3341188.3341190","url":null,"abstract":"Today, regardless of firewalls deployed at the gateway of the local area networks (LAN), the hosts inside the LAN are frequently got infected by malware. Firewall should be the basic protection scheme, but the effectiveness of firewalls has been recently questioned. We propose a federation scheme of Firewall Probe and Honeypot for investigating the firewall type of malware-infected networks. By capturing network scan made on the Internet by honeypot, we can find the malicious source, and we deploy our firewall probe targeting to the source and categorize the network type into Type A (safe) ... Type E (alert). We investigated firewalls remotely in this way for both randomly-selected networks in global and malware-infected networks. The experiment results indicate that about 91.9% of malware-infected networks does not have even basic firewalls, but left of the networks -- 8.1% were well-protected regarding their firewall. Even those well-protected networks certainly made malicious Internet scanning from behind their firewalls.","PeriodicalId":237715,"journal":{"name":"Proceedings of the 14th International Conference on Future Internet Technologies","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127895888","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}
引用次数: 4
An Alternative Fast Packet I/O with Native System Calls 具有本机系统调用的可选快速包I/O
Ryo Nakamura, Yohei Kuga, Y. Sekiya
{"title":"An Alternative Fast Packet I/O with Native System Calls","authors":"Ryo Nakamura, Yohei Kuga, Y. Sekiya","doi":"10.1145/3341188.3341193","DOIUrl":"https://doi.org/10.1145/3341188.3341193","url":null,"abstract":"This paper proposes an alternative high-speed packet I/O that enables user-space applications to receive and transmit packets at high speeds using the read() and write() system call families. Recent high-speed packet I/O frameworks have opened up new application designs optimized for network performance. However, they have two obstacles to implementing applications: restraints on programming models and limitations on NICs. These frameworks provide applications with APIs to access packets in kernel space without memory copies instead of well-generalized APIs, such as the socket API. Thus, the applications would be tightly coupled with the framework-specific APIs, and would be forced to adopt the APIs' programming models. Moreover, typical frameworks require specific NICs, which the frameworks support for their optimization. In contrast, the proposed packet I/O, called hpio, adapts native system calls for the packet I/O API and works with native device drivers. These advantages offer developers an easy way to implement various high-speed applications. Our measurement results demonstrate that hpio achieved over 40 Mpps with 60-byte packets, although it involves memory copies on system calls and no optimization of packet buffers.","PeriodicalId":237715,"journal":{"name":"Proceedings of the 14th International Conference on Future Internet Technologies","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129664757","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}
引用次数: 0
Inferring ADU Combinations from Encrypted QUIC Stream 从加密QUIC流推断ADU组合
Hua Wu, Guang Cheng, Xiaoyan Hu
{"title":"Inferring ADU Combinations from Encrypted QUIC Stream","authors":"Hua Wu, Guang Cheng, Xiaoyan Hu","doi":"10.1145/3341188.3341192","DOIUrl":"https://doi.org/10.1145/3341188.3341192","url":null,"abstract":"Video traffic has experienced rapid growth in the past and will continue to grow rapidly. It is an essential issue to monitor video streaming for both network management and network security. With the popularity of encrypted video, most of the analysis methods are based on the extraction of application data units (ADUs) from an encrypted stream. However, that QUIC streaming use multiplexing makes it impossible to extract ADU from encrypted QUIC streaming. In an effort to overcome this challenge, we proposed a method to extract application data unit combination (ADUC) from encrypted QUIC streaming instead. Taking YouTube video streaming as an example, several stream features are defined. These features are used to develop machine learning models for classifying the ADUC types in the encrypted YouTube QUIC video streaming. The feasibility and accuracy of the method are validated by the actual encrypted YouTube QUIC video streams. Our proposed method represents an initial step towards the analysis of encrypted QUIC streaming.","PeriodicalId":237715,"journal":{"name":"Proceedings of the 14th International Conference on Future Internet Technologies","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115959342","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}
引用次数: 5
A Framework for Resource-aware Online Traffic Classification Using CNN 基于CNN的资源感知在线流量分类框架
Wanqian Zhang, Junxiao Wang, Sheng Chen, Heng Qi, Keqiu Li
{"title":"A Framework for Resource-aware Online Traffic Classification Using CNN","authors":"Wanqian Zhang, Junxiao Wang, Sheng Chen, Heng Qi, Keqiu Li","doi":"10.1145/3341188.3341195","DOIUrl":"https://doi.org/10.1145/3341188.3341195","url":null,"abstract":"As a fundamental problem in network security and management, traffic classification has attracted more and more research interest. In existing work, machine learning based traffic classification methods are mainstream in recent years. With the development of deep learning, Convolutional Neural Network (CNN) is widely used in traffic classification, achieving promising results. However, prior work only focuses on how to improve the accuracy of classification tasks without considering the time efficiency. As we know, the deep learning models require a lot of computational overhead. Therefore it is necessary to realize realtime CNN-based traffic classification with limited computational resources. In this paper, we propose a new framework for online traffic classification using CNN. By detecting CPU occupancy in real time, the proposed framwork can seek optimal window sizes using a regression model of meta-parameters to achieve accuracy at a lower cost of resources. The simulation experiments with real trace data show that the proposed framework significantly reduces processing latency by about 77%, while achieving matchable accuracy of classification compared to the state-of-the-art method.","PeriodicalId":237715,"journal":{"name":"Proceedings of the 14th International Conference on Future Internet Technologies","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123472192","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}
引用次数: 6
Enabling Linearly Homomorphic Signatures in Network Coding-based Named Data Networking 基于网络编码的命名数据网络中实现线性同态签名
Xiaoyan Hu, Shaoqi Zheng, J. Gong, Guang Cheng, Guoqiang Zhang, Ruidong Li
{"title":"Enabling Linearly Homomorphic Signatures in Network Coding-based Named Data Networking","authors":"Xiaoyan Hu, Shaoqi Zheng, J. Gong, Guang Cheng, Guoqiang Zhang, Ruidong Li","doi":"10.1145/3341188.3341191","DOIUrl":"https://doi.org/10.1145/3341188.3341191","url":null,"abstract":"Network coding has been proposed to be built into Named Data Networking (NDN) for achieving efficient simultaneous content delivery. Network coding allows intermediate nodes to perform arbitrary coding operations on Data packets. One salient feature of NDN is its content-based security by protecting each Data packet with a signature signed by its publisher. However, in the network coding-based NDN, it remains unclear how to securely and efficiently sign a recoded Data packet at an intermediate router. This work proposes a mechanism to enable linearly homomorphic signatures in network coding-based NDN so as to directly generate a signature for a recoded Data packet by combining the signatures of those Data packets on which the recoding operation is performed.","PeriodicalId":237715,"journal":{"name":"Proceedings of the 14th International Conference on Future Internet Technologies","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131172044","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}
引用次数: 3
An Improved PLC-Trie Based Routing Table Design for Variable Length IP Address Lookup 一种改进的PLC-Trie可变长度IP地址查找路由表设计
Bin-yuan Sun
{"title":"An Improved PLC-Trie Based Routing Table Design for Variable Length IP Address Lookup","authors":"Bin-yuan Sun","doi":"10.1145/3341188.3341189","DOIUrl":"https://doi.org/10.1145/3341188.3341189","url":null,"abstract":"An improved routing table lookup method based on path and level compressed tries (PLC-tries) is presented, which is designed to deal with routing tables that include variable length address prefixes. The IPswen address extension scheme is used as a specific example, which provides a variable length addressing space that consists of 8 levels of subspaces with address lengths ranging from 4 bytes to 11 bytes. By extending the trie path compression technique with an extra address length compression, the conventional PLC-trie and its lookup algorithms are adapted to handling IPswen address prefixes in a uniform and efficient manner. The design is implemented in the Linux kernel by rewriting its dynamic trie based IPv4 FIB (forwarding information base) tables, with minimal performance costs in address prefix lookup. The technique would be essential for upgrading the Linux kernel to support IPswen while retaining its full IPv4 interworking and existing sockets API applications, and be applicable for the future Internet technology development as well.","PeriodicalId":237715,"journal":{"name":"Proceedings of the 14th International Conference on Future Internet Technologies","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124445527","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}
引用次数: 3
Proceedings of the 14th International Conference on Future Internet Technologies 第十四届未来互联网技术国际会议论文集
Dongman Lee, J. Touch, S. Fdida
{"title":"Proceedings of the 14th International Conference on Future Internet Technologies","authors":"Dongman Lee, J. Touch, S. Fdida","doi":"10.1145/3341188","DOIUrl":"https://doi.org/10.1145/3341188","url":null,"abstract":"The Seventh International Conference on Future Internet Technologies (CFI'12) continues the tradition of being the forum for early work on Future Internet research. This year we received 36 submissions and accepted 13 oral and 7 poster presentations out of them. Each paper was reviewed by three members of the Technical Program Committee. As the goal of CFI '12 is to be the nurturing platform for budding research, the Technical Program Committee put much effort to return encouraging reviews and scout for promising ideas.","PeriodicalId":237715,"journal":{"name":"Proceedings of the 14th International Conference on Future Internet Technologies","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122528763","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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信