Hypercube中LIP长度的上下界估计  

Upper and lower bound evaluations of LIP in hypercube

作　　者：张玫[1] 

机构地区：[1]山东师范大学信息科学与工程学院,济南250014

出　　处：《计算机工程与应用》2007年第12期34-35,96,共3页Computer Engineering and Applications

基　　金：国家自然科学基金(the National Natural Science Foundation of China under Grant No.NSFC10471078)。

摘　　要：给出了超立方体网络中LIP容错模型的上下界估计及一个非常有意义的猜想,并且结合已有结果对上下界及猜想进行了验证。验证结果表明,对LIP的上下界估计,当n较小时还是比较好的;此外,猜想当n=2,3,4,5,6,7时均严格成立,具有非常好的理论价值和实际意义,有待进一步证明。The upper and lower bound evaluations of LIP fault-tolerant model in Hypercube are given and a very significant conjecture on the bound of LIP is obtained.Besides,the evaluations and the conjecture are tested with the help of the program. The results indicate that the evaluations work well when n is little and the conjection is strictly right when n equals 2,3,4,5, 6,7.The conjection,which needs to be proved,has very good theory value and practical significance.

关 键 词：互连网络 超立方体 容错 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]