{"title":"I2UTS: An IoT based Intelligent Urban Traffic System","authors":"Vejey Pradeep Suresh Achari, Zeba Khanam, A. Singh, Anish Jindal, Alok Prakash, Neeraj Kumar","doi":"10.1109/HPSR52026.2021.9481822","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481822","url":null,"abstract":"Growing population and migration to cities have given birth to multiple urban issues. Traffic congestion is one of the most prominent ones with severe side effects like fuel wastage, loss of lives, and slow productivity. The traditional traffic control system deploys programming logic control (PLC) which uses round-robin scheduling algorithm. However, few recent works have proposed IoT-based framework which requires the deployment of a series of sensors. In this paper, we propose an IoT-based framework that uses the existing network of CCTV cameras at the junction. An edge device is used to estimate the traffic density and detect emergency vehicles using YOLO v3 -Efficient Net. These two parameters are used as an input to a novel traffic control algorithm. The performance of the proposed framework has been evaluated by analyzing its properties using the UA-DETRAC dataset. The proposed framework achieves 68.10% vehicle detection accuracy.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"202 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123052034","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}
{"title":"A New Control Algorithms for Simultaneous Connections Routing in Elastic Optical Networks","authors":"Enass Abuelela, M. Żal","doi":"10.1109/HPSR52026.2021.9481847","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481847","url":null,"abstract":"This paper presents novel six rearrangeable control algorithms suitable for Elastic Optical Network (EON). The proposed algorithms are based on simultaneous routing and matrix decomposition. We investigated the wavelength-space-wavelength switching fabrics, known as the WSW1, for previously developed three-stage architecture. In our proposal, we develop these algorithms for the four inputs/outputs WSW1 switching fabrics. The three-stage architecture of WSW1 was intensively considered only for a smaller number of inputs/outputs. We were able to achieve better results than previously proposed algorithms considering the same number of inputs/outputs. The switching fabric working under the proposed algorithms offers a smaller construction cost than the switching fabric controlled by previously known algorithms. This is expressed by the number of wavelength converters.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126740773","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}
P. Reviriego, José Alberto Hernández, Zhenwei Dai, Anshumali Shrivastava
{"title":"Learned Bloom Filters in Adversarial Environments: A Malicious URL Detection Use-Case","authors":"P. Reviriego, José Alberto Hernández, Zhenwei Dai, Anshumali Shrivastava","doi":"10.1109/HPSR52026.2021.9481857","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481857","url":null,"abstract":"Learned Bloom Filters (LBFs) have been recently proposed as an alternative to traditional Bloom filters that can reduce the amount of memory needed to achieve a target false positive probability when representing a given set of elements. LBFs rely on Machine Learning models combined with traditional Bloom filters. However, if LBFs are going to be used as an alternative to Bloom filters, their security must be also be considered. In this paper, the security of LBFs is studied for the first time and a vulnerability different from those of traditional Bloom filters is uncovered. In more detail, an attacker can easily create a set of elements that are not in the filter with a much larger false positive probability than the target for which the filter has been designed. The constructed attack set can then be used to for example launch a denial of service attack against the system that uses the LBF. A malicious URL case study is used to illustrate the proposed attacks and show their effectiveness in increasing the false positive probability of LBFs. The dataset under consideration includes nearly 485K URLs where 16.47% of them are malicious URLs. Unfortunately, it seems that mitigating this vulnerability is not straightforward.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125764598","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}
Mohammed Lotfi Hachemi, Abdelghani Ghomari, Y. H. Aoul, G. Rubino
{"title":"Mobile traffic forecasting using a combined FFT/LSTM strategy in SDN networks","authors":"Mohammed Lotfi Hachemi, Abdelghani Ghomari, Y. H. Aoul, G. Rubino","doi":"10.1109/HPSR52026.2021.9481863","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481863","url":null,"abstract":"Over the last few years, networks’ infrastructures are experiencing a profound change initiated by Software Defined Networking (SDN) and Network Function Virtualization (NFV). In such networks, avoiding the risk of service degradation increasingly involves predicting the evolution of metrics impacting the Quality of Service (QoS), in order to implement appropriate preventive actions. Recurrent neural networks, in particular Long Short Term Memory (LSTM) networks, already demonstrated their efficiency in predicting time series, in particular in networking, thanks to their ability to memorize long sequences of data. In this paper, we propose an improvement that increases their accuracy by combining them with filters, especially the Fast Fourier Transform (FFT), in order to better extract the characteristics of the time series to be predicted. The proposed approach allows improving prediction performance significantly, while presenting an extremely low computational complexity at run-time compared to classical techniques such as Auto-Regressive Integrated Moving Average (ARIMA), which requires costly online operations.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114984064","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}
Mouna Ben Mabrouk, Jean-Paul Garandeau, Thibault Tabani, Martine Gateau
{"title":"A Self Organizing OneM2M IoT Network","authors":"Mouna Ben Mabrouk, Jean-Paul Garandeau, Thibault Tabani, Martine Gateau","doi":"10.1109/HPSR52026.2021.9481831","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481831","url":null,"abstract":"In IoT, there is a huge diversity in types of devices, protocols and mechanisms that must be supported. ‘IoTification’ helps these objects to communicate with each other, exchange information in order to have a better connected and managed system. In order to reduce the number of errors during manual maintenance interventions on the IoT network infrastructure and to improve the efficiency of reconfiguration actions by automatic mechanisms, a self-organizing network (SON)-based architecture is proposed for a oneM2M IoT network. This makes it possible to take into account the heterogeneity of IoT subnets and to reduce the costs related to network infrastructure extensions. The proposed approach is implemented and evaluated according to the ACS quality management system.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130092007","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}
{"title":"Verification of Cloud Security Policies","authors":"Loïc Miller, P. Mérindol, A. Gallais, C. Pelsser","doi":"10.1109/HPSR52026.2021.9481870","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481870","url":null,"abstract":"Companies like Netflix increasingly use the cloud to deploy their business processes. Those processes often involve partnerships with other companies, and can be modeled as workflows where the owner of the data at risk interacts with contractors to realize a sequence of tasks on the data to be secured.In practice, access control is an essential building block to deploy these secured workflows. This component is generally managed by administrators using high-level policies meant to represent the requirements and restrictions put on the workflow. Handling access control with a high-level scheme comes with the benefit of separating the problem of specification, i.e. defining the desired behavior of the system, from the problem of implementation, i.e. enforcing this desired behavior. However, translating such high-level policies into a deployed implementation can be error-prone.Even though semi-automatic and automatic tools have been proposed to assist this translation, policy verification remains highly challenging in practice. In this paper, our aim is to define and propose structures assisting the checking and correction of potential errors introduced on the ground due to a faulty translation or corrupted deployments. In particular, we investigate structures with formal foundations able to naturally model policies. Metagraphs, a generalized graph theoretic structure, fulfill those requirements: their usage enables to compare high-level policies to their implementation. In practice, we consider Rego, a language used by companies like Netflix and Plex for their release process, as a valuable representative of most common policy languages. We propose a suite of tools transforming and checking policies as metagraphs, and use them in a global framework to show how policy verification can be achieved with such structures. Finally, we evaluate the performance of our verification method.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125661773","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}
Abeer Z. Al-Marridi, Amr Mohamed, A. Erbad, M. Guizani
{"title":"CAE Adaptive Compression, Transmission Energy and Cost Optimization for m-Health Systems","authors":"Abeer Z. Al-Marridi, Amr Mohamed, A. Erbad, M. Guizani","doi":"10.1109/HPSR52026.2021.9481807","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481807","url":null,"abstract":"The rapid increase in the number of patients requiring constant monitoring inspires researchers to investigate the area of mobile health (m-Health) systems for intelligent and sustainable remote healthcare applications. Extensive real-time medical data transmission using battery-constrained devices is challenging due to the dynamic network and the medical system constraints. Such requirements include end-to-end delay, bandwidth, transmission energy consumption, and application-level Quality of Services (QoS) requirements. As a result, adaptive data compression based on network and application resources before data transmission would be beneficial. A minimal distortion can be assured by applying Convolutional Auto-encoder (CAE) compression approach. This paper proposes a cross-layer framework that considers the patients’ movement while compressing and transmitting EEG data over heterogeneous wireless environments. The main objective of the framework is to minimize the trade-off between the transmission energy consumption along with the distortion ratio and monetary costs. Simulation results show that an optimal trade-off between the optimization objectives is achieved considering networks and application QoS requirements for m-Health systems.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130922657","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}
C. Westphal, Dongbiao He, K. Makhijani, Richard Li
{"title":"Qualitative Communications for Augmented Reality and Virtual Reality","authors":"C. Westphal, Dongbiao He, K. Makhijani, Richard Li","doi":"10.1109/HPSR52026.2021.9481793","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481793","url":null,"abstract":"Qualitative Communication has been proposed to increase the responsiveness of a network due to packet loss. The basic idea is to allow the network to drop part of the payload to preserve the integrity of the session (as opposed to dropping whole packets as in TCP).We consider this idea in the context of AR/VR and see how selectively dropping payload naturally fits with such an application where the data can be easily split within some critical and non-critical data. We present basic mechanism to leverage qualitative communications in 360 degree video streaming, as well as a pre-fetching scheme. We evaluate this proposal on actual 360 video traces and show the significant improvement of our proposal versus a vanilla transmission mechanism.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125604463","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}
{"title":"A Reinforcement Learning-based solution for Intra-domain Egress Selection","authors":"Duc-Huy Le, H. Tran, Sami Souihi","doi":"10.1109/HPSR52026.2021.9481846","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481846","url":null,"abstract":"An ingress router often has multiple potential egress points in an extensive network where it can transmit traffic to external networks. The traditional solution is choosing the closest node (with the shortest path) to the ingress node. This paper claims the drawbacks of this approach in a flexible network system and introduces our proposal called MAB-based Egress Selection. Our approach uses several Reinforcement Learning techniques, which are commonly used to resolve Multi-Armed Bandit (MAB) problem, to allow the ingress router to periodically re-pick egress point, hence optimize the long-term performance of traffic transmission. To formalize the egress selection process as a MAB problem, we use a combined score of delay and loss representing link status as a reward. However, capturing those network metrics encounters some issues due to the distributed control and restricted local view of network nodes. For this purpose, a centralized control architecture, e.g., Software-defined Network (SDN), is a promising candidate. We applied four common algorithms, ϵ-greedy, Softmax, UCB1 and Single Pull UCB2 (SP-UCB2) for egress selection process. The models are evaluated in two simulated network topologies with different scenarios of network traffic condition. The experimental results show that the UCB algorithms produce the best performance, especially in busy network.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123252751","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}
Yizhou Li, Zifa Han, Shuheng Gu, G. Zhuang, Feng Li
{"title":"Dyncast: Use Dynamic Anycast to Facilitate Service Semantics Embedded in IP address","authors":"Yizhou Li, Zifa Han, Shuheng Gu, G. Zhuang, Feng Li","doi":"10.1109/HPSR52026.2021.9481819","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481819","url":null,"abstract":"Edge computing services are deployed at edge sites that are closer to users compare to the central cloud. There are quite a number of edge sites in a city hosting those service instances. The user’s request is normally served by the geographically closest one in order to get faster response. However the shortest distance does not necessarily mean the lowest latency from the user’s experience. With increasing number of edge sites, computing capacity and load, and network path status rather than geographical location, are playing key roles in determining the best edge site or service instance to handle the user’s request to achieve the optimal overall load balance and user experience. In this paper, we propose a dynamic anycast (Dyncast) networking architecture to optimally route the computing request to the most appropriate service instance by considering the real time computing loads and the network status simultaneously. The field testbed experiments demonstrate the effectiveness of the proposed dyncast architecture. Dyncast shows 9.5% to 159.9% improvement in terms of job completion time (JCT) over traditional scheduling strategy under different computing load and network status scenarios.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134234338","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}