The m ajor advantages of EBS-based key rrkanagerrent scheme are its enhanced network survivability, high dynamic performance, and better support for network expansion. But it suffers from the collusion problem, which ...The m ajor advantages of EBS-based key rrkanagerrent scheme are its enhanced network survivability, high dynamic performance, and better support for network expansion. But it suffers from the collusion problem, which means it is prone to the cooperative attack of evicted members. A novel EBS-based collusion resistant group management scheme utilizing the construction of Ciphertext-Policy Attribute-Based Encryption （CP-ABE） is proposed. The new scheme satisfies the desired security properties, such as forward secrecy, backward secrecy and collusion secrecy. Compared with existing EBS-based key rmnagement scheme, the new scheme can resolve EBS collusion problem completely. Even all evicted members work together, and share their individual piece of information, they could not access to the new group key. In addition, our scheme is more efficient in terms of conmnication and computation overhead when the group size is large. It can be well controlled even in the case of large-scale application scenarios.展开更多
The control and data planes are decoupled in software-defined networking(SDN),which enables both planes to evolve independently,and brings about many advantages such as high flexibility,programmability,and rapid imple...The control and data planes are decoupled in software-defined networking(SDN),which enables both planes to evolve independently,and brings about many advantages such as high flexibility,programmability,and rapid implementation of new network protocols.However,in order to improve the scalability of the control plane at present,some control functionalities are added to the data plane,which is probably to impact on the generality of the data plane.The key challenge of adding control functionalities to the data plane is to strike a careful balance between the generality of the data plane and the scalability of the control plane.We propose some basic principles that both control and data planes should comply with,based on the evolutionary trend of SDN.Moreover,we take two approaches for reference according to the principles,viewed from the control messages in OpenFlow-based SDN.Our evaluations demonstrate that the approaches can maintain the generality of the data plane and improve the scalability of the control plane.展开更多
In the traditional Intemet Protocol （IP） architecture, there is an overload of IP sermntic problems. Existing solutions focused mainly on the infrastructure for the fixed network, and there is a lack of support for ...In the traditional Intemet Protocol （IP） architecture, there is an overload of IP sermntic problems. Existing solutions focused mainly on the infrastructure for the fixed network, and there is a lack of support for Mobile Ad Hoc Networks （MANETs）. To improve scalability, a routing protocol for MANETs is presented based on a locator named Tree-structure Locator Distance Vector （TLDV）. The hard core of this routing method is the identifier/locator split by the Distributed Hash Table （DHT） method, which provides a scalable routing service. The node locator indicates its relative location in the network and should be updated whenever topology changes, kocator space ks organized as a tree-structure, and the basic routing operation of the TLDV protocol is presented. TLDV protocol is compared to some classical routing protocols for MANETs on the NS2 platform Results show that TLDV has better scalability. Key words：展开更多
When applying Software-Defined Networks(SDN) to WANs,the SDN flexibility enables the cross-domain control to achieve a better control scalability.However,the control consistence is required by all the cross-domain ser...When applying Software-Defined Networks(SDN) to WANs,the SDN flexibility enables the cross-domain control to achieve a better control scalability.However,the control consistence is required by all the cross-domain services,to ensure the data plane configured in consensus for different domains.Such consistence process is complicated by potential failure and errors of WANs.In this paper,we propose a consistence layer to actively and passively snapshot the cross-domain control states,to reduce the complexities of service realizations.We implement the layer and evaluate performance in the PlanetLab testbed for the WAN emulation.The testbed conditions are extremely enlarged comparing to the real network.The results show its scalability,reliability and responsiveness in dealing with the control dynamics.In the normalized results,the active and passive snapshots are executed with the mean times of 1.873 s and 105 ms in135 controllers,indicating its readiness to be used in the real network.展开更多
An minimum description length(MDL) criterion is proposed to choose a good partition for a bipartite network. A heuristic algorithm based on combination theory is presented to approach the optimal partition. As the heu...An minimum description length(MDL) criterion is proposed to choose a good partition for a bipartite network. A heuristic algorithm based on combination theory is presented to approach the optimal partition. As the heuristic algorithm automatically searches for the number of partitions, no user intervention is required. Finally, experiments are conducted on various datasets, and the results show that our method generates higher quality results than the state-of-art methods, cross-association and bipartite, recursively induced modules. Experiment results also show the good scalability of the proposed algorithm. The method is applied to traditional Chinese medicine(TCM) formula and Chinese herbal network whose community structure is not well known, and found that it detects significant and it is informative community division.展开更多
A density-based partitioning strategy is proposed for large domain networks in order to deal with the scalability issue found in autonomic networks considering, as a scenario, the autonomic Quality of Service （QoS） ...A density-based partitioning strategy is proposed for large domain networks in order to deal with the scalability issue found in autonomic networks considering, as a scenario, the autonomic Quality of Service （QoS） management context. The approach adopted focus as on obtaining dense network partitions having more paths for a given vertices set in the domain. It is demonstrated that dense partitions improve autonomic processing scalability, for instance, reducing routing process complexity. The solution looks for a significant trade-off between partition autonomic algorithm execution time and path selection quality in large domains. Simulation scenarios for path selection execution time are presented and discussed. Authors argue that autonomic networks may benefit from the dense partition approach proposed by achieving scalable, efficient and near real-time support for autonomic management systems.展开更多
In this paper, architecture of softswitch-based Next Generation Network (NGN) system and Session Initiation Protocol (SIP) are studied briefly, and the problems on the openness and extensibility of normal remote video...In this paper, architecture of softswitch-based Next Generation Network (NGN) system and Session Initiation Protocol (SIP) are studied briefly, and the problems on the openness and extensibility of normal remote video-monitoring system (RVMS) are analyzed. Then a RVMS framework model based on softswitch is given. Furthermore, designation and realization of the system based on T 6000 Softswitch Platform is provided. The innovation is considering the RVMS as a part of softswitch system. It is a feasible scheme for implementing next generation video-monitoring system based on broadband IP technique.展开更多
The scalability of routing architectures for large networks is one of the biggest challenges that the Internet faces today.Greedy routing,in which each node is assigned a locator used as a distance metric,recently rec...The scalability of routing architectures for large networks is one of the biggest challenges that the Internet faces today.Greedy routing,in which each node is assigned a locator used as a distance metric,recently received increased attention from researchers and is considered as a potential solution for scalable routing.In this paper,LMD—a local minimum driven method is proposed to compute the topology-based locator.To eliminate the negative effect of the " quasi" greedy property—transfer routes longer than the shortest routes,a two-stage routing strategy is introduced,which combines the greedy routing with source routing.The greedy routing path discovered and compressed in the first stage is then used by the following source-routing stage.Through extensive evaluations,based on synthetic topologies as well as on a snapshot of the real Internet AS(autonomous system)topology,it is shown that LMD guarantees 100%delivery rate on large networks with low stretch.展开更多
Despite the rapid advances in mobile technology, many constraints still prevent mobile devices from running resource-demanding applications in mobile environments. Cloud computing with flexibility, stability and scala...Despite the rapid advances in mobile technology, many constraints still prevent mobile devices from running resource-demanding applications in mobile environments. Cloud computing with flexibility, stability and scalability enables access to unlimited resources for mobile devices, so more studies have focused on cloud computingbased mobile services. Due to the stability of wireless networks, changes of Quality of Service （QoS） level and user＇ real-time preferences, it is becoming challenging to determine how to adaptively choose the ＂appropriate＂ service in mobile cloud computing environments. In this paper, we present an adaptive service selection method. This method first extracts user preferences from a service＇s evaluation and calculates the similarity of the service with the weighted Euclidean distance. Then, they are combined with user context data and the most suitable service is recommended to the user. In addition, we apply the fuzzy cognitive imps-based model to the adaptive policy, which improves the efficiency and performance of the algorithm. Finally, the experiment and simulation demonstrate that our approach is effective.展开更多
基金Acknowledgements The authors would like to thank the reviewers for their detailed reviews and constructive comments, which have helped improve the quality of this paper. This work was supported by the National Natural Science Foundation of China under Crant No. 60873231, the Natural Science Foundation of Jiangsu Province under Grant No. BK2009426, Major State Basic Research Development Program of China under Cwant No.2011CB302903 and Key University Science Research Project of Jiangsu Province under Crant No. 11KJA520002.
文摘The m ajor advantages of EBS-based key rrkanagerrent scheme are its enhanced network survivability, high dynamic performance, and better support for network expansion. But it suffers from the collusion problem, which means it is prone to the cooperative attack of evicted members. A novel EBS-based collusion resistant group management scheme utilizing the construction of Ciphertext-Policy Attribute-Based Encryption （CP-ABE） is proposed. The new scheme satisfies the desired security properties, such as forward secrecy, backward secrecy and collusion secrecy. Compared with existing EBS-based key rmnagement scheme, the new scheme can resolve EBS collusion problem completely. Even all evicted members work together, and share their individual piece of information, they could not access to the new group key. In addition, our scheme is more efficient in terms of conmnication and computation overhead when the group size is large. It can be well controlled even in the case of large-scale application scenarios.
文摘The control and data planes are decoupled in software-defined networking(SDN),which enables both planes to evolve independently,and brings about many advantages such as high flexibility,programmability,and rapid implementation of new network protocols.However,in order to improve the scalability of the control plane at present,some control functionalities are added to the data plane,which is probably to impact on the generality of the data plane.The key challenge of adding control functionalities to the data plane is to strike a careful balance between the generality of the data plane and the scalability of the control plane.We propose some basic principles that both control and data planes should comply with,based on the evolutionary trend of SDN.Moreover,we take two approaches for reference according to the principles,viewed from the control messages in OpenFlow-based SDN.Our evaluations demonstrate that the approaches can maintain the generality of the data plane and improve the scalability of the control plane.
基金Acknowledgements This work was supported by the Hi-Tech Research and Development Program of China under Grant No.2007AA01Z407 the Co-Funding Project of Beijing Municipal education Commission under Grant No.JD100060630+3 种基金 National Foundation Research Project the National Natural Science Foundation Project under Grant No. 61170295 the Project of Aeronautical Science Foundation of China under Caant No.2011ZC51024 and the Fundamental Research Funds for the Central Universities.
文摘In the traditional Intemet Protocol （IP） architecture, there is an overload of IP sermntic problems. Existing solutions focused mainly on the infrastructure for the fixed network, and there is a lack of support for Mobile Ad Hoc Networks （MANETs）. To improve scalability, a routing protocol for MANETs is presented based on a locator named Tree-structure Locator Distance Vector （TLDV）. The hard core of this routing method is the identifier/locator split by the Distributed Hash Table （DHT） method, which provides a scalable routing service. The node locator indicates its relative location in the network and should be updated whenever topology changes, kocator space ks organized as a tree-structure, and the basic routing operation of the TLDV protocol is presented. TLDV protocol is compared to some classical routing protocols for MANETs on the NS2 platform Results show that TLDV has better scalability. Key words：
基金supported by the National Basic Research Program of China (2012CB315903)the Program for Key Science and Technology Innovation Team of Zhejiang Province(2011R50010,2013TD20)+3 种基金the National High Technology Research Program of China(2015AA016103)the National Natural Science Foundation of China(61379118)the Research Fund of ZTE CorporationJiaxing Science and Technology Project (No.2014AY21021)
文摘When applying Software-Defined Networks(SDN) to WANs,the SDN flexibility enables the cross-domain control to achieve a better control scalability.However,the control consistence is required by all the cross-domain services,to ensure the data plane configured in consensus for different domains.Such consistence process is complicated by potential failure and errors of WANs.In this paper,we propose a consistence layer to actively and passively snapshot the cross-domain control states,to reduce the complexities of service realizations.We implement the layer and evaluate performance in the PlanetLab testbed for the WAN emulation.The testbed conditions are extremely enlarged comparing to the real network.The results show its scalability,reliability and responsiveness in dealing with the control dynamics.In the normalized results,the active and passive snapshots are executed with the mean times of 1.873 s and 105 ms in135 controllers,indicating its readiness to be used in the real network.
基金Projects(61363037,31071700)supported by the National Natural Science Foundation of ChinaProject(2011GXNSFD018025)supported by the Natural Science Key Foundation of Guangxi Province,ChinaProject(KYTZ201108)supported by the Development Foundation of Chengdu University of Information Technology,China
文摘An minimum description length(MDL) criterion is proposed to choose a good partition for a bipartite network. A heuristic algorithm based on combination theory is presented to approach the optimal partition. As the heuristic algorithm automatically searches for the number of partitions, no user intervention is required. Finally, experiments are conducted on various datasets, and the results show that our method generates higher quality results than the state-of-art methods, cross-association and bipartite, recursively induced modules. Experiment results also show the good scalability of the proposed algorithm. The method is applied to traditional Chinese medicine(TCM) formula and Chinese herbal network whose community structure is not well known, and found that it detects significant and it is informative community division.
文摘A density-based partitioning strategy is proposed for large domain networks in order to deal with the scalability issue found in autonomic networks considering, as a scenario, the autonomic Quality of Service （QoS） management context. The approach adopted focus as on obtaining dense network partitions having more paths for a given vertices set in the domain. It is demonstrated that dense partitions improve autonomic processing scalability, for instance, reducing routing process complexity. The solution looks for a significant trade-off between partition autonomic algorithm execution time and path selection quality in large domains. Simulation scenarios for path selection execution time are presented and discussed. Authors argue that autonomic networks may benefit from the dense partition approach proposed by achieving scalable, efficient and near real-time support for autonomic management systems.
文摘In this paper, architecture of softswitch-based Next Generation Network (NGN) system and Session Initiation Protocol (SIP) are studied briefly, and the problems on the openness and extensibility of normal remote video-monitoring system (RVMS) are analyzed. Then a RVMS framework model based on softswitch is given. Furthermore, designation and realization of the system based on T 6000 Softswitch Platform is provided. The innovation is considering the RVMS as a part of softswitch system. It is a feasible scheme for implementing next generation video-monitoring system based on broadband IP technique.
基金Supported by the National High Technology Research and Development Program of China(No.2013AA013501)the National Program on Key Basic Research Project(No.2012CB315801)+1 种基金the National Natural Science Foundation of China(No.61133015)the Science and Technology on Information Transmission and Dissemination in Communication Networks Laboratory,CETC54
文摘The scalability of routing architectures for large networks is one of the biggest challenges that the Internet faces today.Greedy routing,in which each node is assigned a locator used as a distance metric,recently received increased attention from researchers and is considered as a potential solution for scalable routing.In this paper,LMD—a local minimum driven method is proposed to compute the topology-based locator.To eliminate the negative effect of the " quasi" greedy property—transfer routes longer than the shortest routes,a two-stage routing strategy is introduced,which combines the greedy routing with source routing.The greedy routing path discovered and compressed in the first stage is then used by the following source-routing stage.Through extensive evaluations,based on synthetic topologies as well as on a snapshot of the real Internet AS(autonomous system)topology,it is shown that LMD guarantees 100%delivery rate on large networks with low stretch.
基金the third level of 2011 Zhejiang Province 151 Talent Project and National Natural Science Foundation of China under Grant No.61100043
文摘Despite the rapid advances in mobile technology, many constraints still prevent mobile devices from running resource-demanding applications in mobile environments. Cloud computing with flexibility, stability and scalability enables access to unlimited resources for mobile devices, so more studies have focused on cloud computingbased mobile services. Due to the stability of wireless networks, changes of Quality of Service （QoS） level and user＇ real-time preferences, it is becoming challenging to determine how to adaptively choose the ＂appropriate＂ service in mobile cloud computing environments. In this paper, we present an adaptive service selection method. This method first extracts user preferences from a service＇s evaluation and calculates the similarity of the service with the weighted Euclidean distance. Then, they are combined with user context data and the most suitable service is recommended to the user. In addition, we apply the fuzzy cognitive imps-based model to the adaptive policy, which improves the efficiency and performance of the algorithm. Finally, the experiment and simulation demonstrate that our approach is effective.
