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 erlangs lower than 400.

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