Pub Date : 2018-09-01DOI: 10.1109/ITC30.2018.00039
D. Scholz, Daniel Raumer, Paul Emmerich, Alexander Kurtz, Krzysztof Lesiak, G. Carle
Firewall capabilities of operating systems are traditionally provided by inflexible filter routines or hooks in the kernel. These require privileged access to be configured and are not easily extensible for custom low-level actions. Since Linux 3.0, the Berkeley Packet Filter (BPF) allows user-written extensions in the kernel processing path. The successor, extended BPF (eBPF), improves flexibility and is realized via a virtual machine featuring both a just-in-time (JIT) compiler and an interpreter running in the kernel. It executes custom eBPF programs supplied by the user, effectively moving kernel functionality into user space. We present two case studies on the usage of Linux eBPF. First, we analyze the performance of the eXpress Data Path (XDP). XDP uses eBPF to process ingress traffic before the allocation of kernel data structures which comes along with performance benefits. In the second case study, eBPF is used to install application-specific packet filtering configurations acting on the socket level. Our case studies focus on performance aspects and discuss benefits and drawbacks.
操作系统的防火墙功能传统上是由内核中不灵活的过滤器例程或钩子提供的。这些需要配置特权访问，并且不容易扩展以用于自定义低级操作。从Linux 3.0开始，伯克利包过滤器(BPF)允许用户在内核处理路径中编写扩展。后继的扩展BPF (eBPF)提高了灵活性，并通过一个虚拟机实现，该虚拟机具有实时(JIT)编译器和运行在内核中的解释器。它执行用户提供的定制eBPF程序，有效地将内核功能转移到用户空间。我们介绍了两个关于Linux eBPF使用的案例研究。首先，我们分析了eXpress Data Path (XDP)的性能。在分配内核数据结构之前，XDP使用eBPF处理入口流量，这带来了性能优势。在第二个案例研究中，eBPF用于安装作用于套接字级别的特定于应用程序的包过滤配置。我们的案例研究侧重于性能方面，并讨论了优点和缺点。
{"title":"Performance Implications of Packet Filtering with Linux eBPF","authors":"D. Scholz, Daniel Raumer, Paul Emmerich, Alexander Kurtz, Krzysztof Lesiak, G. Carle","doi":"10.1109/ITC30.2018.00039","DOIUrl":"https://doi.org/10.1109/ITC30.2018.00039","url":null,"abstract":"Firewall capabilities of operating systems are traditionally provided by inflexible filter routines or hooks in the kernel. These require privileged access to be configured and are not easily extensible for custom low-level actions. Since Linux 3.0, the Berkeley Packet Filter (BPF) allows user-written extensions in the kernel processing path. The successor, extended BPF (eBPF), improves flexibility and is realized via a virtual machine featuring both a just-in-time (JIT) compiler and an interpreter running in the kernel. It executes custom eBPF programs supplied by the user, effectively moving kernel functionality into user space. We present two case studies on the usage of Linux eBPF. First, we analyze the performance of the eXpress Data Path (XDP). XDP uses eBPF to process ingress traffic before the allocation of kernel data structures which comes along with performance benefits. In the second case study, eBPF is used to install application-specific packet filtering configurations acting on the socket level. Our case studies focus on performance aspects and discuss benefits and drawbacks.","PeriodicalId":159861,"journal":{"name":"2018 30th International Teletraffic Congress (ITC 30)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126810534","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}
Pub Date : 2018-09-01DOI: 10.1109/ITC30.2018.00014
Youngmi Jin, M. Hayashi, A. Tagami
Cloud computing provides high flexibility for users by offering diverse cloud instances with various leasing periods and prices. Depending on the amount and duration of workload, a user can flexibly choose proper cloud instances to meet her demands. An intrinsic challenge facing the user is which classes of clouds and how many of them to purchase in order to meet her unpredictable demands at minimum cost. We consider an online problem deciding cost-effectively cloud classes and amount of clouds to meet dynamic multiple demands among many cloud classes when no future information of demands is available. We propose two online algorithms achieving O(M) and O(log M + log d_max) competitive ratios where M is the number of available cloud classes and d_max is the maximum demand of a given demand sequence.
云计算通过提供具有不同租期和价格的各种云实例，为用户提供了高度的灵活性。根据工作量的大小和持续时间，用户可以灵活地选择合适的云实例来满足自己的需求。用户面临的一个内在挑战是，为了以最小的成本满足其不可预测的需求，需要购买哪些类别的云，以及需要购买多少云。我们考虑一个在线问题，在没有未来需求信息的情况下，决定经济有效的云类别和云数量，以满足许多云类别之间的动态多重需求。我们提出了两种在线算法，实现O(M)和O(log M + log d_max)竞争比，其中M是可用云类的数量，d_max是给定需求序列的最大需求。
{"title":"Online Algorithms for Cost-Effective Cloud Selection with Multiple Demands","authors":"Youngmi Jin, M. Hayashi, A. Tagami","doi":"10.1109/ITC30.2018.00014","DOIUrl":"https://doi.org/10.1109/ITC30.2018.00014","url":null,"abstract":"Cloud computing provides high flexibility for users by offering diverse cloud instances with various leasing periods and prices. Depending on the amount and duration of workload, a user can flexibly choose proper cloud instances to meet her demands. An intrinsic challenge facing the user is which classes of clouds and how many of them to purchase in order to meet her unpredictable demands at minimum cost. We consider an online problem deciding cost-effectively cloud classes and amount of clouds to meet dynamic multiple demands among many cloud classes when no future information of demands is available. We propose two online algorithms achieving O(M) and O(log M + log d_max) competitive ratios where M is the number of available cloud classes and d_max is the maximum demand of a given demand sequence.","PeriodicalId":159861,"journal":{"name":"2018 30th International Teletraffic Congress (ITC 30)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126782818","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}
Pub Date : 2018-09-01DOI: 10.1109/ITC30.2018.00011
M. Akselrod, M. Fidler
The recent trend towards low-latency wireless communication requires a notion of non-ergodic capacity that deals with delays. Significant research in areas, such as effective capacity, delay-constrained capacity, and stochastic service curves, has contributed such results for relevant physical layer aspects, like fading processes, interference, and multiple antenna systems. Less attention has been paid to actual implementations of link layer automatic repeat request protocols. Instead, error-free transmission using instantaneous channel state information, simple stop-and-wait protocols, or instantaneous feedback are frequently assumed. In this work, we investigate protocols with pipelining that deal with packet errors under non-negligible round-trip-times. We define a stochastic service curve model of a general class of automatic repeat request protocols with pipelining and derive statistical waiting time and sojourn time bounds. We discover two regimes: under low to moderate load retransmissions cause the largest part of the sojourn time, whereas under high load the waiting time dominates the sojourn time. Generally, with increasing round-trip-time the basic cases of stop-and-wait protocols or instantaneous feedback neglect relevant effects and provide less accurate estimates.
{"title":"Statistical Delay Bounds for Automatic Repeat Request Protocols with Pipelining","authors":"M. Akselrod, M. Fidler","doi":"10.1109/ITC30.2018.00011","DOIUrl":"https://doi.org/10.1109/ITC30.2018.00011","url":null,"abstract":"The recent trend towards low-latency wireless communication requires a notion of non-ergodic capacity that deals with delays. Significant research in areas, such as effective capacity, delay-constrained capacity, and stochastic service curves, has contributed such results for relevant physical layer aspects, like fading processes, interference, and multiple antenna systems. Less attention has been paid to actual implementations of link layer automatic repeat request protocols. Instead, error-free transmission using instantaneous channel state information, simple stop-and-wait protocols, or instantaneous feedback are frequently assumed. In this work, we investigate protocols with pipelining that deal with packet errors under non-negligible round-trip-times. We define a stochastic service curve model of a general class of automatic repeat request protocols with pipelining and derive statistical waiting time and sojourn time bounds. We discover two regimes: under low to moderate load retransmissions cause the largest part of the sojourn time, whereas under high load the waiting time dominates the sojourn time. Generally, with increasing round-trip-time the basic cases of stop-and-wait protocols or instantaneous feedback neglect relevant effects and provide less accurate estimates.","PeriodicalId":159861,"journal":{"name":"2018 30th International Teletraffic Congress (ITC 30)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116032044","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}
Pub Date : 2018-09-01DOI: 10.1109/ITC30.2018.00026
Stanislav Lange
The Software Defined Networking (SDN) paradigm offers network operators numerous improvements in terms of flexibility, scalability, as well as cost efficiency and vendor independence. However, in order to maximize the benefit from these features, several new challenges in areas such as management and orchestration need to be addressed. The dissertation that is summarized in this paper makes contributions towards three key topics from these areas. Firstly, we design, implement, and evaluate two multi-objective heuristics for the SDN controller placement problem. Secondly, we develop and apply mechanisms for automated decision making based on the Pareto frontiers that are returned by the multi-objective optimizers. Finally, we investigate and quantify the performance benefits for the SDN control plane that can be achieved by integrating information from external entities such as Network Management Systems (NMSs) into the control loop. Our evaluation results demonstrate the impact of optimizing various parameters of softwarized networks at different levels and are used to derive guidelines for an efficient operation.
{"title":"Optimization of Controller Placement and Information Flow in Softwarized Networks","authors":"Stanislav Lange","doi":"10.1109/ITC30.2018.00026","DOIUrl":"https://doi.org/10.1109/ITC30.2018.00026","url":null,"abstract":"The Software Defined Networking (SDN) paradigm offers network operators numerous improvements in terms of flexibility, scalability, as well as cost efficiency and vendor independence. However, in order to maximize the benefit from these features, several new challenges in areas such as management and orchestration need to be addressed. The dissertation that is summarized in this paper makes contributions towards three key topics from these areas. Firstly, we design, implement, and evaluate two multi-objective heuristics for the SDN controller placement problem. Secondly, we develop and apply mechanisms for automated decision making based on the Pareto frontiers that are returned by the multi-objective optimizers. Finally, we investigate and quantify the performance benefits for the SDN control plane that can be achieved by integrating information from external entities such as Network Management Systems (NMSs) into the control loop. Our evaluation results demonstrate the impact of optimizing various parameters of softwarized networks at different levels and are used to derive guidelines for an efficient operation.","PeriodicalId":159861,"journal":{"name":"2018 30th International Teletraffic Congress (ITC 30)","volume":"296 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123120452","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}
Pub Date : 2018-09-01DOI: 10.1109/ITC30.2018.00025
R. Reyes, T. Bauschert
This paper presents a synopsis of ongoing research in the field of resource allocation in dynamic optical networks. This type of networks are envisioned to serve connections with random arrival and holding times and with fast connection setup requirements. Based on this, we model resource allocation as a mechanism that includes network control functions for routing and spectrum assignment (RSA), connection admission control (CAC) and grade of service (GoS) control. The goal is to efficiently assign spectrum resources to connections so as to attain optimum performance. For that, the network is modelled as a stochastic loss system subject to spectrum continuity and contiguity constraints. The theory of Markov decision processes (MDP) is then applied to formulate an algorithm that performs fast, adaptive and state-dependent RSA, CAC and GoS control. The proposed algorithm can easily be integrated with existing protocols for fast connection setup. Moreover, we discuss the cost efficiency of selected network implementations which are based on basic, colorless and colorless and directionless optical nodes.
{"title":"Online Resource Allocation in Dynamic Optical Networks","authors":"R. Reyes, T. Bauschert","doi":"10.1109/ITC30.2018.00025","DOIUrl":"https://doi.org/10.1109/ITC30.2018.00025","url":null,"abstract":"This paper presents a synopsis of ongoing research in the field of resource allocation in dynamic optical networks. This type of networks are envisioned to serve connections with random arrival and holding times and with fast connection setup requirements. Based on this, we model resource allocation as a mechanism that includes network control functions for routing and spectrum assignment (RSA), connection admission control (CAC) and grade of service (GoS) control. The goal is to efficiently assign spectrum resources to connections so as to attain optimum performance. For that, the network is modelled as a stochastic loss system subject to spectrum continuity and contiguity constraints. The theory of Markov decision processes (MDP) is then applied to formulate an algorithm that performs fast, adaptive and state-dependent RSA, CAC and GoS control. The proposed algorithm can easily be integrated with existing protocols for fast connection setup. Moreover, we discuss the cost efficiency of selected network implementations which are based on basic, colorless and colorless and directionless optical nodes.","PeriodicalId":159861,"journal":{"name":"2018 30th International Teletraffic Congress (ITC 30)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127678504","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}
Pub Date : 2018-09-01DOI: 10.1109/ITC30.2018.00028
M. T. Vega, A. Liotta
Satisfying the needs of users of online video streaming services requires not only to manage the network Quality of Service (QoS), but also to address the user's Quality of Experience (QoE) expectations. While QoS factors reflect the status of individual networks, they do not comprehensively capture the end-to-end features affecting the quality delivered to the user. In this situation, QoE management is the better option. However, traditionally used QoE management models require human interaction and have stringent requirements in terms of time and complexity. Thus, they fail to achieve successful performance in terms of real-timeliness, accuracy, scalability and adaptability. This dissertation work investigates new methods to bring QoE management to the level required by the real-time management of video services. In this paper, we highlight our main contributions. First, with the aim to perform a combined network-service assessment, we designed an experimental methodology able to map network QoS onto service QoE. Our methodology is meant to provide service and network providers with the means to pinpoint the working boundaries of their video-sets and to predict the effect of network policies on perception. Second, we developed a generic machine learning framework that allows deriving accurate predictive No Reference (NR) assessment metrics, based on simplistic NR QoE methods, that are functionally and computationally viable for real-time QoE evaluation. The tools, methods and conclusions derived from this dissertation conform a solid contribution to QoE management of video streaming services, opening new venues for further research.
{"title":"Cognitive Real-Time QoE Management in Video Streaming Services","authors":"M. T. Vega, A. Liotta","doi":"10.1109/ITC30.2018.00028","DOIUrl":"https://doi.org/10.1109/ITC30.2018.00028","url":null,"abstract":"Satisfying the needs of users of online video streaming services requires not only to manage the network Quality of Service (QoS), but also to address the user's Quality of Experience (QoE) expectations. While QoS factors reflect the status of individual networks, they do not comprehensively capture the end-to-end features affecting the quality delivered to the user. In this situation, QoE management is the better option. However, traditionally used QoE management models require human interaction and have stringent requirements in terms of time and complexity. Thus, they fail to achieve successful performance in terms of real-timeliness, accuracy, scalability and adaptability. This dissertation work investigates new methods to bring QoE management to the level required by the real-time management of video services. In this paper, we highlight our main contributions. First, with the aim to perform a combined network-service assessment, we designed an experimental methodology able to map network QoS onto service QoE. Our methodology is meant to provide service and network providers with the means to pinpoint the working boundaries of their video-sets and to predict the effect of network policies on perception. Second, we developed a generic machine learning framework that allows deriving accurate predictive No Reference (NR) assessment metrics, based on simplistic NR QoE methods, that are functionally and computationally viable for real-time QoE evaluation. The tools, methods and conclusions derived from this dissertation conform a solid contribution to QoE management of video streaming services, opening new venues for further research.","PeriodicalId":159861,"journal":{"name":"2018 30th International Teletraffic Congress (ITC 30)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126015592","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}
Pub Date : 2018-09-01DOI: 10.1109/ITC30.2018.00020
Anika Schwind, Michael Seufert
WhatsAnalyzer is a web-based service, which collects and analyzes chat histories of the mobile messaging application WhatsApp. Thereby, it leverages the e-mail export feature of WhatsApp to obtain the chat histories, which cannot be accessed otherwise due to encrypted storage on the mobile device and end-to-end encrypted transmission over the Internet. Thus, the major asset of the service is that real communication data can be collected without the bias introduced by observing or surveying participants. The collected communication data can be analyzed and provides valuable insights into the communication in WhatsApp and the resulting network traffic. To incentivize users to send chat histories, the privacy of users is respected by anonymizing all communication data. Moreover, some analyses of each chat history can be accessed on a web page by the sender of the chats.
{"title":"WhatsAnalyzer: A Tool for Collecting and Analyzing WhatsApp Mobile Messaging Communication Data","authors":"Anika Schwind, Michael Seufert","doi":"10.1109/ITC30.2018.00020","DOIUrl":"https://doi.org/10.1109/ITC30.2018.00020","url":null,"abstract":"WhatsAnalyzer is a web-based service, which collects and analyzes chat histories of the mobile messaging application WhatsApp. Thereby, it leverages the e-mail export feature of WhatsApp to obtain the chat histories, which cannot be accessed otherwise due to encrypted storage on the mobile device and end-to-end encrypted transmission over the Internet. Thus, the major asset of the service is that real communication data can be collected without the bias introduced by observing or surveying participants. The collected communication data can be analyzed and provides valuable insights into the communication in WhatsApp and the resulting network traffic. To incentivize users to send chat histories, the privacy of users is respected by anonymizing all communication data. Moreover, some analyses of each chat history can be accessed on a web page by the sender of the chats.","PeriodicalId":159861,"journal":{"name":"2018 30th International Teletraffic Congress (ITC 30)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127118535","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}
Pub Date : 2018-09-01DOI: 10.1109/ITC30.2018.00017
Peiyue Zhao, G. Dán
We consider the migration of virtualized services (VSs) in Mobile Edge Computing (MEC), so as to facilitate server maintenance, load balancing under mobility, improved energy efficiency and resource utilization, and incident response. We consider a set of VSs that has to be migrated from a source placement to a target placement, while maintaining service continuity as much as possible. We formulate the VS migration problem as an integer programming problem, and analyze its complexity. We propose an efficient iterative algorithm for computing when and in what order the VSs shall be migrated among the MEC nodes. We evaluate the proposed solution in terms of total service value, efficiency, and scalability. Extensive simulations show that our algorithm is computationally effective, and performs close to optimal.
{"title":"Time Constrained Service-Aware Migration of Virtualized Services for Mobile Edge Computing","authors":"Peiyue Zhao, G. Dán","doi":"10.1109/ITC30.2018.00017","DOIUrl":"https://doi.org/10.1109/ITC30.2018.00017","url":null,"abstract":"We consider the migration of virtualized services (VSs) in Mobile Edge Computing (MEC), so as to facilitate server maintenance, load balancing under mobility, improved energy efficiency and resource utilization, and incident response. We consider a set of VSs that has to be migrated from a source placement to a target placement, while maintaining service continuity as much as possible. We formulate the VS migration problem as an integer programming problem, and analyze its complexity. We propose an efficient iterative algorithm for computing when and in what order the VSs shall be migrated among the MEC nodes. We evaluate the proposed solution in terms of total service value, efficiency, and scalability. Extensive simulations show that our algorithm is computationally effective, and performs close to optimal.","PeriodicalId":159861,"journal":{"name":"2018 30th International Teletraffic Congress (ITC 30)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116035405","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
扫码关注我们
求助内容：
应助结果提醒方式：