Clustering for Hierarchical Traffic Grooming in Large Scale Mesh WDM Networks
Clustering for Hierarchical Traffic Grooming in Large Scale Mesh WDM Networks
复制标题
大规模网状 WDM 网络中分层流量疏导的集群
DOI：
--
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
G. Rouskas
中科院分区：
文献类型：
--
作者：
Bensong Chen;R. Dutta;G. Rouskas
提出了一种在大型WDM网络中进行分层业务疏导的分簇算法。在分层疏导中，网络被分解为集群，每个集群中的一个集线器节点负责疏导来自和去往集群的流量。分层疏导可扩展到大的网络规模，并便于流量和网络资源的控制和管理。然而，确定集群的大小和组成，以产生良好的疏导解决方案是一项具有挑战性的任务。我们确定了特定的因素，影响选择的集群，我们开发了一个参数化的聚类算法，可以实现所需的权衡各种目标。
We present a clustering algorithm for hierarchical traffic grooming in large WDM networks. In hierarchical grooming, the network is decomposed into clusters, and one hub node in each cluster is responsible for grooming traffic from and to the cluster. Hierarchical grooming scales to large network sizes and facilitates the control and management of traffic and network resources. Yet determining the size and composition of clusters so as to yield good grooming solutions is a challenging task. We identify the grooming-specific factors affecting the selection of clusters, and we develop a parameterized clustering algorithm that can achieve a desired tradeoff among various goals.