Welcome to IEEE/ACM IWQoS 2018 in Banff! IWQoS is a well-established symposium that is co-sponsored by IEEE, IEEE Communications Society, and ACM. Since 1993, IWQoS has established itself as a leading forum to present novel ideas on all aspects of Quality of Service (QoS) in network-based communication systems. We are delighted to host this year's event in Canada, and are glad that you could join us!
{"title":"Welcome from General Chair","authors":"Vasco Furtado","doi":"10.1109/pdcat.2007.3","DOIUrl":"https://doi.org/10.1109/pdcat.2007.3","url":null,"abstract":"Welcome to IEEE/ACM IWQoS 2018 in Banff! IWQoS is a well-established symposium that is co-sponsored by IEEE, IEEE Communications Society, and ACM. Since 1993, IWQoS has established itself as a leading forum to present novel ideas on all aspects of Quality of Service (QoS) in network-based communication systems. We are delighted to host this year's event in Canada, and are glad that you could join us!","PeriodicalId":222290,"journal":{"name":"2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131203927","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-12-01DOI: 10.1109/icosst.2018.8632177
Hans Gelderblom
Back
回来
{"title":"Back","authors":"Hans Gelderblom","doi":"10.1109/icosst.2018.8632177","DOIUrl":"https://doi.org/10.1109/icosst.2018.8632177","url":null,"abstract":"Back","PeriodicalId":222290,"journal":{"name":"2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123935102","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-06-04DOI: 10.1109/IWQoS.2018.8624137
Chenfei Gao, Vahid Rajabian-Schwart, Weiyi Zhang, G. Xue, Jian Tang
Traditional Internet routing is simple, scalable and robust, but cannot provide perfect QoS support due to the current completely distributed hop-by-hop routing architecture. Software defined networking (SDN) opens up the door to traffic engineering innovation and makes possible QoS routing with a broader picture of overall network resources. We further argue that SDN can provide more opportunity for the network users to make their own routing selections with network programmability. In this paper, we propose OpenMCR, a general framework for network users to make their own choice of routing given various requirements. OpenMCR provides routing subject to several additive QoS constraints, which is NP-hard when the number of constraints is two or more. By composing various necessary conditions with different path extension schemes, our platform can customize routing solutions for each network user based on their own requirements. Through experiments in an SDN emulated environment, we evaluate multiple aspects of OpenMCR, demonstrate its effectiveness compared with several baselines and validate our theoretical analysis.
{"title":"How Would you Like Your Packets Delivered? An SDN-Enabled Open Platform for QoS Routing","authors":"Chenfei Gao, Vahid Rajabian-Schwart, Weiyi Zhang, G. Xue, Jian Tang","doi":"10.1109/IWQoS.2018.8624137","DOIUrl":"https://doi.org/10.1109/IWQoS.2018.8624137","url":null,"abstract":"Traditional Internet routing is simple, scalable and robust, but cannot provide perfect QoS support due to the current completely distributed hop-by-hop routing architecture. Software defined networking (SDN) opens up the door to traffic engineering innovation and makes possible QoS routing with a broader picture of overall network resources. We further argue that SDN can provide more opportunity for the network users to make their own routing selections with network programmability. In this paper, we propose OpenMCR, a general framework for network users to make their own choice of routing given various requirements. OpenMCR provides routing subject to several additive QoS constraints, which is NP-hard when the number of constraints is two or more. By composing various necessary conditions with different path extension schemes, our platform can customize routing solutions for each network user based on their own requirements. Through experiments in an SDN emulated environment, we evaluate multiple aspects of OpenMCR, demonstrate its effectiveness compared with several baselines and validate our theoretical analysis.","PeriodicalId":222290,"journal":{"name":"2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125603409","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-06-04DOI: 10.1109/IWQoS.2018.8624128
Rui Li, Xi Xiao, S. Ni, Haitao Zheng, Shutao Xia
Network traffic classification, which can map network traffic to protocols in the application layer, is a fundamental technique for network management and security issues such as Quality of Service, network measurement, and network monitoring. Recent researchers focus on extracting features for traditional machine learning methods from flows or datagrams of the specific protocol. However, as the rapid growth of network applications, previous works cannot handle complex novel protocols well. In this paper, we introduce the recurrent neural network to network traffic classification and design a novel neural network, the Byte Segment Neural Network (BSNN). BSNN treats network datagrams as input and gives the classification results directly. In BSNN, a datagram is firstly broken into serval byte segments. Then, these segments are fed to encoders which are based on the recurrent neural network. The information extracted by encoders is combined to a representation vector of the whole datagram. Finally, we apply the softmax function to use this vector for predicting the application protocol of this datagram. There are several key advantages of BSNN: 1) no need for prior knowledge of target applications; 2) can handle both connection-oriented protocols and connection-less protocols; 3) supports multi-classification for protocols; 4) shows outstanding accuracy in both traditional protocols and complex novel protocols. Our thorough experiments on real-world data with different protocols indicate that BSNN gains average F1-measure about 95.82% in multi-classification for five protocols including QQ, PPLive, DNS, 360 and BitTorrent. And it also shows excellent performance for detection of novel protocols. Furthermore, compared with two recent state-of-the-art works, BSNN has superiority over the traditional machine learning-based method and the packet inspection method.
{"title":"Byte Segment Neural Network for Network Traffic Classification","authors":"Rui Li, Xi Xiao, S. Ni, Haitao Zheng, Shutao Xia","doi":"10.1109/IWQoS.2018.8624128","DOIUrl":"https://doi.org/10.1109/IWQoS.2018.8624128","url":null,"abstract":"Network traffic classification, which can map network traffic to protocols in the application layer, is a fundamental technique for network management and security issues such as Quality of Service, network measurement, and network monitoring. Recent researchers focus on extracting features for traditional machine learning methods from flows or datagrams of the specific protocol. However, as the rapid growth of network applications, previous works cannot handle complex novel protocols well. In this paper, we introduce the recurrent neural network to network traffic classification and design a novel neural network, the Byte Segment Neural Network (BSNN). BSNN treats network datagrams as input and gives the classification results directly. In BSNN, a datagram is firstly broken into serval byte segments. Then, these segments are fed to encoders which are based on the recurrent neural network. The information extracted by encoders is combined to a representation vector of the whole datagram. Finally, we apply the softmax function to use this vector for predicting the application protocol of this datagram. There are several key advantages of BSNN: 1) no need for prior knowledge of target applications; 2) can handle both connection-oriented protocols and connection-less protocols; 3) supports multi-classification for protocols; 4) shows outstanding accuracy in both traditional protocols and complex novel protocols. Our thorough experiments on real-world data with different protocols indicate that BSNN gains average F1-measure about 95.82% in multi-classification for five protocols including QQ, PPLive, DNS, 360 and BitTorrent. And it also shows excellent performance for detection of novel protocols. Furthermore, compared with two recent state-of-the-art works, BSNN has superiority over the traditional machine learning-based method and the packet inspection method.","PeriodicalId":222290,"journal":{"name":"2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125802968","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-06-01DOI: 10.1109/iwqos.2018.8624173
2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS)
2018 IEEE/ACM第26届国际服务质量研讨会(IWQoS)
{"title":"2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS)","authors":"","doi":"10.1109/iwqos.2018.8624173","DOIUrl":"https://doi.org/10.1109/iwqos.2018.8624173","url":null,"abstract":"2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS)","PeriodicalId":222290,"journal":{"name":"2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122415128","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-06-01DOI: 10.1109/IWQoS.2018.8624160
Ruiting Zhou, Jianqun Cui
This work studies the emerging C-RAN market in a 5G wireless network where mobile operators lease computation and communication resources from the tower company to serve wireless users. We propose an online C-RAN auction where each mobile operator bids for three types of resources in a future time window: wireless spectrum at base stations (BSs), front-haul link capacities, and mobile BS instances at the mobile cloud. We target an online C-RAN auction that executes in polynomial time, elicits truthful bids from mobile operators, and maximizes the social welfare of the C-RAN eco-system with both spectrum cost at BSs and server cost at the mobile cloud considered. We show how the marriage of (i) a new Fenchel dual approach to convex optimization with (ii) the posted pricing framework for online auction design can help achieve the three goals simultaneously, and evaluate the efficiency of our online C-RAN auction through both theoretical analysis and empirical studies.
{"title":"An Efficient Online Market Mechanism for Resource Leasing in Cloud Radio Access Networks","authors":"Ruiting Zhou, Jianqun Cui","doi":"10.1109/IWQoS.2018.8624160","DOIUrl":"https://doi.org/10.1109/IWQoS.2018.8624160","url":null,"abstract":"This work studies the emerging C-RAN market in a 5G wireless network where mobile operators lease computation and communication resources from the tower company to serve wireless users. We propose an online C-RAN auction where each mobile operator bids for three types of resources in a future time window: wireless spectrum at base stations (BSs), front-haul link capacities, and mobile BS instances at the mobile cloud. We target an online C-RAN auction that executes in polynomial time, elicits truthful bids from mobile operators, and maximizes the social welfare of the C-RAN eco-system with both spectrum cost at BSs and server cost at the mobile cloud considered. We show how the marriage of (i) a new Fenchel dual approach to convex optimization with (ii) the posted pricing framework for online auction design can help achieve the three goals simultaneously, and evaluate the efficiency of our online C-RAN auction through both theoretical analysis and empirical studies.","PeriodicalId":222290,"journal":{"name":"2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114426784","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-06-01DOI: 10.1109/IWQoS.2018.8624154
Joydeep Mukherjee, Diwakar Krishnamurthy
Network services, e.g., video streaming services, are increasingly being deployed on public cloud platforms. Such services often employ horizontal scaling where a group of resource instances, e.g., virtual machines (VMs), handle the incoming workload. The response time of such services is often affected by interference, i.e., contention among resource instances belonging to multiple cloud subscribers for shared cloud resources. Most commercial cloud platforms do not support built-in mechanisms to detect interference and mitigate its impact. This paper outlines a solution called PRIMA that subscribers of such platforms, i.e., network service operators, can deploy to ensure a specified end user response time target is met even in the face of fluctuations in workload and interference. PRIMA uses automated and controlled performance tests to build models that capture the joint impact of workload and interference on the response time of each resource instance employed by a service. PRIMA adapts the system to changing workload and interference conditions by using these models at runtime to control the number of instances in the system and the distribution of load among these instances. Unlike existing subscriber-oriented interference mitigation techniques in literature, PRIMA provides an explicit mechanism to guarantee that the specified response time threshold is met at every resource instance assigned to a service. Furthermore, in contrast to these approaches PRIMA can help an operator avoid using more instances than necessary for handling the observed workload and interference.
{"title":"Subscriber-Driven Cloud Interference Mitigation for Network Services","authors":"Joydeep Mukherjee, Diwakar Krishnamurthy","doi":"10.1109/IWQoS.2018.8624154","DOIUrl":"https://doi.org/10.1109/IWQoS.2018.8624154","url":null,"abstract":"Network services, e.g., video streaming services, are increasingly being deployed on public cloud platforms. Such services often employ horizontal scaling where a group of resource instances, e.g., virtual machines (VMs), handle the incoming workload. The response time of such services is often affected by interference, i.e., contention among resource instances belonging to multiple cloud subscribers for shared cloud resources. Most commercial cloud platforms do not support built-in mechanisms to detect interference and mitigate its impact. This paper outlines a solution called PRIMA that subscribers of such platforms, i.e., network service operators, can deploy to ensure a specified end user response time target is met even in the face of fluctuations in workload and interference. PRIMA uses automated and controlled performance tests to build models that capture the joint impact of workload and interference on the response time of each resource instance employed by a service. PRIMA adapts the system to changing workload and interference conditions by using these models at runtime to control the number of instances in the system and the distribution of load among these instances. Unlike existing subscriber-oriented interference mitigation techniques in literature, PRIMA provides an explicit mechanism to guarantee that the specified response time threshold is met at every resource instance assigned to a service. Furthermore, in contrast to these approaches PRIMA can help an operator avoid using more instances than necessary for handling the observed workload and interference.","PeriodicalId":222290,"journal":{"name":"2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128227543","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-06-01DOI: 10.1109/IWQoS.2018.8624127
Yugo Nakamura, Teruhiro Mizumoto, H. Suwa, Yutaka Arakawa, H. Yamaguchi, K. Yasumoto
In an era where billions of IoT devices are deployed, edge/fog computing paradigms are attracting attention for their ability to reduce processing delays and mitigate waste of communication resources. However, since the computing system assumed by edge/fog paradigms have heterogeneity (in terms of the computing power of devices, network performance between devices, device density, etc.), provisioning computational resources according to computational demand becomes a challenging constrained optimization problem. In this paper, we propose in-situ resource provisioning method consisting of insitu resource area selection with adaptive scale out and in-situ task scheduling based on tabu search algorithm. We conducted a simulation study in a target regional area where 2,000 IoT devices and 10 IoT services are deployed to evaluate the effectiveness of the proposed algorithm. The simulation results show that our proposed algorithm can obtain higher user QoS compared to conventional resource provisioning algorithms.
{"title":"Design and Evaluation of In-Situ Resource Provisioning Method for Regional IoT Services","authors":"Yugo Nakamura, Teruhiro Mizumoto, H. Suwa, Yutaka Arakawa, H. Yamaguchi, K. Yasumoto","doi":"10.1109/IWQoS.2018.8624127","DOIUrl":"https://doi.org/10.1109/IWQoS.2018.8624127","url":null,"abstract":"In an era where billions of IoT devices are deployed, edge/fog computing paradigms are attracting attention for their ability to reduce processing delays and mitigate waste of communication resources. However, since the computing system assumed by edge/fog paradigms have heterogeneity (in terms of the computing power of devices, network performance between devices, device density, etc.), provisioning computational resources according to computational demand becomes a challenging constrained optimization problem. In this paper, we propose in-situ resource provisioning method consisting of insitu resource area selection with adaptive scale out and in-situ task scheduling based on tabu search algorithm. We conducted a simulation study in a target regional area where 2,000 IoT devices and 10 IoT services are deployed to evaluate the effectiveness of the proposed algorithm. The simulation results show that our proposed algorithm can obtain higher user QoS compared to conventional resource provisioning algorithms.","PeriodicalId":222290,"journal":{"name":"2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125703164","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-06-01DOI: 10.1109/IWQoS.2018.8624140
Ruiting Zhou
Network Function Virtualization (NFV) provides virtualized network services through service chains of virtual network functions (VNFs). VNFs typically execute on virtual machines in a cloud infrastructure, which consists of geo-distributed cloud data centers. Compared to traditional cloud services, key challenges in virtual network service provisioning lie in the optimal placement of VNF instances while considering inter-VNF traffic and end-to-end delay in a service chain. The challenge further escalates when a service chain requires online processing upon the its arrival. We propose an online algorithm to address the above challenges, while aim to maximize the aggregate chain valuation. We first study a one-time VNF chain placement problem. Leveraging techniques of exhaustive sampling and ST rounding, we propose an efficient one-time algorithm to determine the placement scheme of a given service chain. We then propose a primal-dual online placement scheme that employs the one-time algorithm as a building block to make decisions upon the arrival of each chain. Through both theoretical analysis and trace-driven simulations, we verify that the online placement algorithm is computationally efficient and achieves a good competitive ratio.
NFV (Network Function Virtualization)通过虚拟网络功能服务链(VNFs)提供虚拟化的网络服务。VNFs通常在云基础设施中的虚拟机上执行，云基础设施由地理分布的云数据中心组成。与传统云服务相比，虚拟网络服务提供的关键挑战在于VNF实例的最佳配置，同时考虑到服务链中的VNF间流量和端到端延迟。当服务链在到达时需要在线处理时，挑战进一步升级。我们提出了一种在线算法来解决上述挑战，同时旨在最大化总链估值。我们首先研究了一次性VNF链的放置问题。利用穷举抽样和ST舍入技术，我们提出了一种有效的一次性算法来确定给定服务链的放置方案。然后，我们提出了一种原始对偶在线放置方案，该方案采用一次性算法作为构建块，在每个链到达时做出决策。通过理论分析和跟踪驱动仿真，我们验证了在线放置算法的计算效率和良好的竞争比。
{"title":"An Online Placement Scheme for VNF Chains in Geo-Distributed Clouds","authors":"Ruiting Zhou","doi":"10.1109/IWQoS.2018.8624140","DOIUrl":"https://doi.org/10.1109/IWQoS.2018.8624140","url":null,"abstract":"Network Function Virtualization (NFV) provides virtualized network services through service chains of virtual network functions (VNFs). VNFs typically execute on virtual machines in a cloud infrastructure, which consists of geo-distributed cloud data centers. Compared to traditional cloud services, key challenges in virtual network service provisioning lie in the optimal placement of VNF instances while considering inter-VNF traffic and end-to-end delay in a service chain. The challenge further escalates when a service chain requires online processing upon the its arrival. We propose an online algorithm to address the above challenges, while aim to maximize the aggregate chain valuation. We first study a one-time VNF chain placement problem. Leveraging techniques of exhaustive sampling and ST rounding, we propose an efficient one-time algorithm to determine the placement scheme of a given service chain. We then propose a primal-dual online placement scheme that employs the one-time algorithm as a building block to make decisions upon the arrival of each chain. Through both theoretical analysis and trace-driven simulations, we verify that the online placement algorithm is computationally efficient and achieves a good competitive ratio.","PeriodicalId":222290,"journal":{"name":"2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130251978","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-06-01DOI: 10.1109/IWQoS.2018.8624134
D. Kushnir, G. Gohil, Z. Sayeed, H. Uzunalioglu
Modern cellular networks are complex systems offering a wide range of services and present challenges in detecting anomalous events when they do occur. The networks are engineered for high reliability and, hence, the data from these networks is predominantly normal with a small proportion being anomalous. From an operations perspective, it is important to detect these anomalies in a timely manner in order to mitigate them and preclude the occurrence of major failure events. In telecommunications diverse set of data such as KPIs, logs and alarms are generated to monitor the health and stability of the network element and the services carried over it [1]–[4].
{"title":"Predicting Outages in Radio Networks with Alarm Data","authors":"D. Kushnir, G. Gohil, Z. Sayeed, H. Uzunalioglu","doi":"10.1109/IWQoS.2018.8624134","DOIUrl":"https://doi.org/10.1109/IWQoS.2018.8624134","url":null,"abstract":"Modern cellular networks are complex systems offering a wide range of services and present challenges in detecting anomalous events when they do occur. The networks are engineered for high reliability and, hence, the data from these networks is predominantly normal with a small proportion being anomalous. From an operations perspective, it is important to detect these anomalies in a timely manner in order to mitigate them and preclude the occurrence of major failure events. In telecommunications diverse set of data such as KPIs, logs and alarms are generated to monitor the health and stability of the network element and the services carried over it [1]–[4].","PeriodicalId":222290,"journal":{"name":"2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131574565","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
扫码关注我们
求助内容：
应助结果提醒方式：