首页> 外文学位 >Network resource allocation and provisioning issues: Admission control with contiguous constraint in SONET networks and survivability in packet-over-optical networks.
【24h】

Network resource allocation and provisioning issues: Admission control with contiguous constraint in SONET networks and survivability in packet-over-optical networks.

机译:网络资源分配和供应问题:SONET网络中具有连续约束的准入控制和光分组网络中的生存性。

获取原文
获取原文并翻译 | 示例

摘要

In this dissertation, two important issues are addressed, from the network resource allocation and provisioning point of view: admission control in capacitated loss networks with heterogeneous traffic and contiguous resource allocation constraints, and secondly a survivability study in IP-over-Optical networks.; Given a capacitated loss network, with heterogeneous traffic arrivals—in the case that each traffic demand must be assigned in contiguous position, the traffic admission control problem is to find call admission/packing algorithms, such that the objective function will be maximized/minimized. This is an extremely complicated problem in terms of obtaining an optimal solution. Based on the complexity study, it is desirable to find computationally inexpensive heuristic call admission/packing policies to minimize the weighted blocking probability. The First-Fit (FF) and Best-Fit (BF) policy are examined by simulation. The blocking probabilities from these two policies are compared with those of the Complete-Sharing (CS) policy and Optimal-Complete-Partitioning (OCP) policy. A loose optimal lower bound is obtained by applying the theory of Semi-Markov Decision Processes (SMDP). As the first to systematically study this problem, our results (from CS, FF, BF, OCP, SMDP policies) suggest that two novel heuristic admission/packing policies, Best-Fit with Reservation (BFR) and Moving Boundary First-Fit (MBFF), might have higher efficiency.; The second study in this dissertation is devoted to the cost effectiveness of survivability in IP-over-optical networks. A novel joint-layer restoration scheme for IP-over-optical networks is proposed, where the restoration algorithm manages network resources from both the IP layer and the optical layer in a synergistic manner. The essence of this scheme is to attempt to reuse router service ports and the service wavelengths associated with optical switch ports for restoration, rather than reserve additional standby router ports exclusively for network recovery. Mixed integer programming (MIP) optimization problems for this purpose are modeled to determine the restoration paths for affected traffic by any single router failure. Our case studies for service-provider networks show that the joint-layer restoration scheme is much more cost-effective in all cases. The extensive sensitivity analysis concludes that the cost savings are robust.
机译:本文从网络资源分配和供应的角度出发,解决了两个重要的问题:具有异构流量和连续资源分配约束的容量损失网络中的准入控制,其次是基于IP的光网络的可生存性研究。给定一个容量损失的网络,该网络具有异构的业务到达,在每个业务需求必须分配在连续位置的情况下,业务准入控制问题是找到呼叫准入/打包算法,以使目标函数最大化/最小化。就获得最佳解决方案而言,这是一个极其复杂的问题。基于复杂性研究,期望找到计算上便宜的启发式呼叫允许/打包策略以最小化加权阻塞概率。通过模拟检查了第一适应(FF)和最佳适应(BF)策略。将这两个策略的阻塞概率与完全共享(CS)策略和最佳完全分区(OCP)策略的阻塞概率进行比较。通过应用半马尔可夫决策过程(SMDP)理论获得了宽松的最优下限。作为第一个系统地研究此问题的人,我们的结果(来自CS,FF,BF,OCP,SMDP策略)表明,两种新颖的启发式许可/打包策略:保留最佳匹配(BFR)和移动边界优先(MBFF) ),可能会有更高的效率。本文的第二项研究致力于IP光纤网络中生存能力的成本效益。提出了一种新颖的IP-over-Optical网络的联合层恢复方案,其中该恢复算法以协同方式管理来自IP层和光学层的网络资源。此方案的本质是尝试重用路由器服务端口和与光交换端口相关的服务波长以进行恢复,而不是专门为网络恢复保留其他备用路由器端口。为此目的对混合整数编程(MIP)优化问题进行建模,以确定任何单个路由器故障对受影响流量的恢复路径。我们对服务提供商网络的案例研究表明,联合层恢复方案在所有情况下都更具成本效益。广泛的敏感性分析得出的结论是,成本节省是可靠的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号