Optical backbone networks are required to be highly dynamic in supporting requests with flexible bandwidth granularities to cope with the demands of new broadband wireless and fixed access networks. To provide this flexibility, services are offered by taking requested bandwidth profile into consideration, instead of assigning a fixed amount of bandwidth to each request. New techniques are developed for the resource management of the elastic optical networks to realize services with a specified bandwidth profile, consisting of minimum, average, and maximum required number of spectrum slots, in addition to holding time. In this work, two new schemes are proposed to realize such services, exploiting a probabilistic spectrum partitioning approach. This new probabilistic spectrum partitioning scheme is devised to enhance the chance of accommodating requests and consequently lower request blocking probability. It enforces different probabilities to contributing spectrum partitions in a certain service realization. Taking advantage of this probabilistic spectrum partitioning and a profile-based routing, we introduce two multistage spectrum assignment methods to make a certain lightpath meet the requested service profile constraints, considering the time-weighted average of the assigned spectrum slots. The results indicate that our algorithms can successfully realize the requests with the probability of 0.993 for the offered loads less than 400 erlang.

翻译：光骨干网需具备高度动态性，以支持灵活带宽粒度的请求，从而应对新型宽带无线和固定接入网络的需求。为提供这种灵活性，服务需依据所请求的带宽轮廓（而非为每个请求分配固定带宽量）来提供。针对弹性光网络的资源管理，本文开发了新技术以支持具有指定带宽轮廓（包括最小、平均、最大所需频谱时隙数及保持时间）的业务。本文提出两种利用概率频谱分区方法实现此类业务的新方案。该概率频谱分区方案旨在提升请求容纳概率，进而降低请求阻塞概率，通过对特定业务实现中不同频谱分区施加差异化的贡献概率。结合概率频谱分区与基于轮廓的路由，本文引入两种多级频谱分配方法，在考虑分配时隙的时间加权平均值的基础上，使特定光路满足请求的轮廓约束。结果表明，当业务负载低于400爱尔兰时，所提算法能以0.993的概率成功实现请求。