k-ary n-cube网络中跨区域适应性路由算法

刘俊辉; 顾华玺; 王长山

您当前的位置：

首页 >

文章列表页 >

k-ary n-cube网络中跨区域适应性路由算法

更新时间：2026-09-14

- k-ary n-cube网络中跨区域适应性路由算法
- k-ary n-cube网络中跨区域适应性路由算法
- Issue 3, (2009)
- 作者机构：
  
  1. 西安电子科技大学计算机学院
  2. 西安电子科技大学ISN国家重点实验室
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：2009
- 稿件说明：
移动端阅览
刘俊辉, 顾华玺, 王长山. k-ary n-cube网络中跨区域适应性路由算法[J]. 2009, (3).
DOI：

刘俊辉, 顾华玺, 王长山. k-ary n-cube网络中跨区域适应性路由算法[J]. 2009, (3). DOI：

摘要

针对k-ary n-cube网络

提出一种无死锁、无活锁、负载均衡的跨区域路由算法(Q uadran tC ross ing R ou ting

QCR).算法按照分组源目的节点相对位置将网络划分路由区域

并给予这些区域不同的权重

同时设定跨区域规则

允许分组根据网络负载状态跨区域路由

这样就使得网络的流量分布更均衡.网络的负载程度由输出端口等待分组请求的时间间隔的大小决定.最后

利用OPNET对所提算法在不同流量模式下进行仿真.结果表明:相比已有的同类算法

如维序路由算法(D im ens ion O rder R ou ting

DOR)

Duato及GAL等

QCR表现出较好的时延、吞吐性能.

Abstract

A new quadrant crossing routing(QCR) algorithm for k-ary n-cube networks is proposed

which is load balanced

deadlock-free and livelock-free.According to the source and destination node of each packet

the network is divided into several quadrants with various weights.QCR sets quadrant crossing rule and allows packets to cross quadrants based on network state

which makes traffic distribution more balanced.Network state is determined by the time interval between the last two requests to the same output.Finally

performance of the proposed routing algorithm is evaluated by OPNET under various traffic modes.The simulation results show that QCR outperforms the previously published routing algorithms

such as dimension order routing(DOR)

Duato's algorithm and GAL.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

机器人机构设计与控制专栏

Study on the Removal of CO2 in Confined Space by High⁃Gravity Enhanced Potassium Hydroxide Coupled Potassium Glycinate Solution

Design of Parallel Robot Experimental Platform Based on Reconfigurable Innovative Components

Adaptive Shock Wave Overpressure Sensing for Dynamic Explosion Testing

Network Intrusion Detection Model Based on Recurrence Plot and MobileViT⁃AESTF

Related Author

No data

Related Institution

No data

⁰