共查询到19条相似文献,搜索用时 140 毫秒
1.
在WDM网络中,由于光路之间存在的依赖性,物理网络的单链路失效可能会造成虚拓扑不连通而使上层网络(SDH、ATM或IP)无法使用自身的恢复机制来恢复受影响的业务,因此虚拓扑在嵌入物理拓扑时必须避免发生这种情况.已有的分离备用路径(Disjoint Alternate Path,DAP)算法总是假设网络所有波长路由节点都具有全波长转换能力.本文提出的LG-VTMDP保护设计算法利用分层图同时解决路由和波长分配两个子问题,并考虑了负载均衡和物理链路的容量限制.实验结果表明LG-VTMDP算法优于DAP算法和已有波长分配算法组合后的性能.本文还在此基础上提出了一种有效的波长转换器放置算法WCP算法. 相似文献
2.
以结构化拓扑为基础,采用CAN(content addressable network)协议,提出了一种新的云计算网络路由算法。该算法以M-CRP技术为基础,改进传统CAN协议,组网时在物理上相近的节点会处于逻辑上相邻的位置;相应的路由机制也对物理拓扑结构给予充分的考虑,优先考虑物理临近并且通信成本较低的节点;自适应机制网络状态不断变化,M-CRP-CAN(multiple-CDN-based relative network positioning)在组网、路由、自适应等机制都有较强底层物理拓扑结构感知性。实验表明,算法能够提高数据的交换效率,减少了网络中不必要的跨域流量,减少骨干链路的负载,提高了云计算网络性能。 相似文献
3.
4.
5.
基于多目标模拟退火算法的导航卫星激光星间链路拓扑动态优化 总被引:2,自引:0,他引:2
根据激光星间链路的技术特点,并考虑导航卫星星间链路需兼顾通信、高精度测量与自主定轨的多重要求,研究了全球导航卫星系统(GNSS)激光星间链路拓扑的动态优化问题。采用有限状态自动机(FSA)思想建立了一种导航卫星激光星间链路的链路周期表。综合卫星平台、轨道动力学、激光终端捕获跟踪性能等工程约束条件,以网络时延和链路空间位置精度因子(PDOP)作为通信性能和高精度测量的量化指标,建立拓扑的多目标优化模型。提出一种基于多目标模拟退火算法(MOSA)的改进算法,求解全局最优拓扑结构,并在某卫星或某条激光链路不可用时进行动态优化。此外,还设计了一种避免冲突的链路交叉算法,改进了多源最小时延路由算法。仿真结果表明:在包括24颗MEO和3颗IGSO卫星的GNSS中,经该算法优化的拓扑结构具有良好的通信和测量性能,能够有效改善网络时延、PDOP值;当个别卫星或个别激光链路不可用时,改进算法计算出的拓扑结构仍能较好地兼顾高速通信与高精度测量性能。 相似文献
6.
该文针对现有的虚拟网络映射算法对网络中节点的拓扑属性考虑不够周到,导致其请求接受率和收益开销比较低的问题,将物理学里的场论思想引入了虚拟网络映射,并提出一种基于拓扑势的虚拟网络映射算法。该算法在节点映射阶段,通过计算节点的拓扑势、节点的资源能力、待映射节点与已映射节点之间的距离,将虚拟节点映射至最佳的物理节点。在链路映射阶段,通过计算物理路径的可用带宽和路径跳数,将虚拟链路映射至最佳的物理路径。仿真实验表明,该算法在多种虚拟网络到达强度下的请求接受率和收益开销比均优于当前的虚拟网络映射算法。 相似文献
7.
8.
9.
10.
11.
12.
13.
In this paper, we propose a novel robust routing algorithm based on Valiant load-balancing under the model of polyhedral uncertainty (i.e., hose uncertainty model) for WDM (wavelength division multiplexing) mesh networks. Valiant load-balanced robust routing algorithm constructs the stable virtual topology on which any traffic patterns under the hose uncertainty model can be efficiently routed. Considering there are multi-granularity connection requests in WDM mesh networks, we propose the method called hose-model separation to solve the problem for the proposed algorithm. Our goal is to minimize total network cost when constructing the stable virtual topology that assures robust routing for the hose model in WDM mesh networks. A mathematical formulation (integer linear programming, ILP) about Valiant load-balanced robust routing algorithm is presented. Two fast heuristic approaches are also proposed and evaluated. We compare the network throughput of the virtual topology constructed by the proposed algorithm with that of the traditional traffic grooming algorithm under the same total network cost by computer simulation. 相似文献
14.
15.
Traffic processing algorithms are introduced for SIGnet (slotted interconnected-grid network), which is intended for local and metropolitan area backbone communication networks using multichannel optical transmission media. The design is motivated by the development of inexpensive multichannel capabilities based on dense wavelength division multiplexing (WDM) and future coherent optical systems. In SIGnet, the virtual topology is piecewise regular and permits bandwidth allocation and network evolution which is much more easily accomplished than in previous designs. SIGnet employs deflection routing to accommodate nonisochronous traffic. However, a multilink grid topology provides a closer match to the actual physical topology in many networks. This work includes an introduction to the network design and presents results obtained concerning the traffic processing algorithms which have been investigated 相似文献
16.
In this paper, a novel method is proposed to address the problem of designing virtual topology over wavelength division multiplexing (WDM) networks under bandwidth demand uncertainties. And a bandwidth demand model under uncertainties is presented. The optimization goal of virtual topology design is defined as minimizing the maximum value amongp percentiles of the bandwidth demand distribution on all Hght-paths. Correspondingly, we propose a heuristic algorithm called an improved decreasing multi-hop logical topology design algorithm (ID-MLTDA) that involves with a degree of uncertainties to design virtual topology. The proposed algorithm yields better performance than previous algorithms. Additionally, the simplicity and efficiency of the proposed algorithm can be in favor of the feasibility for topology design of large networks. 相似文献
17.
18.
Banerjee D. Frank J. Mukherjee B. 《Selected Areas in Communications, IEEE Journal on》1998,16(7):1040-1050
We explore an optical network architecture which employs dense wavelength division multiplexing (WDM) technology and passive waveguide grating routers (WGRs) to establish a virtual topology based on lightpath communication. We examine the motivation and the technical challenges involved in this approach, propose and examine the characteristics of a network design algorithm, and provide some illustrative performance results 相似文献
19.
This paper studies the virtual topology design and reconfiguration problem of virtual private networks (VPNs) over all-optical WDM networks. To support VPN service, a set of lightpaths must be established over the underlying WDM network to meet the VPN traffic demands and this set of lightpaths must also be dynamically reconfigurable in response to changing VPN traffic. To achieve good network performance and meet the service requirements of optical virtual private networks (oVPNs), we formulate the problem as an integer programming problem with multi-objectives and present a general formulation of the problem. In the formulation, we take into account the average propagation delay over a lightpath, the maximum link load, and the reconfiguration cost with objectives to minimize the three metrics simultaneously. The formulated problem is NP-hard and is therefore not practical to have exact solutions. For this reason, we use heuristics to obtain approximate optimal solutions and propose a balanced alternate routing algorithm (BARA) based on a genetic algorithm. To make the problem computationally tractable, we approximately divide BARA into two independent stages: route computing and path routing. At the route computing stage, a set of alternate routes is computed for each pair of source and destination nodes in the physical topology. At the path routing stage, an optimal route is decided from a set of alternative routes for each of the lightpaths between a pair of source and destination nodes. A decision is subject to the constraints and objectives in the formulation. To improve the computational efficiency, we use a genetic algorithm in BARA. Through simulation experiments, we show the effectiveness of BARA and the evolution process of the best solution in a population of solutions produced by the genetic algorithm. We also investigate the impact of the number of alternative routes between each pair of source and destination nodes on the optimized solutions. 相似文献