{"title":"Real-time Application Identification of RTC Media Streams via Encrypted Traffic Analysis","authors":"Hua Wu, Cheng Zhu, Guang Cheng, Xiaoyan Hu","doi":"10.1109/ICCCN54977.2022.9868928","DOIUrl":"https://doi.org/10.1109/ICCCN54977.2022.9868928","url":null,"abstract":"The globalization of the economy and the increase in network bandwidth have contributed significantly to the development and popularity of real-time communication (RTC) social applications. RTC media streams, such as video meetings and calls, require more network resources and real-time performance than other services. In order to meet the requirements of RTC application providers to offer a higher level of service to their subscribers, Internet Service Providers (ISPs) need to identify the application to which the RTC media stream belongs. There are already some studies on traffic identification. However, the extant work is not yet able to distinguish the corresponding applications from the same type of media streams in real time. In addition, most of the work is not validated with actual data containing massive background traffic. Hence, we propose a real-time application identification method for meeting and calling RTC media streams in social networks. By analyzing the encrypted traffic, the method extracts features from the unit-time traffic aggregation without using payload and related information fields. The generated feature sequences are fed to our lightweight model. Our proposed method does not depend on initial packets or whole flows, and only an arbitrary 3-second traffic block is needed to achieve over 99% accuracy. Moreover, experiments using high-speed network traffic reflect that our approach can identify corresponding applications from RTC media streams in real time. Besides, comparisons with similar work show that this method requires only 1/160th of the memory and 1/10th of the processing time.","PeriodicalId":376557,"journal":{"name":"2022 International Conference on Computer Communications and Networks (ICCCN)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125753075","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":"Server Workload Assignment for Real-Time Range Queries in Adaptive Quad Streaming Sensor Environments","authors":"Simon Keller, Rainer Mueller","doi":"10.1109/ICCCN54977.2022.9868870","DOIUrl":"https://doi.org/10.1109/ICCCN54977.2022.9868870","url":null,"abstract":"Dynamic Real-Time Range Queries (DRRQ) are a common means to handle mobile clients in high-density areas where both, clients requested by the query and the inquirers, are mobile. In contrast to the very well-known continuous range queries, only a few approaches, such as Adaptive Quad Streaming (AQS), address the mandatory scalability and real-time requirements of these so-called ad-hoc mobility challenges. In this paper we present the highly decentralized solution Adaptive Quad Streaming Flexible (AQSflex) as an extension of the already existing more theoretical AQS approach. Beside a highly distributed cell structure without data structures and a lightweight streaming communication, we use a multi-cell-assignment on limited pool resources instead of an idealistic unlimited cell-per-server assignment. The described experimental results show the potential of our local capacity balancing scheme for cell handover in a strongly decentralized setting. Leafs of a cell hierarchy define a kind of self-optimizing fuzzy edge for the processing resources in high-density systems without any centralized controlling or cloud component.","PeriodicalId":376557,"journal":{"name":"2022 International Conference on Computer Communications and Networks (ICCCN)","volume":"355 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131337682","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":"Achieving High End-to-End Availability in VNF Networks","authors":"Enrique Rodicio, Deng Pan, Jason Liu, Bin Tang","doi":"10.1109/ICCCN54977.2022.9868897","DOIUrl":"https://doi.org/10.1109/ICCCN54977.2022.9868897","url":null,"abstract":"As software programs, Virtual Network Functions (VNFs) introduce new challenges to network availability due to their potential software failures. Existing models on the availability of VNF networks did not consider all the possible hardware and software failures, making them incapable of analyzing the end-to-end availability of a path. Furthermore, they did not capture the correlation between repeating nodes and links in the path, resulting in inaccurate analytical results. In this paper, we propose a new analytical model, which considers all hardware and software failures as well as the effect of repeating components, to effectively analyze the end-to-end availability of a flow path in VNF networks. On top of the analytical model, we formulate the Highest Availability Path (HAP) problem that finds the flow path with the highest end-to-end availability, and prove its NP-hardness by reduction from the Node-Weighted Steiner Tree problem. Next, we propose two algorithms for HAP: the first one based on a Steiner Tree approximation algorithm, having high time complexity and serving as a performance benchmark; the second one using a dynamic programming approach to search a multi-layer graph in polynomial time. Finally, we present extensive evaluation data to demonstrate the effectiveness of the Layered Search algorithm, which achieves comparable performance as that of the Steiner Tree based algorithm and runs faster by four orders of magnitude.","PeriodicalId":376557,"journal":{"name":"2022 International Conference on Computer Communications and Networks (ICCCN)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132982247","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":"Intelligent Reflecting Surface-Aided Centralized Scheduling for mmWave V2V Networks","authors":"Sheng Pan, Xin Ming Zhang, D. Sung","doi":"10.1109/ICCCN54977.2022.9868862","DOIUrl":"https://doi.org/10.1109/ICCCN54977.2022.9868862","url":null,"abstract":"In this paper, we investigate how to efficiently schedule vehicle-to-vehicle (V2V) requests in millimeter wave (mmWave) vehicular networks. Considering the vulnerability of mmWave signals to blockages and the disadvantages of traditional relay mode, we firstly propose the cooperation of intelligent reflecting surfaces (IRSs) and relays to enable the scheduling of non-line-of-sight (NLOS) requests. To maximize the resource utilization and consequently improve the success ratio of link scheduling, we design a centralized scheduling algorithm based on spatial-time division multiple access (STDMA) and the cooperation scheme. The proposed algorithm can provide more opportunities for scheduling NLOS requests by the cooperation of IRSs and relays, and achieve the goal of collision-free concurrent transmissions by fully leveraging spatial reuse, so that as many V2V requests as possible can be fulfilled. Simulation results demonstrate that the proposed scheme can effectively enhance the success ratio of scheduling V2V requests especially NLOS requests.","PeriodicalId":376557,"journal":{"name":"2022 International Conference on Computer Communications and Networks (ICCCN)","volume":"175 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133541403","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":"List of Reviewer by Tracks","authors":"","doi":"10.1109/icccn54977.2022.9868844","DOIUrl":"https://doi.org/10.1109/icccn54977.2022.9868844","url":null,"abstract":"","PeriodicalId":376557,"journal":{"name":"2022 International Conference on Computer Communications and Networks (ICCCN)","volume":"287 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133550049","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}
Li-Hsing Yang, Shin-Shan Huang, Tsai-Ling Cheng, Yi-Ching Kuo, Jian-Jhih Kuo
{"title":"Socially-aware Collaborative Defense System against Bit-Flip Attack in Social Internet of Things and Its Online Assignment Optimization","authors":"Li-Hsing Yang, Shin-Shan Huang, Tsai-Ling Cheng, Yi-Ching Kuo, Jian-Jhih Kuo","doi":"10.1109/ICCCN54977.2022.9868899","DOIUrl":"https://doi.org/10.1109/ICCCN54977.2022.9868899","url":null,"abstract":"A powerful Bit-Flip Attack (BFA), based on Row Hammer Attack (RHA), can precisely flip the most vulnerable bits in the memory system (i.e., DRAM) to crash Convolutional Neural Networks (CNNs) run on Internet-of-Things (IoT) devices. However, it is very difficult to detect BFA since most devices are usually with limited computation capability and unaware of the security issue. Therefore, BFA becomes one of the most crucial threats to IoT networks. To this end, we design a novel defense system termed Resilient Dual-mode Defense System (RIDES) to encourage IoT devices with social relationships (i.e., Social IoT (SIoT)) to collaborate on BFA detection in an online manner. Subsequently, a new online problem, Online Computing Unit Assignment Problem (OMAR), is formulated to optimize the total inference rate for detecting BFA. To address OMAR's challenges, we present an online algorithm, Socially-aware Checker Assign-ment Algorithm (SCAN), to achieve the optimal competitive ratio. Extensive experiment and simulation results manifest that RIDES effectively detects BFA and in average, SCAN increases the total inference rate by 8%-515% and reduces the average overhead per image by 31%-55% compared with other solutions.","PeriodicalId":376557,"journal":{"name":"2022 International Conference on Computer Communications and Networks (ICCCN)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116932417","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}
Thilina N. Weerasinghe, V. Giner, Indika A. M. Balapuwaduge, F. Li, Marius Constantin Vochin
{"title":"A Pseudo-Bayesian Subframe based Framework for Grant-Free Massive Random Access in 5G NR Networks","authors":"Thilina N. Weerasinghe, V. Giner, Indika A. M. Balapuwaduge, F. Li, Marius Constantin Vochin","doi":"10.1109/ICCCN54977.2022.9868918","DOIUrl":"https://doi.org/10.1109/ICCCN54977.2022.9868918","url":null,"abstract":"Although the number of massive machine type communications (mMTC) devices covered by a fifth generation (5G) cell could be huge, not all devices are always active. For radio resource allocation, it is vital that a base station has the knowledge on the number of active mMTC devices in each frame. In this paper, we develop a mathematical framework to perform pseudo-Bayesian estimation on the number of active devices within a 5G new radio (NR) subframe. The estimation is performed by the base station on a subframe-by-subframe basis based upon which a transmission permission probability is imposed on active devices for their transmissions in the next subframe. The active devices include both backlogged devices and new arrivals in the current subframe that will attempt for medium access in the next subframe relying on a combination of NR radio resources in both time and frequency domains. Such an estimation constitutes an important component for the design of grant-free access schemes for mMTC uplink traffic.","PeriodicalId":376557,"journal":{"name":"2022 International Conference on Computer Communications and Networks (ICCCN)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129519348","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":"Exact Algorithms for Finding Fixed-Length Cycles in Edge-Weighted Graphs","authors":"Rhyd Lewis, Fiona Carroll","doi":"10.1109/ICCCN54977.2022.9868939","DOIUrl":"https://doi.org/10.1109/ICCCN54977.2022.9868939","url":null,"abstract":"We describe our recent work on the problem of producing fixed-length cycles in edge-weighted graphs. We give two exact methods for this $mathcal{NP}mathbf{-hard}$ problem and briefly consider their scaling-up characteristics.","PeriodicalId":376557,"journal":{"name":"2022 International Conference on Computer Communications and Networks (ICCCN)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127226952","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}
Zewen Huang, Kui Wu, Shengqiang Huang, Yang Zhou, Ronnie Salvador Giagone
{"title":"Automatic Field Extraction of Extended TLV for Binary Protocol Reverse Engineering","authors":"Zewen Huang, Kui Wu, Shengqiang Huang, Yang Zhou, Ronnie Salvador Giagone","doi":"10.1109/ICCCN54977.2022.9868903","DOIUrl":"https://doi.org/10.1109/ICCCN54977.2022.9868903","url":null,"abstract":"Type Length Value (TLV) is one of the main structures commonly used in network protocols. A large number of proprietary protocols, whose specification is unknown to the public, run in the current Internet as well as domain-specific Internet of Things (IoT) applications. It is critical to infer the TLV fields within a packet because this information can help network administrators quickly identify abnormal traffic and potential attacks. Inferring TLV fields belongs to the general task of protocol reverse engineering and is particularly challenging for binary protocols, where the boundaries of TLV fields have many possible positions. Existing methods for reverse engineering binary protocols involve many parameters and only work for protocols strictly following the conventional TLV format. We extend the concept of TLV to accommodate a broader category of structural patterns in various binary protocols, such as TCP, IP, ModBus, and MQTT. We then design algorithms to automatically extract the extended - TLV fields from packets. Via a series of experiments over several protocols, we demonstrate that our algorithms can accurately and quickly identify the extended-TLV fields in all the tested protocols. Our approach can thus be deployed as a general method for automatically reverse engineering binary protocol format.","PeriodicalId":376557,"journal":{"name":"2022 International Conference on Computer Communications and Networks (ICCCN)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121273947","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}
Haoran Jiao, Qing Wang, Zhaoshan Fan, Junrong Liu, D. Du, Ning Li, Yuling Liu
{"title":"DGGCN: Dictionary based DGA detection method based on DomainGraph and GCN","authors":"Haoran Jiao, Qing Wang, Zhaoshan Fan, Junrong Liu, D. Du, Ning Li, Yuling Liu","doi":"10.1109/ICCCN54977.2022.9868932","DOIUrl":"https://doi.org/10.1109/ICCCN54977.2022.9868932","url":null,"abstract":"Nowadays, malware uses Algorithmically Generated Domains (AGDs) to establish communication with Command and Control (C&C) servers. Dictionary based Domain Generation Algorithm (DGA) selects words from the frequently changed dictionaries to generate AGDs similar to benign domains, which degrades the accuracy of string based detection method. To combat this, we propose a DGA detection method based on DomainGraph and GCN (Graph Convolutional Network) which detects cross-dictionary AGDs based on the association relation between domains instead of lexical features. Starting from the association relation between domains rather than the lexical features of the domain itself, we can detect the unknown AGDs from a known AGD, regardless of the DGA dictionary they use. The proposed method exploits the fact that string association of benign domains is weak, while AGDs' association is strong. DGGCN composes a domain segmentation method, constructs a graph composed of domains (DomainGraph) based on segmentations and adopts GCN to detect AGDs. We conduct the experiments on public datasets under three settings: detecting AGDs generated by familiar dictionaries, unfamiliar dictionaries and confusing dictionaries. The results reveal that DGGCN can detect cross-dictionary AGDs similar to benign domains more accurately and robustly.","PeriodicalId":376557,"journal":{"name":"2022 International Conference on Computer Communications and Networks (ICCCN)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134345440","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}