检索结果-内蒙古大学图书馆

Novel fast handoff solution based on Cache update for WLAN

Dongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Southeast University (Natural Science Edition) 2008年第SUPPL. 1期38卷 204-208页

作者： Xu, Wei Yang, Yi Xia, Qin Tao, Jun Wang, Cuihan School of Computer Science and Engineering Southeast University Nanjing 210096 China Key Laboratory of Computer Network and Information Integration Southeast University Nanjing 210096 China

Through analysis of the process of handoff and existing improvement program, a novel Cache update solution is proposed. It is composed of slice Cache update algorithm, which contains a Cache update trigger mechanism based on dynamic domain values, AP(access point) load balancing and a Cache update strategy based on slice channel scanning. Experiment results show that this solution can effectively avoid Cache updates when STA (station) is stable and the associated AP's signal is good. While ensuring the timely update of the Cache it can reduce the cost of each Cache update and the handoff delay. Meanwhile the load balancing of each AP can be well considered while choosing the AP. Therefore, the solution is able to significantly improve the mobile terminals handoff performance between AP.

关键词： Wireless local area networks (WLAN)

来源：评论

学校读者我要写书评

暂无评论

Limitedly dividable stream-based modeling and performance analysis of P2P streaming networks

引用

Dongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Southeast University (Natural Science Edition) 2008年第SUPPL. 1期38卷 145-149页

作者： Wu, Jiagao Tao, Jun Zou, Zhiqiang Institute of Computer Technology College of Computer Nanjing University of Posts and Telecommunications Nanjing 210003 China Key Laboratory of Computer Network and Information Integration Southeast University Nanjing 210096 China

Due to the deficiency of fluid-based (FB) P2P network model in dealing with the stream which could not be divided infinitely, a limitedly dividable stream-based (LDSB) model was studied and proposed for P2P streaming networks. A close-form expression of maximum universal streaming rate of LDSB model was given and proved in theory. The results of theoretical analysis and numerical calculation show that the maximum universal streaming rate of LDSB model can not be greater than that of FB model because of the limitation of minimum sub streaming rate. However, with the decrease of minimum sub streaming rate, the performance of LDSB model would approximate to FB model. In addition, by choosing appropriate system parameters such as minimum sub streaming rate and server upload rate, etc., the performance of LDSB system may reach the upper limit of FB model's theoretical performance, and unnecessary waste of resources in system deployment can be avoided.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

Components Selection Methods for Enterprise Interoperability in Multi Domain Models

引用

IFAC Proceedings Volumes 2008年第2期41卷 11919-11924页

作者： Ke FENG Xiaoping LI Qian WANG Jingjing SHAN School of Computer Science & Engineering Southeast University 210096 Nanjing P.R. China Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education

Component-based development is gradually showing its advantages in building complex systems with shorter time and less cost than traditional methods. However, mismatching and semantic are key problems in component searching process. In this paper, a function description model is proposed to precisely and completely describe the user requirements and component function based on domain models. In the component selection process, a sophisticated matching algorithm is introduced for semantic problems in matching two activity profiles derived from different domain models. A component selection method is also presented to improve interoperability for multi domain models, followed by the implemented prototype of the proposed methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A collaboration scheme for making peer-to-peer anonymous routing resilient

A collaboration scheme for making peer-to-peer anonymous rou...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Xiaogang Wang Junzhou Luo Key Laboratory of Computer Network and Information Integration Ministry of Education South-East University Nanjing China Southeast University Nanjing Jiangsu CN

ISBN: (纸本)9781424416509

Node churn is one hurdle to using peer-to-peer (P2P) networks as anonymous networks, which makes the anonymous path fragile and results in message loss and communication failures. A collaboration scheme including friendly neighbor-based incentive (FNI) and re-encryption mechanism is proposed to deal with the high node churn (changes in system membership) characteristic of unstructured P2P networks. The simple FNI mechanism is presented to encourage peers to forward other peers' queries, and establish more connections to improve the performance of P2P overlay network where only stable and well-behaved nodes can be chosen as relay nodes to prolong single path durability. The re-encryption mechanism is designed to replace those failed relay nodes and achieve routing resilience upon different node availabilities in real- world systems. The results from our security analysis and simulation show that the collaboration scheme greatly improves routing resilience and maintains low latencies and low communication overhead.

关键词： Collaboration Peer to peer computing Routing Relays Multicast protocols Resilience Bandwidth Public key Mesons computer science

来源：评论

学校读者我要写书评

暂无评论

Maximizing Universal Streaming Rate in Peer-to-Peer Streaming networks

Maximizing Universal Streaming Rate in Peer-to-Peer Streamin...

引用

International Conference on Grid and Cooperative Computing (GCC)

作者： Jiagao Wu Jun Tao Zhiqiang Zou Institute of Computer Technology College of Computer Nanjing University of Posts and Telecommunications Nanjing China Key Laboratory of Computer Network and Information Integration of Ministry of Education South-East University Nanjing China

ISBN: (纸本)9781424432806

Although a large number of different proposals have emerged in recent years, a fundamental problem of P2P streaming networks concerned about is to establish an optimal routing structure with achieving certain optimization metric. In this paper, we focus on the problem of maximizing universal streaming rate in P2P streaming networks with constrained neighborhood. Firstly, we extend the fluid-based model and propose a new P2P streaming network model taking the neighborhood constraint into account. Second, we formulate the problem of maximizing the universal streaming rate in the new model. After proving its NP-hardness, we propose a heuristic multiple trees packing algorithm and corresponding optimum strategies. The simulation results show that the algorithm can achieve the theoretical upper bound of the universal streaming rate in fluid-based model without constrained neighborhood. While neighborhood constraint is considered, in addition, the universal streaming rate will have different decline according to various intensity of neighborhood constraint.

