2018 30th International Teletraffic Congress (ITC 30)最新文献

筛选
英文 中文
Performance Implications of Packet Filtering with Linux eBPF Linux eBPF包过滤的性能影响
2018 30th International Teletraffic Congress (ITC 30) Pub Date : 2018-09-01 DOI: 10.1109/ITC30.2018.00039
D. Scholz, Daniel Raumer, Paul Emmerich, Alexander Kurtz, Krzysztof Lesiak, G. Carle
{"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}
引用次数: 50
Online Algorithms for Cost-Effective Cloud Selection with Multiple Demands 基于多需求的高性价比云选择在线算法
2018 30th International Teletraffic Congress (ITC 30) Pub Date : 2018-09-01 DOI: 10.1109/ITC30.2018.00014
Youngmi Jin, M. Hayashi, A. Tagami
{"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}
引用次数: 3
Statistical Delay Bounds for Automatic Repeat Request Protocols with Pipelining 带有流水线的自动重复请求协议的统计延迟界限
2018 30th International Teletraffic Congress (ITC 30) Pub Date : 2018-09-01 DOI: 10.1109/ITC30.2018.00011
M. Akselrod, M. Fidler
{"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}
引用次数: 2
Optimization of Controller Placement and Information Flow in Softwarized Networks 软件网络中控制器布局与信息流的优化
2018 30th International Teletraffic Congress (ITC 30) Pub Date : 2018-09-01 DOI: 10.1109/ITC30.2018.00026
Stanislav Lange
{"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}
引用次数: 1
NetCal 2018 Schedule NetCal 2018时间表
2018 30th International Teletraffic Congress (ITC 30) Pub Date : 2018-09-01 DOI: 10.1109/itc30.2018.10051
{"title":"NetCal 2018 Schedule","authors":"","doi":"10.1109/itc30.2018.10051","DOIUrl":"https://doi.org/10.1109/itc30.2018.10051","url":null,"abstract":"","PeriodicalId":159861,"journal":{"name":"2018 30th International Teletraffic Congress (ITC 30)","volume":"102 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":"123234368","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
[Title page i] [标题页i]
2018 30th International Teletraffic Congress (ITC 30) Pub Date : 2018-09-01 DOI: 10.1109/itc30.2018.10046
{"title":"[Title page i]","authors":"","doi":"10.1109/itc30.2018.10046","DOIUrl":"https://doi.org/10.1109/itc30.2018.10046","url":null,"abstract":"","PeriodicalId":159861,"journal":{"name":"2018 30th International Teletraffic Congress (ITC 30)","volume":"28 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":"129679124","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
Online Resource Allocation in Dynamic Optical Networks 动态光网络中的在线资源分配
2018 30th International Teletraffic Congress (ITC 30) Pub Date : 2018-09-01 DOI: 10.1109/ITC30.2018.00025
R. Reyes, T. Bauschert
{"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}
引用次数: 2
Cognitive Real-Time QoE Management in Video Streaming Services 视频流服务中的认知实时QoE管理
2018 30th International Teletraffic Congress (ITC 30) Pub Date : 2018-09-01 DOI: 10.1109/ITC30.2018.00028
M. T. Vega, A. Liotta
{"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}
引用次数: 4
WhatsAnalyzer: A Tool for Collecting and Analyzing WhatsApp Mobile Messaging Communication Data WhatsAnalyzer:收集和分析WhatsApp移动消息通信数据的工具
2018 30th International Teletraffic Congress (ITC 30) Pub Date : 2018-09-01 DOI: 10.1109/ITC30.2018.00020
Anika Schwind, Michael Seufert
{"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}
引用次数: 9
Time Constrained Service-Aware Migration of Virtualized Services for Mobile Edge Computing 移动边缘计算虚拟化服务的时间约束感知迁移
2018 30th International Teletraffic Congress (ITC 30) Pub Date : 2018-09-01 DOI: 10.1109/ITC30.2018.00017
Peiyue Zhao, G. Dán
{"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}
引用次数: 6
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书