Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing最新文献_第4页

Scaling composite NFV-network services 扩展复合nfv网络业务

Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing Pub Date : 2020-10-07 DOI: 10.1145/3397166.3415277

J. Baranda, J. Mangues‐Bafalluy, L. Vettori, R. Martínez

引用次数: 3

DANGER 危险

Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing Pub Date : 2020-10-07 DOI: 10.1145/3397166.3415276

Andrea Coletta, G. Maselli, Mauro Piva, Domenicomichele Silvestri

引用次数: 5

Distributed resource allocation with multi-agent deep reinforcement learning for 5G-V2V communication 基于多智能体深度强化学习的5G-V2V通信分布式资源分配

Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing Pub Date : 2020-10-07 DOI: 10.1145/3397166.3413468

Alperen Gündogan, H. Gürsu, V. Pauli, W. Kellerer

{"title":"Distributed resource allocation with multi-agent deep reinforcement learning for 5G-V2V communication","authors":"Alperen Gündogan, H. Gürsu, V. Pauli, W. Kellerer","doi":"10.1145/3397166.3413468","DOIUrl":"https://doi.org/10.1145/3397166.3413468","url":null,"abstract":"We consider the distributed resource selection problem in Vehicle-to-vehicle (V2V) communication in the absence of a base station. Each vehicle autonomously selects transmission resources from a pool of shared resources to disseminate Cooperative Awareness Messages (CAMs). This is a consensus problem where each vehicle has to select a unique resource. The problem becomes more challenging when---due to mobility---the number of vehicles in vicinity of each other is changing dynamically. In a congested scenario, allocation of unique resources for each vehicle becomes infeasible and a congested resource allocation strategy has to be developed. The standardized approach in 5G, namely semi-persistent scheduling (SPS) suffers from effects caused by spatial distribution of the vehicles. In our approach, we turn this into an advantage. We propose a novel Distributed Resource Allocation mechanism using multi-agent reinforcement Learning (DIRAL) which builds on a unique state representation. One challenging issue is to cope with the non-stationarity introduced by concurrently learning agents which causes convergence problems in multi-agent learning systems. We aimed to tackle non-stationarity with unique state representation. Specifically, we deploy view-based positional distribution as a state representation to tackle non-stationarity and perform complex joint behavior in a distributed fashion. Our results showed that DIRAL improves PRR by 20% compared to SPS in challenging congested scenarios.","PeriodicalId":122577,"journal":{"name":"Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125015100","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}

引用次数: 17

Online dispatching and scheduling of jobs with heterogeneous utilities in edge computing 边缘计算中异构工具作业的在线调度与调度

Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing Pub Date : 2020-10-07 DOI: 10.1145/3397166.3409122

Chi Zhang, Haisheng Tan, Haoqiang Huang, Zhenhua Han, S. Jiang, N. Freris, Xiangyang Li

{"title":"Online dispatching and scheduling of jobs with heterogeneous utilities in edge computing","authors":"Chi Zhang, Haisheng Tan, Haoqiang Huang, Zhenhua Han, S. Jiang, N. Freris, Xiangyang Li","doi":"10.1145/3397166.3409122","DOIUrl":"https://doi.org/10.1145/3397166.3409122","url":null,"abstract":"Edge computing systems typically handle a wide variety of applications that exhibit diverse degrees of sensitivity to job latency. Therefore, a multitude of utility functions of the job response time need to be considered by the underlying job dispatching and scheduling mechanism. Nonetheless, previous works in edge computing mainly focused on either one kind of utility function (e.g., linear, sigmoid, or the hard deadline) or different kinds of utilities separately. In this paper, we investigate online job dispatching and scheduling strategies under the setting of coexistence of heterogeneous utilities, i.e., various coexisting jobs can employ different non-increasing utility functions. The goal is to maximize the total utility over all jobs in an edge system. Besides heterogeneous utilities, we here adopt a practical online model where the unrelated machine model and the upload and download delay are considered. We proceed to propose an online algorithm, O4A, to dispatch and schedule jobs with heterogeneous utilities. Our theoretical analysis shows that O4A is O(1/ɛ2)-competitive under the (1 + ɛ)-speed augmentation model, where ɛ is a small positive constant. We implement O4A on an edge computing testbed running deep learning inference jobs. With the production trace from Google Cluster, our experimental and large-scale simulation results indicate that O4A can increase the total utility by up to 39.42% compared with state-of-the-art utility-agnostic methods. Moreover, O4A is robust to estimation errors in job processing time and transmission delay.","PeriodicalId":122577,"journal":{"name":"Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114421401","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}

引用次数: 17

The role of machine learning for trajectory prediction in cooperative driving 机器学习在协同驾驶中轨迹预测中的作用

Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing Pub Date : 2020-10-07 DOI: 10.1145/3397166.3413470

Luis Sequeira, Toktam Mahmoodi

引用次数: 1

De-anonymizability of social network: through the lens of symmetry 社交网络的去匿名性:通过对称的镜头

Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing Pub Date : 2020-10-07 DOI: 10.1145/3397166.3409127

Benjie Miao, Shuaiqi Wang, Luoyi Fu, Xiaojun Lin

{"title":"De-anonymizability of social network: through the lens of symmetry","authors":"Benjie Miao, Shuaiqi Wang, Luoyi Fu, Xiaojun Lin","doi":"10.1145/3397166.3409127","DOIUrl":"https://doi.org/10.1145/3397166.3409127","url":null,"abstract":"Social network de-anonymization, which refers to re-identifying users by mapping their anonymized network to a correlated network, is an important problem that has received intensive study in network science. However, it remains less understood how network structural features intrinsically affect whether or not the network can be successfully de-anonymized. To find the answer, this paper offers the first general study on the relation between de-anonymizability and network symmetry. To this end, we propose to capture the symmetry of a graph by the concept of graph bijective homomorphism. By defining the matching probability matrix, we are able to characterize the de-anonymizability, i.e., the expected number of correctly matched nodes. Specifically, we show that for a graph pair with arbitrary topology, the de-anonymizability is equal to the maximal diagonal sum of the matching probability matrix generated from homomorphisms. Due to the prohibitive cost of enumerating all possible homomorphisms, we further obtain an upper bound of such de-anonymizability by counting the orbits of each of the two graphs, which significantly reduces the computational cost. Such a general result allows us to theoretically obtain the de-anonymizability of any networks with more specific topology structure. For example, for any classic Erdős-Rènyi graph with designated n and p, we can represent its de-anonymizability numerically by calculating the local symmetric structure that it contains. Extensive experiments are performed to validated our findings.","PeriodicalId":122577,"journal":{"name":"Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122784596","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

Graph-based model for beam management in Mmwave vehicular networks 基于图的毫米波车载网络波束管理模型

Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing Pub Date : 2020-07-21 DOI: 10.1145/3397166.3413469

Zana Limani Fazliu, C. Chiasserini, F. Malandrino, A. Nordio

{"title":"Graph-based model for beam management in Mmwave vehicular networks","authors":"Zana Limani Fazliu, C. Chiasserini, F. Malandrino, A. Nordio","doi":"10.1145/3397166.3413469","DOIUrl":"https://doi.org/10.1145/3397166.3413469","url":null,"abstract":"Mmwave bands are being widely touted as a very promising option for future 5G networks, especially in enabling such networks to meet highly demanding rate requirements. Accordingly, the usage of these bands is also receiving an increasing interest in the context of 5G vehicular networks, where it is expected that connected cars will soon need to transmit and receive large amounts of data. Mmwave communications, however, require the link to be established using narrow directed beams, to overcome harsh propagation conditions. The advanced antenna systems enabling this also allow for a complex beam design at the base station, where multiple beams of different widths can be set up. In this work, we focus on beam management in an urban vehicular network, using a graph-based approach to model the system characteristics and the existing constraints. In particular, unlike previous work, we formulate the beam design problem as a maximum-weight matching problem on a bipartite graph with conflicts, and then we solve it using an efficient heuristic algorithm. Our results show that our approach easily outperforms advanced methods based on clustering algorithms.","PeriodicalId":122577,"journal":{"name":"Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","volume":"225 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115493103","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}

引用次数: 5

Acting selfish for the good of all: contextual bandits for resource-efficient transmission of vehicular sensor data 为了所有人的利益而自私:资源高效传输车辆传感器数据的上下文强盗

Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing Pub Date : 2020-07-20 DOI: 10.1145/3397166.3413466

Benjamin Sliwa, Rick Adam, C. Wietfeld

引用次数: 1

Distributed double auctions for large-scale device-to-device resource trading 大规模设备对设备资源交易的分布式双重拍卖

Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing Pub Date : 2020-07-20 DOI: 10.1145/3397166.3409145

Shuqin Gao, C. Courcoubetis, Lingjie Duan

{"title":"Distributed double auctions for large-scale device-to-device resource trading","authors":"Shuqin Gao, C. Courcoubetis, Lingjie Duan","doi":"10.1145/3397166.3409145","DOIUrl":"https://doi.org/10.1145/3397166.3409145","url":null,"abstract":"Mobile users in future wireless networks face limited wireless resources such as data plan, computation capacity and energy storage. Given that some of these users may not be utilizing fully their wireless resources, device-to-device (D2D) resource sharing is a promising approach to exploit users' diversity in resource use and for pooling their resources locally. In this paper, we propose a novel two-sided D2D trading market model that enables a large number of locally connected users to trade resources. Traditional resource allocation solutions are mostly centralized without considering users' local D2D connectivity constraints, becoming unscalable for large-scale trading. In addition, there may be market failure since selfish users will not truthfully report their actual valuations and quantities for buying or selling resources. To address these two key challenges, we first investigate the distributed resource allocation problem with D2D assignment constraints. Based on the greedy idea of maximum weighted matching, we propose a fast algorithm to achieve near-optimal average allocative efficiency. Then, we combine it with a new pricing mechanism that adjusts the final trading prices for buying and selling resources in a way that buyers and sellers are incentivized to truthfully report their valuations and available resource quantities. Unlike traditional double auctions with a central controller, this pricing mechanism is fully distributed in the sense that the final trading prices between each matched pair of users only depend on their own declarations and hence can be calculated locally. Finally, we analyze the repeated execution of the proposed D2D trading mechanism in multiple rounds and determine the best trading frequency.","PeriodicalId":122577,"journal":{"name":"Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130433758","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}

引用次数: 5

Learning to price vehicle service with unknown demand 学会对需求未知的车辆服务进行定价

Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing Pub Date : 2020-07-07 DOI: 10.1145/3397166.3409129

Haoran Yu, Ermin Wei, R. Berry

{"title":"Learning to price vehicle service with unknown demand","authors":"Haoran Yu, Ermin Wei, R. Berry","doi":"10.1145/3397166.3409129","DOIUrl":"https://doi.org/10.1145/3397166.3409129","url":null,"abstract":"It can be profitable for vehicle service providers to set service prices based on users' travel demand on different origin-destination pairs. Prior studies on the spatial pricing of vehicle service rely on the assumption that providers know users' demand. In this paper, we study a monopolistic provider who initially does not know users' demand and needs to learn it over time by observing the users' responses to the service prices. We design a pricing and vehicle supply policy, considering the tradeoff between exploration (i.e., learning the demand) and exploitation (i.e., maximizing the provider's short-term payoff). Considering that the provider needs to ensure the vehicle flow balance at each location, its pricing and supply decisions for different origin-destination pairs are tightly coupled. This makes it challenging to theoretically analyze the performance of our policy. We analyze the gap between the provider's expected time-average payoffs under our policy and a clairvoyant policy, which makes decisions based on complete information of the demand. We prove that after running our policy for D days, the loss in the expected time-average payoff can be at most O((ln D)1/2D−1/4), which decays to zero as D approaches infinity.","PeriodicalId":122577,"journal":{"name":"Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133971395","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