Survivable RWA under dynamic traffic involves the setup and tear down of lightpaths dynamically at random times with the objective of reducing blocking rates. Moreover due to the QoS requirements, the RWA is not only required to utilize network resources efficiently during the setup of lightpaths for newly arriving demands, but it is also required not to interrupt lightpaths that are in progress. These constraints dictate the optimization of the RWA for each individual connection request separately as it arrives with the objective of allocating minimum bandwidth based on the network status at the time of the arrival. This paper proposes a new algorithm for shared protection RWA under dynamic traffic for wavelength-routed mesh network with no wavelength conversion. The algorithm is based on the iterative two step approach proposed for networks, with full wavelength conversion. Two wavelength assignment schemes were evaluated and the results are presented.
{"title":"Shared protection in wavelength-routed optical mesh networks under dynamic traffic and no wavelength conversion","authors":"A. Eshoul, H. Mouftah","doi":"10.1109/ICW.2005.73","DOIUrl":"https://doi.org/10.1109/ICW.2005.73","url":null,"abstract":"Survivable RWA under dynamic traffic involves the setup and tear down of lightpaths dynamically at random times with the objective of reducing blocking rates. Moreover due to the QoS requirements, the RWA is not only required to utilize network resources efficiently during the setup of lightpaths for newly arriving demands, but it is also required not to interrupt lightpaths that are in progress. These constraints dictate the optimization of the RWA for each individual connection request separately as it arrives with the objective of allocating minimum bandwidth based on the network status at the time of the arrival. This paper proposes a new algorithm for shared protection RWA under dynamic traffic for wavelength-routed mesh network with no wavelength conversion. The algorithm is based on the iterative two step approach proposed for networks, with full wavelength conversion. Two wavelength assignment schemes were evaluated and the results are presented.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125191721","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 introduces a novel approach to support local failure recovery in multicast trees. Although, the presented approach can be implemented in any large backbone network that employs multicast communication mode, we concentrate our discussion on MPLS networks. In the proposed approach, a multicast tree is divided into several domains where each domain represents a sub-tree of the original one. Backup paths are built between the root of the domain and each leaf router which is called a border router. Simulation results conducted on two network topologies show the performance of the proposed approach in terms of the total capacity required for reserving the backup paths and in terms of the maximum delay needed to notify about link/node failure. The results have shown that tree division approach compared with global recovery approach reduces the time needed to notify the router that is responsible for switching the traffic to the backup path.
{"title":"A tree division approach to support local failure recovery for multicasting in MPLS networks","authors":"O. Banimelhem, A. Agarwal, J. Atwood","doi":"10.1109/ICW.2005.19","DOIUrl":"https://doi.org/10.1109/ICW.2005.19","url":null,"abstract":"This paper introduces a novel approach to support local failure recovery in multicast trees. Although, the presented approach can be implemented in any large backbone network that employs multicast communication mode, we concentrate our discussion on MPLS networks. In the proposed approach, a multicast tree is divided into several domains where each domain represents a sub-tree of the original one. Backup paths are built between the root of the domain and each leaf router which is called a border router. Simulation results conducted on two network topologies show the performance of the proposed approach in terms of the total capacity required for reserving the backup paths and in terms of the maximum delay needed to notify about link/node failure. The results have shown that tree division approach compared with global recovery approach reduces the time needed to notify the router that is responsible for switching the traffic to the backup path.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"43 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120922977","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}
It is well known that mobility modeling plays an important role when assessing the performance of MANET protocols during a simulation test. This paper presents a tool to generate realistic mobility traces for MANET simulations. A new mobility model called AMADEOS was developed as an extension for the CANUMobisim framework. To model mobility for simulation environments, a new mobility model was created that takes into account obstacles. AMADEOS makes it easy and fast to automatically generate realistic mobility. It allows to edit spatial environments with polygonal obstacles to he used within simulations. It also allows to visualize an animation of the generated mobility traces. A new propagation model based on ray tracing was also implemented as part of AMADEOS.
{"title":"Advanced mobility models for ad hoc network simulations","authors":"Abdoul-Kader Harouna Souley, S. Cherkaoui","doi":"10.1109/ICW.2005.22","DOIUrl":"https://doi.org/10.1109/ICW.2005.22","url":null,"abstract":"It is well known that mobility modeling plays an important role when assessing the performance of MANET protocols during a simulation test. This paper presents a tool to generate realistic mobility traces for MANET simulations. A new mobility model called AMADEOS was developed as an extension for the CANUMobisim framework. To model mobility for simulation environments, a new mobility model was created that takes into account obstacles. AMADEOS makes it easy and fast to automatically generate realistic mobility. It allows to edit spatial environments with polygonal obstacles to he used within simulations. It also allows to visualize an animation of the generated mobility traces. A new propagation model based on ray tracing was also implemented as part of AMADEOS.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121216783","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}
Communications between vehicles constitute a Vehicular Ad hoc Network (VANET). Contrary to MANET in VANET nodes which are vehicles can move with high speed and generally must communicate quickly and reliably. When an accident occurs in a road or highway, alarm messages must be disseminated, instead of ad-hoc routed, to inform all other vehicles. To position a broken vehicle (or vehicle in danger) and locate the vehicles in its vicinity is very important for the safety of the road users. However, vehicles are not necessarily equipped with GPS and even they cannot obtain availability of line of sight access to satellites, particularly when they enter tunnels. In this paper, we propose an improvement to ODAM (optimized dissemination of alarm messages) protocol in order to support localization of GPS-unequipped vehicles. So, the number of vehicles discovering their localisation will be increased. This prevents pile-up of cars when fog, accidents or any other obstacle contributes to the driver safety. Analyses show that the optimal performances of ODAM can be reached even when the rate of GPS-unequipped vehicles is 40%
{"title":"Localization in Vehicular Ad Hoc Networks","authors":"A. Benslimane","doi":"10.1109/ICW.2005.54","DOIUrl":"https://doi.org/10.1109/ICW.2005.54","url":null,"abstract":"Communications between vehicles constitute a Vehicular Ad hoc Network (VANET). Contrary to MANET in VANET nodes which are vehicles can move with high speed and generally must communicate quickly and reliably. When an accident occurs in a road or highway, alarm messages must be disseminated, instead of ad-hoc routed, to inform all other vehicles. To position a broken vehicle (or vehicle in danger) and locate the vehicles in its vicinity is very important for the safety of the road users. However, vehicles are not necessarily equipped with GPS and even they cannot obtain availability of line of sight access to satellites, particularly when they enter tunnels. In this paper, we propose an improvement to ODAM (optimized dissemination of alarm messages) protocol in order to support localization of GPS-unequipped vehicles. So, the number of vehicles discovering their localisation will be increased. This prevents pile-up of cars when fog, accidents or any other obstacle contributes to the driver safety. Analyses show that the optimal performances of ODAM can be reached even when the rate of GPS-unequipped vehicles is 40%","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117009844","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}
The greatest current challenge in wireless sensor networks consists in building a completely adaptive network without fixed infrastructures and with the smallest energy resources. Applications built upon such networks are various: from telemetry to medical follow-up and from intrusion detection to infrastructure maintenance. Nevertheless, their design requires a large effort to guarantee quasi unlimited lifespan of the network with a minimum QoS (quality of service). In this work, we propose a radio interference model which is combined with a Markovian model of CSMA/CA and permits to estimate power consumption and packet success rate in an IEEE 802.15.4 network.
{"title":"QoS and energy consumption in wireless sensor networks using CSMA/CA","authors":"M. Achir, L. Ouvry","doi":"10.1109/ICW.2005.69","DOIUrl":"https://doi.org/10.1109/ICW.2005.69","url":null,"abstract":"The greatest current challenge in wireless sensor networks consists in building a completely adaptive network without fixed infrastructures and with the smallest energy resources. Applications built upon such networks are various: from telemetry to medical follow-up and from intrusion detection to infrastructure maintenance. Nevertheless, their design requires a large effort to guarantee quasi unlimited lifespan of the network with a minimum QoS (quality of service). In this work, we propose a radio interference model which is combined with a Markovian model of CSMA/CA and permits to estimate power consumption and packet success rate in an IEEE 802.15.4 network.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126210231","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}
The reliable execution of a mobile agent is a very important design issue to build a mobile agent system and many fault-tolerant schemes have been proposed. Hence, in this paper, we present FATOMAS, a java based fault-tolerant mobile agent system based on an algorithm presented in an earlier paper. In contrary to the standard "place-dependent" architectural approach, FATOMAS uses the novel agent-dependent approach introduced in the paper. In this approach, the protocol that provides fault tolerance travels with the agent. This has the important advantage to allow fault-tolerant mobile agent execution with out the need to modify the underlying mobile agent platform. We derive the FATOMAS (Fault-Tolerant Mobile Agent System) design which offers a user transparent fault tolerance that can be activated on request, according to the needs of the task, also discuss how transactional agent with types of commitment constraints can commit. Furthermore this paper proposes a solution for effective agent deployment using dynamic agent domains.
移动代理的可靠执行是构建移动代理系统的一个非常重要的设计问题，目前已经提出了许多容错方案。因此，在本文中，我们提出了基于java的容错移动代理系统FATOMAS，该系统基于先前论文中提出的算法。与标准的“位置相关”体系结构方法相反，FATOMAS使用了本文中介绍的新型代理相关方法。在这种方法中，提供容错的协议随代理一起传播。这有一个重要的优点，即允许在不修改底层移动代理平台的情况下执行容错移动代理。提出了一种容错移动代理系统(FATOMAS, fault - tolerant Mobile Agent System)的设计方案，该方案提供了一种用户透明的容错系统，可以根据任务的需要在请求时激活，并讨论了具有承诺约束类型的事务代理如何提交。在此基础上，提出了一种利用动态代理域实现有效的代理部署的解决方案。
{"title":"Modeling of fault-tolerant mobile agents execution in distributed systems","authors":"K. Mohammadi, H. Hamidi","doi":"10.1109/ICW.2005.57","DOIUrl":"https://doi.org/10.1109/ICW.2005.57","url":null,"abstract":"The reliable execution of a mobile agent is a very important design issue to build a mobile agent system and many fault-tolerant schemes have been proposed. Hence, in this paper, we present FATOMAS, a java based fault-tolerant mobile agent system based on an algorithm presented in an earlier paper. In contrary to the standard \"place-dependent\" architectural approach, FATOMAS uses the novel agent-dependent approach introduced in the paper. In this approach, the protocol that provides fault tolerance travels with the agent. This has the important advantage to allow fault-tolerant mobile agent execution with out the need to modify the underlying mobile agent platform. We derive the FATOMAS (Fault-Tolerant Mobile Agent System) design which offers a user transparent fault tolerance that can be activated on request, according to the needs of the task, also discuss how transactional agent with types of commitment constraints can commit. Furthermore this paper proposes a solution for effective agent deployment using dynamic agent domains.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128666082","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 describes the design and the implementation of the managed bandwidth service (MBS) in a high speed backbone network as well as a management tool for the service. The service was designed taking advantage of features provided by the MPLS technology and also using the DiffServ architecture. So, it uses L2 MPLS VPNs to provide point to point connection and also marks the traffic in order to pass from certain priority queues (to provide guaranteed bandwidth). It also enables traffic engineering characteristics in order to provide load balancing on the network as well as fast rerouting in case of link failure. In addition we implemented a management tool for the service. The scope of this tool is to allow the users to manage their MBS requests (make a new one, edit, delete or view a request). Also the tool performs admission control and produces the necessary configuration that must be applied on the network in order to implement every service's request. This service was designed and implemented on GRNET's network.
{"title":"Implementation issues of managed bandwidth service: the case of GRNET","authors":"C. Bouras, D. Primpas","doi":"10.1109/ICW.2005.51","DOIUrl":"https://doi.org/10.1109/ICW.2005.51","url":null,"abstract":"This paper describes the design and the implementation of the managed bandwidth service (MBS) in a high speed backbone network as well as a management tool for the service. The service was designed taking advantage of features provided by the MPLS technology and also using the DiffServ architecture. So, it uses L2 MPLS VPNs to provide point to point connection and also marks the traffic in order to pass from certain priority queues (to provide guaranteed bandwidth). It also enables traffic engineering characteristics in order to provide load balancing on the network as well as fast rerouting in case of link failure. In addition we implemented a management tool for the service. The scope of this tool is to allow the users to manage their MBS requests (make a new one, edit, delete or view a request). Also the tool performs admission control and produces the necessary configuration that must be applied on the network in order to implement every service's request. This service was designed and implemented on GRNET's network.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122246671","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}
To alleviate the problem of high priority traffic hogging of all the available network capacity and to optimize the network traffic in the DiffServ network, we introduce the multi-class routing (MCR) scheme into the DiffServ architecture. The MCR scheme that builds multiple routing tables in the DiffServ routers forms the MCR DiffServ architecture. In this paper, the MCR DiffServ architecture focuses on the intra-DS domain. Different MCR approaches that include a static approach and dynamic approaches can be used for the MCR DiffServ system. We extend the OSPF protocol in order to build up more than one routing table in each MCR DiffServ system. According to the extensions to OSPF, we have implemented the static MCR approach for the MCR DiffServ system on the basis of the open source Zebra software.
{"title":"Adding multi-class routing into the DiffServ architecture","authors":"Yin Wang, R. Kantola, Shuping Liu","doi":"10.1109/ICW.2005.21","DOIUrl":"https://doi.org/10.1109/ICW.2005.21","url":null,"abstract":"To alleviate the problem of high priority traffic hogging of all the available network capacity and to optimize the network traffic in the DiffServ network, we introduce the multi-class routing (MCR) scheme into the DiffServ architecture. The MCR scheme that builds multiple routing tables in the DiffServ routers forms the MCR DiffServ architecture. In this paper, the MCR DiffServ architecture focuses on the intra-DS domain. Different MCR approaches that include a static approach and dynamic approaches can be used for the MCR DiffServ system. We extend the OSPF protocol in order to build up more than one routing table in each MCR DiffServ system. According to the extensions to OSPF, we have implemented the static MCR approach for the MCR DiffServ system on the basis of the open source Zebra software.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122320564","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 proposes an efficient handoff decision algorithm using differential received signal strength indicator (RSSI) in MPLS-based mobile IP network. MPLS-based mobile IP integrates mobile IP and MPLS. The differential RSSI value is efficient to decide handoff because this value could represent the movement direction of mobile node (MN). In our algorithm, a base station tracks the differential RSSI value of mobile node in overlapped region and releases the reserved bandwidth of MN with the differential RSSI value. As shown by numerical analysis, our algorithm using differential RSSI could increase performance by decreasing handoff blocking probability.
{"title":"Efficient handoff decision algorithm using differential RSSI in MPLS-based mobile IP network","authors":"YoungHwan Kwon, S. Choi, J. Choi","doi":"10.1109/ICW.2005.45","DOIUrl":"https://doi.org/10.1109/ICW.2005.45","url":null,"abstract":"This paper proposes an efficient handoff decision algorithm using differential received signal strength indicator (RSSI) in MPLS-based mobile IP network. MPLS-based mobile IP integrates mobile IP and MPLS. The differential RSSI value is efficient to decide handoff because this value could represent the movement direction of mobile node (MN). In our algorithm, a base station tracks the differential RSSI value of mobile node in overlapped region and releases the reserved bandwidth of MN with the differential RSSI value. As shown by numerical analysis, our algorithm using differential RSSI could increase performance by decreasing handoff blocking probability.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124091023","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}
For a wireless sensor network, the primary design criterion is to save the energy consumption as much as possible while achieving the given task. Most of recent research works have only focused on the individual layer issues and ignore the importance of interworking between different layers in a sensor network. In this paper, we use a cross-layer approach to propose an energy-efficient sensor network - CoLaNet, which takes (a) the characteristics and requirements of the applications, (b) routing in the network layer, and (c) the data scheduling in MAC layer into consideration. Specifically, we use the characteristics of the applications to construct the routing tree and then formulate the routing and MAC issues into a vertex-coloring problem. By solving that problem, CoLaNet is able to determine the proper data transmission schedule for each sensor node. We evaluate CoLaNet through extensive simulations and the results show that such cross-layer approach is energy-efficient and able to achieve significant performance improvement as well.
{"title":"CoLaNet: a cross-layer design of energy-efficient wireless sensor networks","authors":"Cheng-Fu Chou, Kwanghun Chuang","doi":"10.1109/ICW.2005.35","DOIUrl":"https://doi.org/10.1109/ICW.2005.35","url":null,"abstract":"For a wireless sensor network, the primary design criterion is to save the energy consumption as much as possible while achieving the given task. Most of recent research works have only focused on the individual layer issues and ignore the importance of interworking between different layers in a sensor network. In this paper, we use a cross-layer approach to propose an energy-efficient sensor network - CoLaNet, which takes (a) the characteristics and requirements of the applications, (b) routing in the network layer, and (c) the data scheduling in MAC layer into consideration. Specifically, we use the characteristics of the applications to construct the routing tree and then formulate the routing and MAC issues into a vertex-coloring problem. By solving that problem, CoLaNet is able to determine the proper data transmission schedule for each sensor node. We evaluate CoLaNet through extensive simulations and the results show that such cross-layer approach is energy-efficient and able to achieve significant performance improvement as well.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132722081","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
扫码关注我们
求助内容：
应助结果提醒方式：