For every HTTP/1.1 request and response, almost the same set of headers is transferred. This wastes bandwidth, the most expensive resource of the browser-server communication. To solve this issue, header compression for HTTP/2 was standardized. During the standardization, we found that one element of the compression technology, the so called reference set, contributes little to the compression ratio while its mechanism is complicated. With our proposal, the reference set was removed and the specification and implementations were drastically simplified. For high performance implementation of header compression, we devised token-based reverse indices, length guessing for Huffman encoding, and pre-calculated state transitions for Huffman decoding.
{"title":"Exploring HTTP/2 Header Compression","authors":"Kazuhiko Yamamoto, T. Tsujikawa, Kazuho Oku","doi":"10.1145/3095786.3095787","DOIUrl":"https://doi.org/10.1145/3095786.3095787","url":null,"abstract":"For every HTTP/1.1 request and response, almost the same set of headers is transferred. This wastes bandwidth, the most expensive resource of the browser-server communication. To solve this issue, header compression for HTTP/2 was standardized. During the standardization, we found that one element of the compression technology, the so called reference set, contributes little to the compression ratio while its mechanism is complicated. With our proposal, the reference set was removed and the specification and implementations were drastically simplified. For high performance implementation of header compression, we devised token-based reverse indices, length guessing for Huffman encoding, and pre-calculated state transitions for Huffman decoding.","PeriodicalId":209819,"journal":{"name":"Proceedings of the 12th International Conference on Future Internet Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121331646","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}
Hiroshi Abe, K. Shima, Y. Sekiya, Daisuke Miyamoto, Tomohiro Ishihara, Kazuya Okada
In this study, we introduce a simple and high-speed search engine for large-scale system logs, called Hayabusa. Hayabusa uses SQLite, standard lightweight database software with GNU Parallel and general Linux commands, such that it can run efficiently without complex components. Network administrators can use Hayabusa to accumulate and store log information at high speeds and to search the logs quickly. In our experiments, Hayabusa required only 8 seconds to convert 1.2 M log messages into a database file. Moreover, Hayabusa required only 5 seconds to search a keyword from 1.7 billion records. Hayabusa achieved high-performance search speed in a stand-alone environment without a complex distributed environment. Compared with the distributed environment, Spark, the proposed stand-alone Hayabusa was approximately 27 times faster.
{"title":"Hayabusa: Simple and Fast Full-Text Search Engine for Massive System Log Data","authors":"Hiroshi Abe, K. Shima, Y. Sekiya, Daisuke Miyamoto, Tomohiro Ishihara, Kazuya Okada","doi":"10.1145/3095786.3095788","DOIUrl":"https://doi.org/10.1145/3095786.3095788","url":null,"abstract":"In this study, we introduce a simple and high-speed search engine for large-scale system logs, called Hayabusa. Hayabusa uses SQLite, standard lightweight database software with GNU Parallel and general Linux commands, such that it can run efficiently without complex components. Network administrators can use Hayabusa to accumulate and store log information at high speeds and to search the logs quickly. In our experiments, Hayabusa required only 8 seconds to convert 1.2 M log messages into a database file. Moreover, Hayabusa required only 5 seconds to search a keyword from 1.7 billion records. Hayabusa achieved high-performance search speed in a stand-alone environment without a complex distributed environment. Compared with the distributed environment, Spark, the proposed stand-alone Hayabusa was approximately 27 times faster.","PeriodicalId":209819,"journal":{"name":"Proceedings of the 12th International Conference on Future Internet Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133607066","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}
Currently, the Internet of Things (IoT) is in the center of attention as an emerging technology among researchers and stakeholders. It is assumed that it is a key enabler for other technologies such as smart cities, smart health, smart grids, and smart transportation. Although the concept of the IoT is generally understood among researchers, there is no standard model representing this technology, particularly with respect to network architecture, which will be necessary to apply existing and emerging resilience and survivability techniques. Additionally, security and privacy have not yet received the needed attention. In this paper we propose a new multilevel IoT network-centric model, and discuss its applicability to the application of resilience and survivability.
物联网(Internet of Things, IoT)作为一项新兴技术，目前已成为研究人员和利益相关者关注的焦点。它被认为是智能城市、智能健康、智能电网和智能交通等其他技术的关键推动者。尽管研究人员普遍理解物联网的概念，但没有代表该技术的标准模型，特别是在网络架构方面，这对于应用现有和新兴的弹性和生存性技术是必要的。此外，安全和隐私还没有得到应有的重视。本文提出了一种新的多层次物联网网络中心模型，并讨论了其在弹性和生存性应用中的适用性。
{"title":"Multilevel IoT Model for Smart Cities Resilience","authors":"A. Modarresi, J. Sterbenz","doi":"10.1145/3095786.3095793","DOIUrl":"https://doi.org/10.1145/3095786.3095793","url":null,"abstract":"Currently, the Internet of Things (IoT) is in the center of attention as an emerging technology among researchers and stakeholders. It is assumed that it is a key enabler for other technologies such as smart cities, smart health, smart grids, and smart transportation. Although the concept of the IoT is generally understood among researchers, there is no standard model representing this technology, particularly with respect to network architecture, which will be necessary to apply existing and emerging resilience and survivability techniques. Additionally, security and privacy have not yet received the needed attention. In this paper we propose a new multilevel IoT network-centric model, and discuss its applicability to the application of resilience and survivability.","PeriodicalId":209819,"journal":{"name":"Proceedings of the 12th International Conference on Future Internet Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123014086","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}
OpenFlow provides a statistics collection scheme for per-flow and aggregate metrics at a user-specified frequency. However, periodic polling for flow statistics cannot well balance the tradeoff between measurement accuracy and limited control channel bandwidth. To further discuss the resource/accuracy tradeoff, this paper extends OpenFlow protocol to add sampling action for each monitoring flow entry, and systematically sample the matching packets to infer the flow-level statistics. Although traffic sampling can somehow be error-prone, it will provide near-real-time measurements of flow dynamics and determine its accurate polling frequency, which the polling-based approach cannot achieve. In this paper, we propose a per-flow sampling solution to instruct the controller to adaptively adjust polling frequency, then evaluate it in the context of link utilization monitoring.
{"title":"Adaptive Sampling for OpenFlow Network Measurement Methods","authors":"Guang Cheng, Jun-Jae Yu","doi":"10.1145/3095786.3095790","DOIUrl":"https://doi.org/10.1145/3095786.3095790","url":null,"abstract":"OpenFlow provides a statistics collection scheme for per-flow and aggregate metrics at a user-specified frequency. However, periodic polling for flow statistics cannot well balance the tradeoff between measurement accuracy and limited control channel bandwidth. To further discuss the resource/accuracy tradeoff, this paper extends OpenFlow protocol to add sampling action for each monitoring flow entry, and systematically sample the matching packets to infer the flow-level statistics. Although traffic sampling can somehow be error-prone, it will provide near-real-time measurements of flow dynamics and determine its accurate polling frequency, which the polling-based approach cannot achieve. In this paper, we propose a per-flow sampling solution to instruct the controller to adaptively adjust polling frequency, then evaluate it in the context of link utilization monitoring.","PeriodicalId":209819,"journal":{"name":"Proceedings of the 12th International Conference on Future Internet Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127953775","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}
Latency in a network is an important parameter that can be utilized by a variety of applications which required QoS policies. Recently, methods for monitoring latency have been introduced. Most of these methods monitor end-to-end path delay (per path) by sending probes requests along the path. These methods led to redundant work and network overhead, which resulting from monitoring multiple paths between each pair of nodes. Moreover, end-to-end probes cannot monitor the delay on path segments (per link) between arbitrary network devices. However, measuring per link delay is challenging. In this paper, we propose a method to measure per link delay in real-time to efficiently apply QoS policies, our method does not require any complementary support from the switching hardware and can avoid redundant work and network overhead. We validate our method using the popular Mininet network emulation environment with Pox controller.
{"title":"Latency Monitoring in Software-Defined Networks","authors":"Alaa M. Allakany, K. Okamura","doi":"10.1145/3095786.3095791","DOIUrl":"https://doi.org/10.1145/3095786.3095791","url":null,"abstract":"Latency in a network is an important parameter that can be utilized by a variety of applications which required QoS policies. Recently, methods for monitoring latency have been introduced. Most of these methods monitor end-to-end path delay (per path) by sending probes requests along the path. These methods led to redundant work and network overhead, which resulting from monitoring multiple paths between each pair of nodes. Moreover, end-to-end probes cannot monitor the delay on path segments (per link) between arbitrary network devices. However, measuring per link delay is challenging. In this paper, we propose a method to measure per link delay in real-time to efficiently apply QoS policies, our method does not require any complementary support from the switching hardware and can avoid redundant work and network overhead. We validate our method using the popular Mininet network emulation environment with Pox controller.","PeriodicalId":209819,"journal":{"name":"Proceedings of the 12th International Conference on Future Internet Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128029551","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}
With a growth in the popularity of ICT and Cloud technologies, the adoption of SaaS (Software as a Service) model is rapidly increasing. However, SaaS developers are still struggling with heterogeneities and inter-dependencies of their development and operation environments. In order to mitigate selected SaaS compatibility issues for heterogeneous underlying cloud infrastructures, we present a new approach, denoted as SaaS OverCloud, by enabling a specially-arranged razor-thin overlay layer and leveraging container-based on micro-services architecture. We then verify the conceptual feasibility of SaaS OverCloud model by enabling simplified 3-tier SaaS services over small-size cloud-based boxes.
{"title":"Design of SaaS OverCloud for 3-tier SaaS Compatibility over Cloud-based Multiple Boxes","authors":"Jungsu Han, JongWon Kim","doi":"10.1145/3095786.3095792","DOIUrl":"https://doi.org/10.1145/3095786.3095792","url":null,"abstract":"With a growth in the popularity of ICT and Cloud technologies, the adoption of SaaS (Software as a Service) model is rapidly increasing. However, SaaS developers are still struggling with heterogeneities and inter-dependencies of their development and operation environments. In order to mitigate selected SaaS compatibility issues for heterogeneous underlying cloud infrastructures, we present a new approach, denoted as SaaS OverCloud, by enabling a specially-arranged razor-thin overlay layer and leveraging container-based on micro-services architecture. We then verify the conceptual feasibility of SaaS OverCloud model by enabling simplified 3-tier SaaS services over small-size cloud-based boxes.","PeriodicalId":209819,"journal":{"name":"Proceedings of the 12th International Conference on Future Internet Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125671369","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}
Modeling the routing table growth is vital to the BGP operation. The temporal evolution of the routing table size has been researched to anticipate the memory limitation of BGP routers. However, route aggregation and compression techniques make it difficult to expect the actual memory size from the routing table size. Therefore, further evolution models focusing on the spatial routing table structure are required to evaluate the tolerance of these techniques to future routing table growth. In this paper, we create an evolution model focusing on spatio-temporal route changes using ten-year BGP routing table datasets. We categorize route variations into three types; new, fragmented, and vanished and then create a model for each type. We also demonstrate the characteristics of the model parameters in these ten years.
{"title":"Spatio-Temporal Modeling of BGP Routing Table Evolution","authors":"M. Utsumi, H. Asai, H. Esaki","doi":"10.1145/3095786.3095794","DOIUrl":"https://doi.org/10.1145/3095786.3095794","url":null,"abstract":"Modeling the routing table growth is vital to the BGP operation. The temporal evolution of the routing table size has been researched to anticipate the memory limitation of BGP routers. However, route aggregation and compression techniques make it difficult to expect the actual memory size from the routing table size. Therefore, further evolution models focusing on the spatial routing table structure are required to evaluate the tolerance of these techniques to future routing table growth. In this paper, we create an evolution model focusing on spatio-temporal route changes using ten-year BGP routing table datasets. We categorize route variations into three types; new, fragmented, and vanished and then create a model for each type. We also demonstrate the characteristics of the model parameters in these ten years.","PeriodicalId":209819,"journal":{"name":"Proceedings of the 12th International Conference on Future Internet Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121561612","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}
Boram Jin, Seyoung Yun, Daewoo Kim, Jinwoo Shin, Yung Yi, Seongik Hong, Byoung-joon Lee
The Internet is becoming more and more content-oriented. CDN (Content Distribution Networks) has been a popular architecture compatible with the current Internet, and a new revolutionary paradigm such as ICN (Information Centric Networking) has studied. One of the main components in both CDN and ICN is considering cache on network. Despite a surge of extensive use of cache in the current and future Internet architectures, analysis on the performance of general cache networks are still quite limited due to complex inter-plays among various components and thus analytical intractability. Due to mathematical tractability, we consider 'static' cache policies and study asymptotic delay performance of those policies in cache networks, in particular, focusing on the impact of heterogeneous content popularities and nodes' geographical 'importances' in caching policies. Furthermore, our simulation results suggest that they perform quite similarly as popular 'dynamic' policies such as LFU (Least-Frequently-Used) and LRU (Least-Recently-Used). We believe that our theoretical findings provide useful engineering implications such as when and how various factors have impact on caching performance.
互联网正变得越来越以内容为导向。CDN (Content Distribution Networks，内容分发网络)已经成为一种与当前Internet兼容的流行架构，并且已经研究了一种新的革命性范例，例如ICN (Information Centric Networking，信息中心网络)。CDN和ICN的主要组成部分之一是考虑网络缓存。尽管在当前和未来的互联网架构中大量使用缓存，但由于各种组件之间复杂的相互作用和分析的复杂性，对一般缓存网络性能的分析仍然相当有限。由于数学上的可追溯性，我们考虑了“静态”缓存策略，并研究了这些策略在缓存网络中的渐近延迟性能，特别是关注异构内容流行度和节点在缓存策略中的地理“重要性”的影响。此外，我们的模拟结果表明，它们的执行与流行的“动态”策略(如LFU(最少使用)和LRU(最近最少使用))非常相似。我们相信我们的理论发现提供了有用的工程启示，例如各种因素何时以及如何影响缓存性能。
{"title":"On the Delay Scaling Laws of Cache Networks","authors":"Boram Jin, Seyoung Yun, Daewoo Kim, Jinwoo Shin, Yung Yi, Seongik Hong, Byoung-joon Lee","doi":"10.1145/3095786.3095789","DOIUrl":"https://doi.org/10.1145/3095786.3095789","url":null,"abstract":"The Internet is becoming more and more content-oriented. CDN (Content Distribution Networks) has been a popular architecture compatible with the current Internet, and a new revolutionary paradigm such as ICN (Information Centric Networking) has studied. One of the main components in both CDN and ICN is considering cache on network. Despite a surge of extensive use of cache in the current and future Internet architectures, analysis on the performance of general cache networks are still quite limited due to complex inter-plays among various components and thus analytical intractability. Due to mathematical tractability, we consider 'static' cache policies and study asymptotic delay performance of those policies in cache networks, in particular, focusing on the impact of heterogeneous content popularities and nodes' geographical 'importances' in caching policies. Furthermore, our simulation results suggest that they perform quite similarly as popular 'dynamic' policies such as LFU (Least-Frequently-Used) and LRU (Least-Recently-Used). We believe that our theoretical findings provide useful engineering implications such as when and how various factors have impact on caching performance.","PeriodicalId":209819,"journal":{"name":"Proceedings of the 12th International Conference on Future Internet Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122878560","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
扫码关注我们
求助内容：
应助结果提醒方式：