期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
再论园区网建设技术
1
作者 曾华燊 《计算机应用》 CSCD 1996年第5期1-3,共3页
从局网交换技术到FDDI和ATM把传统单段以太网结构的网络吞吐率成倍、成十倍的提高。本文纵观各类技术,略加点评,供读者建网时参考。
关键词 局网交换 以太 计算机 园区
下载PDF
Neighboring AP discovery and information exchange methods in Plug-and-Play WLAN system
2
作者 梁立涛 Wang Lei +4 位作者 Zhang Qixun Feng Zhiyong Yu Yifan Bai Yong Chen Lan 《High Technology Letters》 EI CAS 2008年第3期225-231,共7页
To overcome the problem of existing neighboring access point (AP) discovery methods in WLAN, for example they (PnP) of mul proposed. Us can not provide the accurate neighboring APs information needed for the Plug-... To overcome the problem of existing neighboring access point (AP) discovery methods in WLAN, for example they (PnP) of mul proposed. Us can not provide the accurate neighboring APs information needed for the Plug-and-Play ti-mode APs, three kinds of neighboring AP discovery and information exchange methods are ing these three neighboring AP discovery methods, passive discovery method, active discovery method and station assistant discovery method, the multi-mode AP can discover all neighboring APs and obtain needed information. We further propose two whole process flows, which combine three discovery methods in different manner, to achieve different goals. One process flow is to discover the neighboring AP as fast as possible, called fast discovery process flow. The other is to discover the neighboring AP with minimal interference to neighboring and accuracy of the method is confirmed APs, called the minimal interference process flow. The validity by the simulation. 展开更多
关键词 Plug-and-Play access point auto-configuration neighboring AP discovery WLAN
下载PDF
A NEW ROUTING ALGORITHM FOR THE SHUFFLE-EXCHANGE PERMUTATION NETWORK
3
作者 Baoxing CHEN Wenjun XIA Ni DU 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2006年第4期586-591,共6页
In this paper, a new routing algorithm is given for the shuffle-exchange permutation network (SEPn). The length of the path between any two nodes given by our algorithm is not more than 11/16n^2+O(n), i.e., the d... In this paper, a new routing algorithm is given for the shuffle-exchange permutation network (SEPn). The length of the path between any two nodes given by our algorithm is not more than 11/16n^2+O(n), i.e., the diameter of SEPn is at most 11/16n^2+ O(n). This improves on a 1/8(9n^2- 22n+24) routing algorithm described earlier by S. Latifi and P. K. Srimani. We also show that the diameter of SEPn is more than 1/2n^2-n. 展开更多
关键词 Cayley graph fixed degree routing shuffle-exchange permutation network.
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部