Pub Date : 2022-10-31DOI: 10.23919/CNSM55787.2022.9965033
Farhana Javed, J. Mangues‐Bafalluy
With their transparency and smart contract features, blockchain and Distributed Ledger Technologies (DLT) can pave the way toward a decentralized marketplace for multi-administrative domains. An open and decentralized marketplace can aid 6G use cases such as inter-provider agreements, where multi-administrative domains can lease or buy resources to meet the needs of consumers. These agreements between multi-administrative domains can be performed using blockchain, increasing trust and transparency for Service Level Agreement (SLA) management, penalty, or billing. In this demonstration, we present the use of the Ethereum smart contract for a use case where the consumer can buy resources from a provider. However, Ethereum suffers from high transaction costs and latency; therefore, we aim to leverage IOTA Tangle to reduce the cost of transactions on the Ethereum blockchain and minimize the latency. In particular, we show the process of domains registered on an Ethereum blockchain network, consumers selecting a service from the list of available services to buy, and finally, transferring the agreed amount after the services are delivered.
{"title":"Demo: Blockchain-based Inter-Provider Agreements for 6G Networks","authors":"Farhana Javed, J. Mangues‐Bafalluy","doi":"10.23919/CNSM55787.2022.9965033","DOIUrl":"https://doi.org/10.23919/CNSM55787.2022.9965033","url":null,"abstract":"With their transparency and smart contract features, blockchain and Distributed Ledger Technologies (DLT) can pave the way toward a decentralized marketplace for multi-administrative domains. An open and decentralized marketplace can aid 6G use cases such as inter-provider agreements, where multi-administrative domains can lease or buy resources to meet the needs of consumers. These agreements between multi-administrative domains can be performed using blockchain, increasing trust and transparency for Service Level Agreement (SLA) management, penalty, or billing. In this demonstration, we present the use of the Ethereum smart contract for a use case where the consumer can buy resources from a provider. However, Ethereum suffers from high transaction costs and latency; therefore, we aim to leverage IOTA Tangle to reduce the cost of transactions on the Ethereum blockchain and minimize the latency. In particular, we show the process of domains registered on an Ethereum blockchain network, consumers selecting a service from the list of available services to buy, and finally, transferring the agreed amount after the services are delivered.","PeriodicalId":232521,"journal":{"name":"2022 18th International Conference on Network and Service Management (CNSM)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127491898","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 : 2022-10-31DOI: 10.23919/CNSM55787.2022.9964912
M. Kuran, Oguz Kaan Koksal, Melih Kılıç, Ahmet Uğur İlter, Gökçe Ekin Nehas, Sadık Öztürk
In this paper, we propose a cloud-assisted dynamic channel assignment system for WiFi mesh networks considering both the 2.4 GHz and 5 GHz interfaces to increase the overall performance and user experience in the WiFi network. Our solution utilizes periodic interference level measurements by the access points (AP) in all possible channels via conducting clear channel assessments. These measurements are sent to and processed by a cloud component with a forecasting module that predicts the state of each applicable channel in the near future. Finally, a channel change decision is sent to each AP if there is a better channel than its operating channel in the near future.We have conducted numerous field trials for a good selection of the various key parameters of the system with both the overall system’s performance and impact over time-sensitive critical applications such as real-time applications in mind. We have also conducted a field trial of our proposed system over a large real-life population of fifty thousand APs and compared its performance against the widely deployed Least Congested Channel Search (LCCS) mechanism. Our results show that not only our mechanism outperforms LCCS in terms of operating channel interference level but achieves this goal with much less number of channel changes yielding a much less disruptive user experience.
{"title":"Forecasting-based Cloud-assisted Dynamic Channel Assignment Mechanism for Mesh WiFi Networks","authors":"M. Kuran, Oguz Kaan Koksal, Melih Kılıç, Ahmet Uğur İlter, Gökçe Ekin Nehas, Sadık Öztürk","doi":"10.23919/CNSM55787.2022.9964912","DOIUrl":"https://doi.org/10.23919/CNSM55787.2022.9964912","url":null,"abstract":"In this paper, we propose a cloud-assisted dynamic channel assignment system for WiFi mesh networks considering both the 2.4 GHz and 5 GHz interfaces to increase the overall performance and user experience in the WiFi network. Our solution utilizes periodic interference level measurements by the access points (AP) in all possible channels via conducting clear channel assessments. These measurements are sent to and processed by a cloud component with a forecasting module that predicts the state of each applicable channel in the near future. Finally, a channel change decision is sent to each AP if there is a better channel than its operating channel in the near future.We have conducted numerous field trials for a good selection of the various key parameters of the system with both the overall system’s performance and impact over time-sensitive critical applications such as real-time applications in mind. We have also conducted a field trial of our proposed system over a large real-life population of fifty thousand APs and compared its performance against the widely deployed Least Congested Channel Search (LCCS) mechanism. Our results show that not only our mechanism outperforms LCCS in terms of operating channel interference level but achieves this goal with much less number of channel changes yielding a much less disruptive user experience.","PeriodicalId":232521,"journal":{"name":"2022 18th International Conference on Network and Service Management (CNSM)","volume":"256 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117347647","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 : 2022-10-31DOI: 10.23919/CNSM55787.2022.9964681
Onur Kalinagac, Wissem Soussi, Gürkan Gür
In this work, we present Graph Based Liability Analysis Framework (GRALAF) for root cause analysis (RCA) of the microservices. In this Proof-of-Concept (PoC) tool, we keep track of the performance metrics of microservices, such as service response time and CPU level values, to detect anomalies. By injecting faults in the services, we construct a Causal Bayesian Network (CBN) which represents the relation between service faults and metrics. The constructed CBN is used to predict the fault probability of services under given metrics which are assigned discrete values according to their anomaly states.
{"title":"Graph Based Liability Analysis for the Microservice Architecture","authors":"Onur Kalinagac, Wissem Soussi, Gürkan Gür","doi":"10.23919/CNSM55787.2022.9964681","DOIUrl":"https://doi.org/10.23919/CNSM55787.2022.9964681","url":null,"abstract":"In this work, we present Graph Based Liability Analysis Framework (GRALAF) for root cause analysis (RCA) of the microservices. In this Proof-of-Concept (PoC) tool, we keep track of the performance metrics of microservices, such as service response time and CPU level values, to detect anomalies. By injecting faults in the services, we construct a Causal Bayesian Network (CBN) which represents the relation between service faults and metrics. The constructed CBN is used to predict the fault probability of services under given metrics which are assigned discrete values according to their anomaly states.","PeriodicalId":232521,"journal":{"name":"2022 18th International Conference on Network and Service Management (CNSM)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125621874","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 : 2022-10-31DOI: 10.23919/CNSM55787.2022.9964993
M. Al-Naday, Tom Goethals, B. Volckaert
The cloud native paradigm is emerging as a pathway to developing applications for intrinsic operation on the cloud. This prompted application modularity, leveraging the adoption of the microservices architecture. Meanwhile, fog computing is emerging as a geo-dispersed cloud, bringing services closer to the end-user for localization and improved responsiveness. Transitioning to fog-native applications, i.e. managing microservice workflows over the fog, is a non-trivial challenge. On one hand, engineering workflows require awareness of the dependencies across microservices, as they impact the perceived quality of service. On the other hand, the heterogeneity of capacities, energy prices and supply, introduce challenges that can negate the sought advantages of the fog. This work proposes a novel algorithm based on Alternating Direction Method of Multipliers for intent-based workflow mapping and admission, iADMM. The performance of the algorithm is evaluated analytically and experimentally and compared to a baseline compute-network cost minimization alternative. Evaluation results show that iADMM achieves near optimal decisions in minimizing operational costs without violating workflow intents.
{"title":"Intent-based Decentralized Orchestration for Green Energy-aware Provisioning of Fog-native Workflows","authors":"M. Al-Naday, Tom Goethals, B. Volckaert","doi":"10.23919/CNSM55787.2022.9964993","DOIUrl":"https://doi.org/10.23919/CNSM55787.2022.9964993","url":null,"abstract":"The cloud native paradigm is emerging as a pathway to developing applications for intrinsic operation on the cloud. This prompted application modularity, leveraging the adoption of the microservices architecture. Meanwhile, fog computing is emerging as a geo-dispersed cloud, bringing services closer to the end-user for localization and improved responsiveness. Transitioning to fog-native applications, i.e. managing microservice workflows over the fog, is a non-trivial challenge. On one hand, engineering workflows require awareness of the dependencies across microservices, as they impact the perceived quality of service. On the other hand, the heterogeneity of capacities, energy prices and supply, introduce challenges that can negate the sought advantages of the fog. This work proposes a novel algorithm based on Alternating Direction Method of Multipliers for intent-based workflow mapping and admission, iADMM. The performance of the algorithm is evaluated analytically and experimentally and compared to a baseline compute-network cost minimization alternative. Evaluation results show that iADMM achieves near optimal decisions in minimizing operational costs without violating workflow intents.","PeriodicalId":232521,"journal":{"name":"2022 18th International Conference on Network and Service Management (CNSM)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115225155","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 : 2022-10-31DOI: 10.23919/CNSM55787.2022.9964580
Shivank Thapa, S. Sahoo, Moumita Patra, Arobinda Gupta
Vehicular ad-hoc networks formed in an Internet of Vehicles scenario can enable many useful applications and services. Many of these applications may generate a large amount of data, which needs to be processed within some deadline to be useful. Limited resources present in vehicles may not be sufficient for processing such data. The resources present in Road Side Units (RSUs) can be used for this purpose by running Virtual Machines (VMs) there on behalf of the vehicles. However, RSUs can also become overloaded in a dense vehicular scenario if all vehicles use the services of their nearby RSUs only. Also, use of RSUs may incur a cost. Hence the combined total resources of the RSUs need to be carefully managed to ensure that a large number of VMs complete within their deadline while incurring a lower cost. In this paper, we propose an algorithm called Cost Aware Load Balancing (CALB) algorithm that assigns and executes VMs in different RSUs in the total RSU pool. The proposed algorithm aims to maximize the number of VMs that complete execution within their deadline and also attempts to minimize the overall cost incurred by VMs for using RSUs’ resources. Performance of CALB is compared with several existing algorithms to show that it works better than the existing algorithms with respect to several performance metrics.
{"title":"A Novel Cost-Aware Load Balancing Algorithm for Road Side Units in Internet of Vehicles","authors":"Shivank Thapa, S. Sahoo, Moumita Patra, Arobinda Gupta","doi":"10.23919/CNSM55787.2022.9964580","DOIUrl":"https://doi.org/10.23919/CNSM55787.2022.9964580","url":null,"abstract":"Vehicular ad-hoc networks formed in an Internet of Vehicles scenario can enable many useful applications and services. Many of these applications may generate a large amount of data, which needs to be processed within some deadline to be useful. Limited resources present in vehicles may not be sufficient for processing such data. The resources present in Road Side Units (RSUs) can be used for this purpose by running Virtual Machines (VMs) there on behalf of the vehicles. However, RSUs can also become overloaded in a dense vehicular scenario if all vehicles use the services of their nearby RSUs only. Also, use of RSUs may incur a cost. Hence the combined total resources of the RSUs need to be carefully managed to ensure that a large number of VMs complete within their deadline while incurring a lower cost. In this paper, we propose an algorithm called Cost Aware Load Balancing (CALB) algorithm that assigns and executes VMs in different RSUs in the total RSU pool. The proposed algorithm aims to maximize the number of VMs that complete execution within their deadline and also attempts to minimize the overall cost incurred by VMs for using RSUs’ resources. Performance of CALB is compared with several existing algorithms to show that it works better than the existing algorithms with respect to several performance metrics.","PeriodicalId":232521,"journal":{"name":"2022 18th International Conference on Network and Service Management (CNSM)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133219316","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 : 2022-10-08DOI: 10.23919/CNSM55787.2022.9965074
Forough Shahab Samani, R. Stadler
We present a framework that lets a service provider achieve end-to-end management objectives under varying load. Dynamic control actions are performed by a reinforcement learning (RL) agent. Our work includes experimentation and evaluation on a laboratory testbed where we have implemented basic information services on a service mesh supported by the Istio and Kubernetes platforms. We investigate different management objectives that include end-to-end delay bounds on service requests, throughput objectives, and service differentiation. These objectives are mapped onto reward functions that an RL agent learns to optimize, by executing control actions, namely, request routing and request blocking. We compute the control policies not on the testbed, but in a simulator, which speeds up the learning process by orders of magnitude. In our approach, the system model is learned on the testbed; it is then used to instantiate the simulator, which produces near-optimal control policies for various management objectives. The learned policies are then evaluated on the testbed using unseen load patterns.
{"title":"Dynamically meeting performance objectives for multiple services on a service mesh","authors":"Forough Shahab Samani, R. Stadler","doi":"10.23919/CNSM55787.2022.9965074","DOIUrl":"https://doi.org/10.23919/CNSM55787.2022.9965074","url":null,"abstract":"We present a framework that lets a service provider achieve end-to-end management objectives under varying load. Dynamic control actions are performed by a reinforcement learning (RL) agent. Our work includes experimentation and evaluation on a laboratory testbed where we have implemented basic information services on a service mesh supported by the Istio and Kubernetes platforms. We investigate different management objectives that include end-to-end delay bounds on service requests, throughput objectives, and service differentiation. These objectives are mapped onto reward functions that an RL agent learns to optimize, by executing control actions, namely, request routing and request blocking. We compute the control policies not on the testbed, but in a simulator, which speeds up the learning process by orders of magnitude. In our approach, the system model is learned on the testbed; it is then used to instantiate the simulator, which produces near-optimal control policies for various management objectives. The learned policies are then evaluated on the testbed using unseen load patterns.","PeriodicalId":232521,"journal":{"name":"2022 18th International Conference on Network and Service Management (CNSM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125577839","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 : 2022-09-24DOI: 10.23919/CNSM55787.2022.9964638
M. Y. Naghmouchi, Shoushou Ren, P. Medagliani, S. Martin, Jérémie Leguay, Huawei Technologies
With 5G networking, deterministic guarantees are emerging as a key enabler. In this context, we present a scalable Damper-based architecture for Large-scale Deterministic IP Networks (D-LDN) that meets required bounds on end-to-end delay and jitter. This work extends the original LDN [1] architecture, where flows are shaped at ingress gateways and scheduled for transmission at each link using an asynchronous and cyclic opening of gate-controlled queues. To further relax the need for clock synchronization between devices, we use dampers, that consist in jitter regulators, to control the burstiness flows to provide a constant target delay at each hop. We introduce in details how data plane functionalities are implemented at all nodes (gateways and core) and we derive how the end-to-end delay and jitter are calculated. For the control plane, we propose a column generation algorithm to quickly take admission control decisions and maximize the accepted throughput. For a set of flows, it determines acceptance and selects the best shaping and routing policy. Through a proof-of-concept implementation in simulation, we verify that the architecture meets promised guarantees and that the control plane can operate efficiently at large-scale.
{"title":"Scalable Damper-based Deterministic Networking","authors":"M. Y. Naghmouchi, Shoushou Ren, P. Medagliani, S. Martin, Jérémie Leguay, Huawei Technologies","doi":"10.23919/CNSM55787.2022.9964638","DOIUrl":"https://doi.org/10.23919/CNSM55787.2022.9964638","url":null,"abstract":"With 5G networking, deterministic guarantees are emerging as a key enabler. In this context, we present a scalable Damper-based architecture for Large-scale Deterministic IP Networks (D-LDN) that meets required bounds on end-to-end delay and jitter. This work extends the original LDN [1] architecture, where flows are shaped at ingress gateways and scheduled for transmission at each link using an asynchronous and cyclic opening of gate-controlled queues. To further relax the need for clock synchronization between devices, we use dampers, that consist in jitter regulators, to control the burstiness flows to provide a constant target delay at each hop. We introduce in details how data plane functionalities are implemented at all nodes (gateways and core) and we derive how the end-to-end delay and jitter are calculated. For the control plane, we propose a column generation algorithm to quickly take admission control decisions and maximize the accepted throughput. For a set of flows, it determines acceptance and selects the best shaping and routing policy. Through a proof-of-concept implementation in simulation, we verify that the architecture meets promised guarantees and that the control plane can operate efficiently at large-scale.","PeriodicalId":232521,"journal":{"name":"2022 18th International Conference on Network and Service Management (CNSM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128783677","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 : 2022-09-21DOI: 10.23919/CNSM55787.2022.9964923
Krzysztof Rusek, Paul Almasan, José Suárez-Varela, P. Chołda, P. Barlet-Ros, A. Cabellos-Aparicio
Emerging applications such as the metaverse, telesurgery or cloud computing require increasingly complex operational demands on networks (e.g., ultra-reliable low latency). Likewise, the ever-faster traffic dynamics will demand network control mechanisms that can operate at short timescales (e.g., sub-minute). In this context, Traffic Engineering (TE) is a key component to efficiently control network traffic according to some performance goals (e.g., minimize network congestion).This paper presents Routing By Backprop (RBB), a novel TE method based on Graph Neural Networks (GNN) and differentiable programming. Thanks to its internal GNN model, RBB builds an end-to-end differentiable function of the target TE problem (MinMaxLoad). This enables fast TE optimization via gradient descent. In our evaluation, we show the potential of RBB to optimize OSPF-based routing (≈25% of improvement with respect to default OSPF configurations). Moreover, we test the potential of RBB as an initializer of computationally-intensive TE solvers. The experimental results show promising prospects for accelerating this type of solvers and achieving efficient online TE optimization.
新兴的应用，如元宇宙、远程手术或云计算，对网络的操作要求越来越复杂(例如，超可靠的低延迟)。同样，越来越快的流量动态将要求网络控制机制能够在短时间尺度(例如，分分钟)内运行。在这种情况下，流量工程(TE)是根据某些性能目标(例如，最小化网络拥塞)有效控制网络流量的关键组件。本文提出了一种基于图神经网络(GNN)和可微规划的路由回溯算法(Routing By Backprop, RBB)。由于其内部GNN模型，RBB构建了目标TE问题(MinMaxLoad)的端到端可微函数。这可以通过梯度下降实现快速TE优化。在我们的评估中，我们展示了RBB优化基于OSPF路由的潜力(相对于缺省OSPF配置的改进≈25%)。此外，我们测试了RBB作为计算密集型TE求解器的初始化器的潜力。实验结果表明，该算法在加速求解和实现高效在线TE优化方面具有广阔的应用前景。
{"title":"Fast Traffic Engineering by Gradient Descent with Learned Differentiable Routing","authors":"Krzysztof Rusek, Paul Almasan, José Suárez-Varela, P. Chołda, P. Barlet-Ros, A. Cabellos-Aparicio","doi":"10.23919/CNSM55787.2022.9964923","DOIUrl":"https://doi.org/10.23919/CNSM55787.2022.9964923","url":null,"abstract":"Emerging applications such as the metaverse, telesurgery or cloud computing require increasingly complex operational demands on networks (e.g., ultra-reliable low latency). Likewise, the ever-faster traffic dynamics will demand network control mechanisms that can operate at short timescales (e.g., sub-minute). In this context, Traffic Engineering (TE) is a key component to efficiently control network traffic according to some performance goals (e.g., minimize network congestion).This paper presents Routing By Backprop (RBB), a novel TE method based on Graph Neural Networks (GNN) and differentiable programming. Thanks to its internal GNN model, RBB builds an end-to-end differentiable function of the target TE problem (MinMaxLoad). This enables fast TE optimization via gradient descent. In our evaluation, we show the potential of RBB to optimize OSPF-based routing (≈25% of improvement with respect to default OSPF configurations). Moreover, we test the potential of RBB as an initializer of computationally-intensive TE solvers. The experimental results show promising prospects for accelerating this type of solvers and achieving efficient online TE optimization.","PeriodicalId":232521,"journal":{"name":"2022 18th International Conference on Network and Service Management (CNSM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120973569","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
扫码关注我们
求助内容：
应助结果提醒方式：