检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:申金媛[1] 李现国[1] 范怀玉[1] 熊涛[2] 常胜江[2] 张延炘[2]
机构地区:[1]郑州大学信息工程学院,郑州450052 [2]南开大学现代光学研究所光电信息技术科学教育部重点实验室,天津300071
出 处:《计算机工程》2007年第5期173-175,179,共4页Computer Engineering
基 金:国家自然科学基金资助项目(60277022);河南省杰出青年基金资助项目(512000400);河南省高等学校创新人才培养工程资助项目
摘 要:针对ATM交换结构,采用输入缓冲和每条入线在同一个时隙内可传送多于一个信元的策略,利用神经网络具有的实时性、高度并行处理能力和易于电路或光电技术实现等特点,提出了一种Hopfield神经网络调度算法。实验仿真比较表明,该方法不但大大提高了吞吐率,消除了队头阻塞造成的性能恶化,而且降低了信元丢失率和较大程度地降低了平均信元时延,提高了ATM交换结构的性能,实现了信元的优化调度。The asynchronous transfer mode (ATM) is the choice of transport mode for broadband integrated service digital networks (B-ISDN's). It represents the future development of networks and communication technique. A cell schedule algorithm based on Hopfield neural network (HNN) model for ATM switching fabrics (ASF) is proposed in this paper. A new energy function of HNN is employed based on dedicated input buffered cooperating with the policy of more than one cell transferred in each input line during every time slot. Experimental simulation results show that, compared with the method presented in reference 6, the approach not only improves greatly the throughput and eliminates the performance reduction due to the head of line blocking (HOL blocking), but also lowers down the cell loss probability and reduces the average latency, i.e. the performances of ASF are quite improved. It means that the optimization scheduling of the cell can be efficiently implemented by the cell schedule algorithm.
关 键 词:HOPFIELD神经网络 信元优化调度 ATM交换结构 多重队列
分 类 号:TP183[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.90