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的概率。