检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李挥[1] 何伟[1] 伊鹏[2] 王秉睿[1] 雷凯[1] 安辉耀[1] 汪斌强[2]
机构地区:[1]北京大学深圳研究生院集成微系统重点实验室,广东深圳518055 [2]信息工程大学国家数字交换系统工程技术研究中心,河南郑州450002
出 处:《电子学报》2008年第1期1-8,共8页Acta Electronica Sinica
基 金:国家自然科学基金(No.60572042);国家863高技术研究发展计划(No.2007AA01Z218);国家支撑计划(No.2006BAH02A10);广东省自然科学基金(NSFGD2007No.295)
摘 要:目前已提出多种能提供100%吞吐率的分组交换结构,如共享总线、共享内存、交叉矩阵及输入输出排队等.它们的结构性缺陷是存在某个瓶颈限制了其规模的有效扩展,如带宽瓶颈、调度算法运算处理瓶颈等.本研究提出了一类新的结合群组排序集线器和多级互连网络的多路径自路由交换结构,并证明了该类结构构建于代数群论的自路由数学模型.该结构具有:完全分布式自路由、无需端口匹配调度、无内部缓存、无缓存时延及无抖动、按位置换群建模及可递归扩展和模块化属性.理论分析及仿真结果表明该结构适合作为提供QoS保证的超大规模宽带交换结构.Various 100% throughput packet switching structures have been proposed for broadband network, such as Shared Bus, Shared Memory, Crossbar Matrix with Combined Input and Output Queuing, etc. Topologically speaking, their major demerit, such as bandwidth bottleneck and insufficient processing ability to schedule I/O matching, greatly limits their scalability for large scale switching routers. This paper proposes and models a novel multi-path self-routing switching fabric by integrating bitonic sorters and the multistage interconnection networks. This kind of structure possesses the properties of complete distributing and self-routing, free of I/O matching scheduling algorithm, no intemal buffer, no buffered delay and jitter, modeled with algebraic permuting group, as well as high modularity and recursive scalability.Mathematical analysis and simulations show this structure is suitable for building super large scale switching fabric with QoS guaranteed application.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.38