David C. Harrison, Winston K.G. Seah, Hang Yu, R. Rayudu
Wireless sensor networks for rarely occurring critical events must maintain sensing coverage and low latency network connectivity to ensure event detection and subsequent rapid propagation of notification messages. Existing geographic forwarding algorithms have proved successful in providing energy efficient network connectivity for arbitrary topologies where sensing coverage is not guaranteed. This paper proposes a location aware algorithm for Swift Opportunistic Forwarding of Infrequent Events (SOFIE) that takes advantage of geometric properties common to sensing networks providing perfect area coverage. The algorithm is shown to deliver more rapid message propagation than two established, general purpose geographic forwarding algorithm in optimally and randomly placed networks of varied sensing node density. Further, the algorithm is shown to maintain this advantage when deployed in a coverage preserving, duty-cycled sensing network where nodes may power down whilst the network is actively forwarding event notification messages.
{"title":"Opportunistic Geographic Forwarding in Wireless Sensor Networks for Critical Rare Events","authors":"David C. Harrison, Winston K.G. Seah, Hang Yu, R. Rayudu","doi":"10.1109/LCN.2016.46","DOIUrl":"https://doi.org/10.1109/LCN.2016.46","url":null,"abstract":"Wireless sensor networks for rarely occurring critical events must maintain sensing coverage and low latency network connectivity to ensure event detection and subsequent rapid propagation of notification messages. Existing geographic forwarding algorithms have proved successful in providing energy efficient network connectivity for arbitrary topologies where sensing coverage is not guaranteed. This paper proposes a location aware algorithm for Swift Opportunistic Forwarding of Infrequent Events (SOFIE) that takes advantage of geometric properties common to sensing networks providing perfect area coverage. The algorithm is shown to deliver more rapid message propagation than two established, general purpose geographic forwarding algorithm in optimally and randomly placed networks of varied sensing node density. Further, the algorithm is shown to maintain this advantage when deployed in a coverage preserving, duty-cycled sensing network where nodes may power down whilst the network is actively forwarding event notification messages.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"18 1","pages":"216-219"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89388497","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}
M. Rathore, Anand Paul, Awais Ahmad, M. Imran, M. Guizani
Internet service providers (ISPs) and telecommunication authorities are interested in detecting VoIP calls either to block illegal commercial VoIP or prioritize the paid users VoIP calls. Signature-based, port-based, and pattern-based VoIP detection techniques are not more accurate and not efficient due to complex security and tunneling mechanisms used by VoIP. Therefore, in this paper, we propose a rule-based generic, robust, and efficient statistical analysis-based solution to identify encrypted, non-encrypted, or tunneled VoIP media (voice) flows using threshold approach. In addition, a system is proposed to efficiently process high-speed real-time network traffic. The accuracy and efficiency evaluation results and the comparative study show that the proposed system outperforms the existing systems with the ability to work in real-time and high-speed Big Data environment.
{"title":"High-Speed Network Traffic Analysis: Detecting VoIP Calls in Secure Big Data Streaming","authors":"M. Rathore, Anand Paul, Awais Ahmad, M. Imran, M. Guizani","doi":"10.1109/LCN.2016.128","DOIUrl":"https://doi.org/10.1109/LCN.2016.128","url":null,"abstract":"Internet service providers (ISPs) and telecommunication authorities are interested in detecting VoIP calls either to block illegal commercial VoIP or prioritize the paid users VoIP calls. Signature-based, port-based, and pattern-based VoIP detection techniques are not more accurate and not efficient due to complex security and tunneling mechanisms used by VoIP. Therefore, in this paper, we propose a rule-based generic, robust, and efficient statistical analysis-based solution to identify encrypted, non-encrypted, or tunneled VoIP media (voice) flows using threshold approach. In addition, a system is proposed to efficiently process high-speed real-time network traffic. The accuracy and efficiency evaluation results and the comparative study show that the proposed system outperforms the existing systems with the ability to work in real-time and high-speed Big Data environment.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"6 1","pages":"595-598"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85852089","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}
In the past, several proposals to support fast handover in wireless mesh networks have been published. However, most handover extensions are only concerned with moving stations that are unaware of the used routing protocol and assume relatively stationary routing nodes. In this paper we propose an extension to the BATMAN routing protocol to support seamless handover of routing nodes in infrastructure wireless mesh networks. We implement the new extension in our wireless mesh testbed and evaluate its performance in comparison to a standard WLAN handover followed by a route reestablishment using BATMAN. The evaluation shows that route reestablishment is more than 40 times faster with our extension when compared to standard BATMAN.
{"title":"B. A. T. M. A. N. Handover Extension for Routing Nodes in Infrastructure WMNs","authors":"Patrick Herrmann, Ulrike Meyer","doi":"10.1109/LCN.2016.118","DOIUrl":"https://doi.org/10.1109/LCN.2016.118","url":null,"abstract":"In the past, several proposals to support fast handover in wireless mesh networks have been published. However, most handover extensions are only concerned with moving stations that are unaware of the used routing protocol and assume relatively stationary routing nodes. In this paper we propose an extension to the BATMAN routing protocol to support seamless handover of routing nodes in infrastructure wireless mesh networks. We implement the new extension in our wireless mesh testbed and evaluate its performance in comparison to a standard WLAN handover followed by a route reestablishment using BATMAN. The evaluation shows that route reestablishment is more than 40 times faster with our extension when compared to standard BATMAN.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"34 1","pages":"680-687"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86483774","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}
Motivated by the computational, bandwidth and energy restrictions of wireless sensor network nodes and their need to, collectively, determine the presence of exogenous interference that could impair their communication, we consider schemes that could support the task of interference classification as a first step towards interference mitigation strategies. In particular, we examine the effectiveness of the Discrete Wavelet Transform (DWT) to communicate to other nodes the state of the channel, as sampled by a node, in a compressed, denoised form. We examine the suitability of different wavelet filters and thresholding methods in order to: (a) preserve key features of the interference, (b) denoise the noisy interference samples, and (c) reduce the amount of information that needs to be communicated to describe the interference.
{"title":"Wavelet-Based Analysis of Interference in WSNs","authors":"Aikaterini Vlachaki, I. Nikolaidis, J. Harms","doi":"10.1109/LCN.2016.127","DOIUrl":"https://doi.org/10.1109/LCN.2016.127","url":null,"abstract":"Motivated by the computational, bandwidth and energy restrictions of wireless sensor network nodes and their need to, collectively, determine the presence of exogenous interference that could impair their communication, we consider schemes that could support the task of interference classification as a first step towards interference mitigation strategies. In particular, we examine the effectiveness of the Discrete Wavelet Transform (DWT) to communicate to other nodes the state of the channel, as sampled by a node, in a compressed, denoised form. We examine the suitability of different wavelet filters and thresholding methods in order to: (a) preserve key features of the interference, (b) denoise the noisy interference samples, and (c) reduce the amount of information that needs to be communicated to describe the interference.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"30 1","pages":"639-642"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72962450","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}
BGP measurement is important for monitoring and understanding the Internet anomalies. Most of the previous works on BGP measurement rely on aggregated statistics from BGP monitors, e.g., total updates. However, BGP events may have quite limited visibility. Therefore, merely investigating aggregated data may lead to misunderstanding Internet instability, e.g., overestimating the impact of monitor-local events. In this empirical study, we demonstrate how BGP data are distributed among a large number of monitors. We define eleven features as the analysis targets, and three metrics to quantify disparity. We apply the method to 1.14 TB data and find that the distribution of most of the features is quite uneven, and different types of feature illustrate different levels of disparity. We also observe long periods of persistent high disparity, and a small set of cross-feature highly active monitors. Our analysis highlights the necessity of per-monitor data analysis in future BGP measurement study.
{"title":"A Measurement Study on the Distribution Disparity of BGP Instabilities","authors":"Meng Chen, Mingwei Xu, Yuan Yang, Qing Li","doi":"10.1109/LCN.2016.13","DOIUrl":"https://doi.org/10.1109/LCN.2016.13","url":null,"abstract":"BGP measurement is important for monitoring and understanding the Internet anomalies. Most of the previous works on BGP measurement rely on aggregated statistics from BGP monitors, e.g., total updates. However, BGP events may have quite limited visibility. Therefore, merely investigating aggregated data may lead to misunderstanding Internet instability, e.g., overestimating the impact of monitor-local events. In this empirical study, we demonstrate how BGP data are distributed among a large number of monitors. We define eleven features as the analysis targets, and three metrics to quantify disparity. We apply the method to 1.14 TB data and find that the distribution of most of the features is quite uneven, and different types of feature illustrate different levels of disparity. We also observe long periods of persistent high disparity, and a small set of cross-feature highly active monitors. Our analysis highlights the necessity of per-monitor data analysis in future BGP measurement study.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"38 1","pages":"19-27"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77351963","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}
Rafael Kunst, Leandro Avila, E. Pignaton, S. Bampi, Juergen Rochol
The current static model used for allocating the spectrum of frequencies and the increasing demand for network resources imposed by modern applications and services may lead to a resources scarcity problem. Dealing with this problem demands optimized resources allocation. An alternative to provide this optimization is by allowing resources sharing among network operators. In this paper, an architecture is presented to encourage network operators to share their underutilized resources. A multilevel broker is proposed to control the resources sharing. This broker dynamically establishes a service level agreement that takes into account the quality of service requirements of resources renters and the cost of the resources. A performance evaluation shows that the implementation of the proposed architectures leads to better allocation of underutilized network resources.
{"title":"A Resources Sharing Architecture for Heterogeneous Wireless Cellular Networks","authors":"Rafael Kunst, Leandro Avila, E. Pignaton, S. Bampi, Juergen Rochol","doi":"10.1109/LCN.2016.49","DOIUrl":"https://doi.org/10.1109/LCN.2016.49","url":null,"abstract":"The current static model used for allocating the spectrum of frequencies and the increasing demand for network resources imposed by modern applications and services may lead to a resources scarcity problem. Dealing with this problem demands optimized resources allocation. An alternative to provide this optimization is by allowing resources sharing among network operators. In this paper, an architecture is presented to encourage network operators to share their underutilized resources. A multilevel broker is proposed to control the resources sharing. This broker dynamically establishes a service level agreement that takes into account the quality of service requirements of resources renters and the cost of the resources. A performance evaluation shows that the implementation of the proposed architectures leads to better allocation of underutilized network resources.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"205 1","pages":"228-231"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77046571","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}
Wavelength division multiplexed optical networks have become an attractive candidate to meet the ever-growing traffic demands in cloud data centers due to the features of large capacity and dynamic reconfiguration capability. While the bandwidth does not affect the makespan of compute-intensive and content-delivery-network applications, it has an impact on data-intensive applications that therefore require guaranteed bandwidth beside computing and storage resources for predictable performance. Motivated by this, we consider the problem of dynamically adjusting bandwidth so as to increase the acceptance of virtual networks embedded in optical data centers. We first develop an optimization programming formulation for the problem. We then develop a heuristic algorithm that efficiently embeds and adaptively allocates bandwidth to virtual networks such that the applications complete and release resources for future requests. We evaluate our algorithm through extensive simulations. The results show that our algorithm outperforms baseline algorithms by reducing rejections by up to 25%.
{"title":"Adaptive Bandwidth Allocation for Virtual Network Embedding in Optical Data Center Networks","authors":"Swarnalatha Madanantha, Tram Truong Huu, G. Mohan","doi":"10.1109/LCN.2016.59","DOIUrl":"https://doi.org/10.1109/LCN.2016.59","url":null,"abstract":"Wavelength division multiplexed optical networks have become an attractive candidate to meet the ever-growing traffic demands in cloud data centers due to the features of large capacity and dynamic reconfiguration capability. While the bandwidth does not affect the makespan of compute-intensive and content-delivery-network applications, it has an impact on data-intensive applications that therefore require guaranteed bandwidth beside computing and storage resources for predictable performance. Motivated by this, we consider the problem of dynamically adjusting bandwidth so as to increase the acceptance of virtual networks embedded in optical data centers. We first develop an optimization programming formulation for the problem. We then develop a heuristic algorithm that efficiently embeds and adaptively allocates bandwidth to virtual networks such that the applications complete and release resources for future requests. We evaluate our algorithm through extensive simulations. The results show that our algorithm outperforms baseline algorithms by reducing rejections by up to 25%.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"515 1","pages":"316-324"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77098531","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}
Nowadays, collaborative applications play an increasing role in mobile communications in order to enable cooperation among mobile and/or stationary participants – often using the peer-to-peer (P2P) group communication paradigm. The probability of communication failures increases in mobile environments. As a consequence, frequent leaving and joining of partners can be observed resulting in unstable group topologies. A widely used approach is to divide the group into peer clusters that are fully meshed among each other. In this paper, we propose an application-independent approach for a periodic maintenance of distributed cluster-based group topologies for mobile collaborative applications. The proposed approach also dynamically adapts the overlay structure to changing network conditions. The maintenance strategy can be parametrized by several metrics. It outperforms simple overlay maintenance strategies, such as round-robin, by respecting the resource and computation limitations of mobile devices. The run-time is increased by 10% in the best case compared to LEACH, and by 3 — 5% on average. We describe the approach and evaluate its performance w.r.t. different metrics.
{"title":"Distributed Cluster-Topology Maintenance for Mobile Collaborative Applications","authors":"Jan Gäbler, H. König","doi":"10.1109/LCN.2016.55","DOIUrl":"https://doi.org/10.1109/LCN.2016.55","url":null,"abstract":"Nowadays, collaborative applications play an increasing role in mobile communications in order to enable cooperation among mobile and/or stationary participants – often using the peer-to-peer (P2P) group communication paradigm. The probability of communication failures increases in mobile environments. As a consequence, frequent leaving and joining of partners can be observed resulting in unstable group topologies. A widely used approach is to divide the group into peer clusters that are fully meshed among each other. In this paper, we propose an application-independent approach for a periodic maintenance of distributed cluster-based group topologies for mobile collaborative applications. The proposed approach also dynamically adapts the overlay structure to changing network conditions. The maintenance strategy can be parametrized by several metrics. It outperforms simple overlay maintenance strategies, such as round-robin, by respecting the resource and computation limitations of mobile devices. The run-time is increased by 10% in the best case compared to LEACH, and by 3 — 5% on average. We describe the approach and evaluate its performance w.r.t. different metrics.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"76 1","pages":"271-279"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83828298","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}
Ensuring network interoperability when IEEE 802.11s-based NAN and LTE-based WAN is deployed for Smart Grid (SG) Advanced Metering Infrastructure (AMI) poses significant challenges. Besides the QoS mismatch between networks, LTE tunneling mechanism becomes an issue when forwarding downlink traffic to IEEE 802.11s network since the gateway of these networks is supposed to be the end device in LTE setup. Yet, inherent security/privacy overhead in SG traffic makes it even more challenging. To address these issues, a novel UE access list is proposed for LTE network to enable the downlink traffic identification to IEEE 802.11s network and accordingly selects the corresponding gateway. For the QoS mismatch, Dual-Queues (DQs) for each Access Category of the underlying MAC protocol, namely Enhanced Distributed Channel Access (EDCA) in IEEE 802.11s network is proposed. By using ns-3 network simulator, extensive performance evaluations under heavy security overhead are conducted to assess the performance of the proposed mechanisms.
{"title":"Addressing Network Interoperability in Hybrid IEEE 802.11s/LTE Smart Grid Communications","authors":"Nico Saputro, K. Akkaya, Samet Tonyali","doi":"10.1109/LCN.2016.107","DOIUrl":"https://doi.org/10.1109/LCN.2016.107","url":null,"abstract":"Ensuring network interoperability when IEEE 802.11s-based NAN and LTE-based WAN is deployed for Smart Grid (SG) Advanced Metering Infrastructure (AMI) poses significant challenges. Besides the QoS mismatch between networks, LTE tunneling mechanism becomes an issue when forwarding downlink traffic to IEEE 802.11s network since the gateway of these networks is supposed to be the end device in LTE setup. Yet, inherent security/privacy overhead in SG traffic makes it even more challenging. To address these issues, a novel UE access list is proposed for LTE network to enable the downlink traffic identification to IEEE 802.11s network and accordingly selects the corresponding gateway. For the QoS mismatch, Dual-Queues (DQs) for each Access Category of the underlying MAC protocol, namely Enhanced Distributed Channel Access (EDCA) in IEEE 802.11s network is proposed. By using ns-3 network simulator, extensive performance evaluations under heavy security overhead are conducted to assess the performance of the proposed mechanisms.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"14 1","pages":"623-626"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84370626","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}
This paper presents ESCAPE, an informed moving target defense mechanism for cloud containers. ESCAPE models the interaction between attackers and their target containers as a "predator searching for a prey" search game. Live migration of Linux-containers (prey) is used to avoid attacks (predator) and failures. The entire process is guided by a novel host-based behavior-monitoring system that seamlessly monitors containers for indications of intrusions and attacks. To evaluate ESCAPE effectiveness, we simulated the attack avoidance process based on a mathematical model mimicking the prey-vs-predator search game. Simulation results show high container survival probabilities with minimal added overhead.
{"title":"Toward Smart Moving Target Defense for Linux Container Resiliency","authors":"M. Azab, B. Mokhtar, A. S. Abed, M. Eltoweissy","doi":"10.1109/LCN.2016.106","DOIUrl":"https://doi.org/10.1109/LCN.2016.106","url":null,"abstract":"This paper presents ESCAPE, an informed moving target defense mechanism for cloud containers. ESCAPE models the interaction between attackers and their target containers as a \"predator searching for a prey\" search game. Live migration of Linux-containers (prey) is used to avoid attacks (predator) and failures. The entire process is guided by a novel host-based behavior-monitoring system that seamlessly monitors containers for indications of intrusions and attacks. To evaluate ESCAPE effectiveness, we simulated the attack avoidance process based on a mathematical model mimicking the prey-vs-predator search game. Simulation results show high container survival probabilities with minimal added overhead.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"7 1","pages":"619-622"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79116114","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
扫码关注我们
求助内容：
应助结果提醒方式：