关键词： Peer to peer computing Streaming media computer networks Grid computing Telecommunication computing Bandwidth Routing Educational technology Educational institutions Proposals

来源：评论

学校读者我要写书评

暂无评论

A NEW HYBRID GENETIC ALGORITHM FOR THE BI-CRITERIA NO-WAIT FLOWSHOP SCHEDULING PROBLEM WITH MAKESPAN AND TOTAL FLOW TIME MINIMIZATION

A NEW HYBRID GENETIC ALGORITHM FOR THE BI-CRITERIA NO-WAIT F...

引用

2008 International Conference on Machine Learning and Cybernetics(2008机器学习与控制论国际会议)

作者： YOU-GEN LIU XIA ZHU XIAO-PING LI School of Computer Science and Engineering Southeast University Nanjing P.R.China Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University Nanjing P.R.China

Multi-objective flowshop scheduling problems have gained wide attention both in practical and academic fields. In this paper, a hybrid multi-objective genetic algorithm is proposed to solve multi-objective no-wait flowshop scheduling problems with both the makespan and the total flow time minimization. The proposed algorithm makes use of the principle of non-dominated sorting, coupled with the use of elitist solutions strategy. To improve efficiency, two effective multi-objective local search procedures based on objective increment are applied on each chromosome in the archive. Experimental results show that the proposal outperforms the other three heuristics both on effectiveness and efficiency.

关键词： Bi-criteria No-wait flowshop Objective increment Genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

OBJECTIVE INCREMENT BASED HYBRID GA FOR NO-WAIT FLOWSHOPS

OBJECTIVE INCREMENT BASED HYBRID GA FOR NO-WAIT FLOWSHOPS

引用

2008 International Conference on Machine Learning and Cybernetics(2008机器学习与控制论国际会议)

作者： XIA ZHU XIAOPING LI QIAN WANG School of Computer Science and Engineering Southeast University Nanjing P.R.China Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University Nanjing P.R.China

No-wait flowshops with flowtime minimization are typical NP-Complete combinatorial optimization problems, widely existing in practical manufacturing systems. Different from traditional methods by which objective of a new schedule being completely computed objective increment methods are presented in this paper by which the objective of an offspring being obtained just by objective increments and computational time can be considerably reduced. HGAI (Hybrid GA based on objective Increment) is proposed by integrating genetic algorithm with a local search method. A heuristic is constructed to generate an individual of initial population and a crossover operator is introduced for mating process. HGAI is compared with two best so far algorithms for the considered problem on 110 benchmark instances. Computational results show that HGAI outperforms the existing two in effectiveness with a little more computation time.

关键词： No-wait flowshops Flowtime Objective increment Hybrid genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Hybrid heuristic for total flowtime minimization in no-wait flow shops

Hybrid heuristic for total flowtime minimization in no-wait ...

引用

11th International Conference on computer Supported Cooperative Work in Design, CSCWD 2007

作者： Zhu, Xia Li, Xiaoping Wang, Qian School of Computer Science and Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University Nanjing China

ISBN: (纸本)1424409632

In this paper, no-wait flow shop scheduling problem with total flowtime minimization is considered. A hybrid heuristic is proposed, which is based on PH1 (p) (presented by Aldowaisan and Allahverdi, OMEGA, 2004). A composite algorithm is adopted to generate the initial seed. Job insertion in PH1 (p) is replaced with an existing constructive heuristic. Experimental results show that the proposal outperforms PH1 (p), especially for large scale instances. ©2007 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

An improved algorithm for Eleman Neural network by adding a modified error function 1

引用

4th International Symposium on Neural networks, ISNN 2007

作者： Zhang, Zhiqiang Tang, Zheng Tang, GuoFeng Vairappan, Catherine Wang, XuGang Xiong, RunQun Faculty of Engineering Toyama University Gofuku 3190 Toyama shi 930-8555 Japan Institute of Software Chinese Academy of Sciences Beijing 100080 China Key Lab. of Computer Network and Information Integration Southeast University Nanjing 210096 China

ISBN: (数字)9783540723936

ISBN: (纸本)9783540723929

The Eleman Neural network has been widely used in various fields ranging from temporal version of the Exclusive-OR function to the discovery of syntactic categories in natural language date. However, one of the problems often associated with this type of network is the local minima problem which usually occurs in the process of the learning. To solve this problem, we have proposed an error function which can harmonize the update weights connected to the hidden layer and those connected to the output layer by adding one term to the conventional error function. It can avoid the local minima problem caused by this disharmony. We applied this method to the Boolean Series Prediction Questions problems to demonstrate its validity. The result shows that the proposed method can avoid the local minima problem and largely accelerate the speed of the convergence and get good results for the prediction tasks. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Hybrid Heuristic for Total Flowtime Minimization in No-wait Flow Shops

Hybrid Heuristic for Total Flowtime Minimization in No-wait ...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Xia Zhu Xiaoping Li Qian Wang School of Computer Science and Engineering Key Laboratory of Computer Network and Information Integration Ministry of Education South-East University Nanjing China

ISBN: (纸本)1424409624

In this paper, no-wait flow shop scheduling problem with total flowtime minimization is considered. A hybrid heuristic is proposed, which is based on PHI (p) (presented by Aldowaisan and Allahverdi, OMEGA, 2004). A composite algorithm is adopted to generate the initial seed. Job insertion in PHI (p) is replaced with an existing constructive heuristic. Experimental results show that the proposal outperforms PHI (p), especially for large scale instances.

关键词： Job shop scheduling Large-scale systems Manufacturing Chemical technology Collaborative work Design engineering Laboratories computer networks Processor scheduling Proposals

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：