Mohammed Shabbir Ali, Julian Garbiso, Jun Zhang, H. Labiod, O. Shagdar, Mohamed Hadded
{"title":"An Analytical Model of Bluetooth Performance Considering Physical and MAC Layers’ Effects","authors":"Mohammed Shabbir Ali, Julian Garbiso, Jun Zhang, H. Labiod, O. Shagdar, Mohamed Hadded","doi":"10.1109/HPSR52026.2021.9481845","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481845","url":null,"abstract":"This paper presents an analytical model for the average Packet Error Rate (PER) of Bluetooth in Basic Rate (BR) mode. The effects of the physical layer and the MAC layer are taken into account. A Nakagami-m block fading is considered to take into account the effects of wireless channel fading. A Gaussian Frequency Shift Keying (GFSK) modulation scheme is used. Also, Forward Error Control (FEC) coding effects are taken into account. The interference between the different piconets is captured by a simple Medium Access Control (MAC) layer collision model. An approximation of instantaneous PER is obtained as a first result. Then, a closed-form expression is derived for the PER at the physical layer of Bluetooth. Finally, the overall average PER at the physical and MAC layer of Bluetooth is computed. Extensive simulations are performed to show the accuracy of the obtained results.","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":"130516147","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":"[Copyright notice]","authors":"","doi":"10.1109/hpsr52026.2021.9481791","DOIUrl":"https://doi.org/10.1109/hpsr52026.2021.9481791","url":null,"abstract":"","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"7 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":"122361754","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":"The Future of Media Streaming Systems: Transferring Video over New IP","authors":"S. Clayman, Mustafa Tuker, Halil Arasan, M. Sayıt","doi":"10.1109/HPSR52026.2021.9481835","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481835","url":null,"abstract":"Big Packet Protocol (BPP), which is part of New IP, was designed to transfer packets for future networking applications, and aims to overcome obstacles within current networks for high precision services. One of the most important advantages of New IP is that it allows changes to packets during transmission. The strategy of BPP is to reduce the packet size by eliminating specific chunks, cutting out segments from the transferred video, rather than dropping or retransmitting packets. This provides an effective mechanism to enhance the performance of video streaming applications, by obtaining continuous delivery and minimum guaranteed quality at the receiver. In order to make video transmission over BPP effective, we need to select a video codec that can do multiple encodings for the same region, such as scalable video coding (SVC). To support such functionality, we have augmented the BPP packet structure in order to transfer video data. This paper describes the use of BPP for carrying video from servers to clients, and defines the packet structure for this purpose, plus the extensions needed to support SVC encoded video. To evaluate the proposed approach, we use SDN to facilitate BPP operations, with results showing a successful implementation of a system using these combined techniques.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"48 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":"124892346","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 Multi-objective Routing Scheme for Deterministic Network","authors":"Y. Xia, Bing Hu","doi":"10.1109/HPSR52026.2021.9481862","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481862","url":null,"abstract":"The problem discussed and solved in this paper is the multi-objective routing problem for Deterministic Network. The technical requirements of resource allocation in the Deterministic Network implementation technology require us to reserve corresponding resources for deterministic flows to be transmitted in the network, which introduces a new constraint of bandwidth competition, making the existing multi-objective routing schemes unable to provide effective solutions. In order to solve this problem, we firstly establish a mathematical model and solve it with optimization methods. Then we propose a multi-objective routing scheme based on genetic algorithm. On the basis of satisfying delay and bandwidth constraints, good results are obtained. In order to test the scalability of the scheme, it was tested in network after adding packet loss constraint and the network of larger scales, which all achieved good results. By comparing the performance of our scheme with that of mathematical modeling optimization, it is found that our scheme has a significant and substantial improvement in efficiency at the cost of relaxing constraints. It is concluded that the multi-objective routing scheme based on genetic algorithm proposed in this paper is an effective scheme to solve the multi-objective problem for Deterministic Network.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"69 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":"129791824","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":"EP4: An Application-Aware Network Architecture with a Customizable Data Plane","authors":"Ouassim Karrakchou, N. Samaan, A. Karmouch","doi":"10.1109/HPSR52026.2021.9481828","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481828","url":null,"abstract":"Fast and customizable programmable data planes (PDPs) implementing new services such as multi-flow synchronization, on- and in-time delivery, and in-network caching and compression are key enablers to future applications (e.g., streamed holograms, telesurgery, and autonomous industrial systems). This paper outlines the design principles of EP4, an application-aware extended P4-based network architecture that offers hosted applications an extensible catalog of services through its control plane. The latter configures a PDP that can achieve minimal parsing and processing for fast-tracked packets as well as customized processing and forwarding for other packets. An extended parser (eParser) performs the first task, which reduces the necessary latency experienced by packets. Alternatively, adaptive processing is achieved using an enhanced processor (eProcessor) that optionally parses customized headers using just-in-time programmable parsers. It then executes selected P4 packet processing pipelines implementing different services. These programs are installed at runtime without impacting other switch functionalities. Experimental results demonstrate the architecture’s enhanced performance compared to current solutions.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"6 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":"125314074","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}
S. Khebbache, Makhlouf Hadji, Mohamed-Idriss Khaledi
{"title":"Reinforcement Learning Based Approach for Virtualized Face Detection at the Edge","authors":"S. Khebbache, Makhlouf Hadji, Mohamed-Idriss Khaledi","doi":"10.1109/HPSR52026.2021.9481827","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481827","url":null,"abstract":"Real-time requirements in video streaming and processing are increasing and represent one of the major issues in industry 4.0 domains. In particular, Face Detection (FD) use-case has attracted the interest of industrial and academia researchers for various applications such as cyber-physical security, fault detection, predictive maintenance, etc. To ensure applications with real time performance, Edge Computing is a good approach which consists in bringing resources and intelligence closer to connected devices and hence, it can be used to cope with strong latency and throughput expectations. In this paper, we consider optimal routing, placement and scaling of virtualized face detection services at the edge. We propose an edge networking approach based on Integer Linear formulation to cope with small problem instances. A reinforcement learning solution is proposed to address larger problem sizes and scalability issues. We assess the performance of our proposed approaches through simulations and show advantages of the reinforcement learning approach to converge towards near-optimal solutions in negligible time.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"146 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":"116474373","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":"Flexible Semantic-based Data Networking for IoT Domains","authors":"M. Al-Naday, I. Macaluso","doi":"10.1109/HPSR52026.2021.9481800","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481800","url":null,"abstract":"The rapid adoption of the Internet of Things (IoT) as a means for digital transformation is sketching a new landscape of heterogeneous data and distributed, machine learning-based, applications. The intertwine of the two combined with the varying availability of data, generated in different parts of the domain, raises the need to exchange bulks of relevant data on demand across application(s) points. Data relevance escalates the role of semantics in identifying and locating suitable data; particularly at the network layer, to provide efficient mapping of data supply and demand. This paper proposes a semantic-based data networking framework, for managed IoT domains, embracing principles of information-centric networking without restrictions on the routing function. Managed semantics are used to provide flexible (label-based) data addressing scheme and a scalable semantic locator function, designed as an overlay network of distributed instances that can be realized on top of any routing or forwarding solution. Nonetheless, we outline different routing solutions and their suitability to such scenarios, to then draw a recommendation of the most suitable underlying routing fabric. We evaluate our framework over an example IoT domain of the Pervasive Nation (PN), Ireland national IoT network. Through our example, we show that the number of managed semantics in such a domain can be vastly smaller than that expected on an Internet scale. We analyze our semantic aggregation scheme over the example PN network, and show the high flexibility in mapping data while maintaining a small state in the semantic locator function.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"634 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":"131690640","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 Proof of Optimality on EDF Scheduling in Sink-tree Packetized Networks","authors":"Xuan Liu, Bingyang Liu, Shoushou Ren","doi":"10.1109/HPSR52026.2021.9481798","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481798","url":null,"abstract":"Earliest Deadline First (EDF) scheduling, is known to obtain the optimality of deterministic delay performance upon the single link. However, due to the generality of the network with multiple nodes and multiple flows transmitted within it, the optimal online scheduling is impossible. In this paper, we prove that EDF can still provide the optimal delay performance in a class of practical multiple-nodes-and-multiple-flows network scenarios, such as 5G Cloud VR/AR applications in up-link cases, namely in sink-tree networks multiple flows sharing the root node as the same destination node. The proof uses the delay-based schedulability region to quantify the performance of different scheduling policies. Finally, the proof indicates that EDF can achieve the largest schedulability region in sink-tree networks.","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":"131218079","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":"Indirect Line-Of-Sight Free-Space Optical Communications Using Diffuse Reflection","authors":"R. Rojas-Cessa","doi":"10.1109/HPSR52026.2021.9481868","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481868","url":null,"abstract":"Free-space optical communications (FSOC) has been proved to achieve the highest data rate in wireless communications, and yet, its long-time adoption remains reserved for a very selective set of applications. A culprit of the limited adoption of FSOC is its point-to-point link setup used by this technology as a result of the required a) the direct Line-of-Sight (LOS) between transmitter and receiver, and b) the needed fine alignment of the transceivers of the communicating stations. Indirect LOS FSOC (ID-FSOC) is an alternative to FSOC where transmitter and receiver might not be in LOS of each other but to a diffuse reflector (DR). Such a reflector not only helps to cover out-of-sight areas but also converts the optical link onto a broadcast channel where one station may communicate with all other stations that may have LOS to the reflector. Here, we discuss some of the properties of this novel paradigm and argue that it may represent a new facet of free space of optical communications that provides a great range of applications for high-speed data communications.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"48 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":"115005125","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 Recurrent Neural Network Based Approach for Coordinating Radio and Computing Resources Allocation in Cloud-RAN","authors":"Mahdi Sharara, Sahar Hoteit, V. Vèque","doi":"10.1109/HPSR52026.2021.9481812","DOIUrl":"https://doi.org/10.1109/HPSR52026.2021.9481812","url":null,"abstract":"Cloud Radio Access Network (Cloud-RAN) is a novel architecture that aims at centralizing the baseband processing of base stations. This architecture opens paths for joint, flexible, and optimal management of radio and computing resources. To increase the benefit from this architecture, efficient resource management algorithms need to be devised. In this paper, we consider a coordinated allocation of radio and computing resources to mobile users. Optimal resource allocation that respects the Hybrid-Automatic-Repeat-Request deadline may require formulating high-complexity and resource-heavy algorithms. We consider two Integer Linear Programming problems (ILP) that implement a coordinated allocation of radio and computing resources with the objectives of maximizing throughput and maximizing users’ satisfaction, respectively. Since solving these highly-complex problems requires a high execution time, we investigate low-complexity alternatives based on machine learning models; more precisely on Recurrent Neural Networks (RNN). These RNN models aim to depict the performance of the ILP problems with a much lower execution time. Our simulation results demonstrate the great ability of RNN models to perform very closely to the ILP problems while being able to reduce the execution time by up to 99.65%.","PeriodicalId":158580,"journal":{"name":"2021 IEEE 22nd International Conference on High Performance Switching and Routing (HPSR)","volume":"62 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":"115389196","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}