业界提出利用路由保护算法来解决网络中的故障问题,然而已有的路由保护算法存在4个方面的问题:1)无法应对网络中所有可能的单故障情形;2)需要额外辅助机制的协助;3)不支持增量部署;4)每个结点存储多个到达目的地址的备份下一跳.提出一...业界提出利用路由保护算法来解决网络中的故障问题,然而已有的路由保护算法存在4个方面的问题:1)无法应对网络中所有可能的单故障情形;2)需要额外辅助机制的协助;3)不支持增量部署;4)每个结点存储多个到达目的地址的备份下一跳.提出一种基于转发图的域内路由保护算法(an intradomain routing protection algorithm based on forwarding graph,RPBFG)来解决这4个问题.首先建立了以最大化故障保护率为目标、以转发图包含反向最短路径树为约束条件的路由保护模型;然后提出了利用遗传算法构造满足上述目标的转发图;最后根据构造的转发图计算出所有结点到达目的结点的备份下一跳.在11个真实拓扑结构中比较了RPBFG,NPC,U-turn,MARA-MA,MARA-SPE在故障保护率和路径拉伸度的性能.实验结果表明,RPBFG可以应对网络中所有可能的单故障;在平均路径拉伸度方面,RPBFG比NPC,U-turn,MARA-MA,MARA-SPE分别降低了0.11%,0.72%,37.79%,36.26%.展开更多
With the rapid development of location-aware devices such as smart phones,Location-Based Services(LBSs) are becoming increasingly popular. Users can enjoy convenience by sending queries to LBS servers and obtaining se...With the rapid development of location-aware devices such as smart phones,Location-Based Services(LBSs) are becoming increasingly popular. Users can enjoy convenience by sending queries to LBS servers and obtaining service information that is nearby.However, these queries may leak the users' locations and interests to the un-trusted LBS servers, leading to serious privacy concerns. In this paper, we propose a Privacy-Preserving Pseudo-Location Updating System(3PLUS) to achieve k-anonymity for mobile users using LBSs. In 3PLUS, without relying on a third party, each user keeps pseudo-locations obtained from both the history locations and the encountered users, and randomly exchanges one of them with others when encounters occur. As a result, each user's buffer is disordered. A user can obtain any k locations from the buffer to achieve k-anonymity locally. The security analysis shows the security properties and our evaluation results indicate that the user's privacy is significantly improved.展开更多
文摘业界提出利用路由保护算法来解决网络中的故障问题,然而已有的路由保护算法存在4个方面的问题:1)无法应对网络中所有可能的单故障情形;2)需要额外辅助机制的协助;3)不支持增量部署;4)每个结点存储多个到达目的地址的备份下一跳.提出一种基于转发图的域内路由保护算法(an intradomain routing protection algorithm based on forwarding graph,RPBFG)来解决这4个问题.首先建立了以最大化故障保护率为目标、以转发图包含反向最短路径树为约束条件的路由保护模型;然后提出了利用遗传算法构造满足上述目标的转发图;最后根据构造的转发图计算出所有结点到达目的结点的备份下一跳.在11个真实拓扑结构中比较了RPBFG,NPC,U-turn,MARA-MA,MARA-SPE在故障保护率和路径拉伸度的性能.实验结果表明,RPBFG可以应对网络中所有可能的单故障;在平均路径拉伸度方面,RPBFG比NPC,U-turn,MARA-MA,MARA-SPE分别降低了0.11%,0.72%,37.79%,36.26%.
基金supported by the National Natural Science Foundation of China under Grants No.61003300,No.61272457the Fundamental Research Funds for the Central Universities under Grant No.K5051201041the China 111 Project under Grant No.B08038
文摘With the rapid development of location-aware devices such as smart phones,Location-Based Services(LBSs) are becoming increasingly popular. Users can enjoy convenience by sending queries to LBS servers and obtaining service information that is nearby.However, these queries may leak the users' locations and interests to the un-trusted LBS servers, leading to serious privacy concerns. In this paper, we propose a Privacy-Preserving Pseudo-Location Updating System(3PLUS) to achieve k-anonymity for mobile users using LBSs. In 3PLUS, without relying on a third party, each user keeps pseudo-locations obtained from both the history locations and the encountered users, and randomly exchanges one of them with others when encounters occur. As a result, each user's buffer is disordered. A user can obtain any k locations from the buffer to achieve k-anonymity locally. The security analysis shows the security properties and our evaluation results indicate that the user's privacy is significantly improved.
