位置：成果数据库 > 会议 > 会议详情页
Cost Efficient Design of Survivable Virtual Infrastructure to Recover from Facility Node Failures
  • 所属机构名称：电子科技大学
  • 会议名称： 2011 IEEE International Conference on Communications (ICC),
  • 成果类型：会议
  • 会场：Ktoyo
  • 相关项目：基于部分合作的分布式重叠网络资源管理机制研究
作者： Hongfang Yu|Chunming Qiao|Vishal Anand|Gang Sun|
同会议论文项目
基于部分合作的分布式重叠网络资源管理机制研究
期刊论文 10 会议论文 22
同项目会议论文
Survivable Virtual Infrastructure Mapping in a Federated Computing and Networking System under Singl
A New Heuristic for Monitoring Trail Allocation in All-Optical WDM Networks
A New Algorithm with Coordinated Node and Link Mapping for Virtual Network Embedding Based on LP Rel
Considering the utilization of idle time slots for DAG scheduling in optical grid applications
An Efficient Resource Sharing Scheme for Double-Link Failures in Optical Mesh Networks
On the Survivable Virtual Infrastructure Mapping Problem
An Inter-Ring Routing Algorithm based on Auxiliary Graph in Multi-Ring SDH Networks
A New Framework to Design Distributed Query System
On Progressive Network Recovery After a Major Disruption
Enhancing Virtual Infrastructure to Survive Facility Node Failures
Cost-effective Multilayer Network Optimization: A top down decomposition solution
Survivable Virtual Infrastructure Mapping in a Federated Computing and Networking System under Singl
A Novel Framework of Fast and Unambiguous Link Failure Localization via Monitoring Trails
Migration based Protection for Virtual Infrastructure Survivability for Link Failure
Mapping the Virtual Networks with Stochastic Bandwidth Resource Request in Multi-datacenters
A Novel Survivable Traffic Grooming Algorithm with Inter-Layer Sharing in IP/MPLS-over-WDM Mesh Netw
A Dual Iterative Resource Allocation Algorithm in Optical Networks
A distributed algorithm for optimal network resource allocation considering delay sensitive traffic
Efficient Algorithms for Survivable Virtual Network Embedding
A Combined Protection Algorithm for Double-node Failures in Optical Mesh Networks
Cost Efficient Virtual Infrastructure Mapping using Subgraph Isomorphism