一种计算缩减级型广义洗牌网络平均跳距的算法  

An Algorithm for Computing the Average Hop Distance of Ruduced stage Shuffle Networks

作　　者：张杰[1] 申云峰[1] 顾畹仪 李国瑞 徐大雄 

机构地区：[1]北京邮电大学电信工程学院

出　　处：《中国激光》1999年第5期431-436,共6页Chinese Journal of Lasers

基　　金：863计划;邮电部重点项目资助课题

摘　　要：简单介绍了广义洗牌网络（ＧＳＮ）的结构和分类，着重分析缩减级型ＧＳＮ的平均跳距性能。GSN is a generalization of shuffle exchange networks and it can represent a family of network structures (including ShuffleNet & de Bruijn graph) for an arbitrary number of nodes. GSN employs a regular interconnection graph with highly desirable properties and it can serve as a logical (virtual), multihop topology for constructing the next generation of lightwave networks using wavelength division multiplexing (WDM). GSN can be divided into two classes: extra stage and reduced stage. The architecture of the GSN is introduced briefly. Then, the performance of the GSN is analyzed. At last an algorithm for computing the average hop distance for the reduced stage GSN is proposed in this paper.

关 键 词：广义洗牌网络 GSN 波分复用 多跳网络 光纤通信 

分 类 号：TN929.11[电子电信—通信与信息系统] TN711.1[电子电信—信息与通信工程]