作者机构：
[Cui, Jianqun; Jia, Keming; Gao, Kuan] Cent China Normal Univ, Sch Comp Sci, Wuhan, Peoples R China.;[Xiong, Naixue] Colorado Tech Univ, Sch Comp Sci, Colorado Springs, CO USA.;[Wu, Libing] Wuhan Univ, Sch Comp Sci, Wuhan, Peoples R China.
会议名称：
IEEE International Conference on Systems, Man, and Cybernetics (SMC)
会议时间：
OCT 13-16, 2013
会议地点：
Manchester, ENGLAND
会议主办单位：
[Xiong, Naixue] Colorado Tech Univ, Sch Comp Sci, Colorado Springs, CO USA.^[Cui, Jianqun;Jia, Keming;Gao, Kuan] Cent China Normal Univ, Sch Comp Sci, Wuhan, Peoples R China.^[Wu, Libing] Wuhan Univ, Sch Comp Sci, Wuhan, Peoples R China.
会议论文集名称：
IEEE International Conference on Systems Man and Cybernetics Conference Proceedings
关键词：
Coarse-grained matching;Gateway-level topology map;Topology-aware ALM systems
摘要：
Application Layer Multicast (ALM) systems can easily be deployed compared with IP multicast because they do not require any modification to the current Internet infrastructure. Topology-aware ALM systems make multicast forwarding path as far as possible to match the underlying physical paths. It can reduce redundant data packets and forwarding delay. So the source path topology map construction is more important in topology-aware ALM systems. We find that only the routers directly connecting to terminal nodes (usually as gateway) and their connection information are required to be added to the source path topology map. This kind of topology map is named as gateway-level map. In this paper, we first present a delay coarse-grained matching method to generate the gateway-level topology map. After that, the paper discusses some details such as how to get the topology information and how to build the map. Finally, performance analysis and simulation experiments demonstrate the conclusion that the method not only simplifies the information required by topology construction, but also accelerates the speed of accessing topological information. The time of application layer multicast nodes joining the multicast tree is reduced. This method also provides users the higher quality of service.
期刊：
International Journal of Advancements in Computing Technology,2012年4(21):517-525 ISSN：2005-8039
通讯作者：
Cui, J.(jqcui@126.com)
作者机构：
[Cui, Jianqun; Lai, Mincai; Chen, Chuanhe; Wu, Libing] School of Computer Science, Central China Normal University, Wuhan, China;[Yang, Yi] Department of Electrical Engineering and Computer Science, Catholic University of America, United States
通讯机构：
[Cui, J.] S;School of Computer Science, , Wuhan, China
关键词：
Application layer multicast;Overlay network;Streaming media
摘要：
At present, P2P streaming media live systems widely adopt application-layer multicast technology. In order to apply the high performance application-layer model to the live streaming media systems, this paper does research on a scalable and decentralized application-layer multicast infrastructure- Scribe, and then designs a distributed, robust and low-latency streaming media live system based on it. This system is built upon Pastry, a generic, scalable and efficient P2P system, and makes full use of Pastry's properties to form a decentralized, robust and self-organizing overlay network in the Internet. Besides, this paper takes QoS requirements into account in the process of group member joining to make it more suitable for live streaming media fields.
摘要：
NETCONF protocol as a new protocol make up the deficiencies of existing configuration management. It improves network efficiency and automation level. Based on the in-depth study of NETCONF protocol principles, this paper designs NETCONF network management software.
会议名称：
Pacific/Asia Workshop on Computational Intelligence and Industrial Application
会议时间：
DEC 19-20, 2008
会议地点：
Wuhan, PEOPLES R CHINA
会议主办单位：
[Peng, Xi;Zhang, Yugang;Xiao, Shisong;Wu, Zheng;Cui, JianQun;Chen, Limiao;Xiao, Debao] Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
摘要：
In the past several years, the alert correlation methods have been advocated to discover high-level attack scenarios by correlating the low-level alerts. The causal correlation method based on prerequisites and consequences has great advantages in the process of correlating alerts. But it must depend on complicated background knowledge base and has some limits in discovering new attacks. The cluster can aggregate the relational alerts by computing the similarity between alert attributes, as well as can discover new and simple high-level attacks. However, it is difficult to establish the attribute weights in the similarity membership function of two alerts and the threshold of classification similarity value. In order to solve the problem, the quantum-behaved particle swarm optimization algorithm is used to optimize the weights and similarity value. In view of the advantages and disadvantages of cluster and correlation, this paper uses improved cluster algorithm to optimize correlation in the process of attack detection. The experimental results on LLS DDoS1.0 prove that the method proposed is useful and effective.
期刊：
Lecture Notes in Computer Science,2007年4782:623-633 ISSN：0302-9743
通讯作者：
Cui, Jianqun
作者机构：
[Cui, Jianqun] Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.;[He, Yanxiang; Wu, Libing; Jin, Hui] Wuhan Univ, Sch Comp, Wuhan 430072, Peoples R China.;[Xiong, Naixue] Japan Adv Inst Sci &Technol, Informat Sci Sch, Nomi, Japan.;[Yang, Laurence T.] St Francis Xavier Univ, Dept Comp Sci, Antigonish, NS, Canada.
通讯机构：
[Cui, Jianqun] H;Huazhong Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
会议名称：
High Performance Computing and Communications, Third International Conference, HPCC 2007, Houston, USA, September 26-28, 2007, Proceedings
摘要：
Application-layer multicast (ALM) can solve most of the problems of IP-based multicast. Topology-aware approach of ALM is more attractive because it exploits underlying network topology data to construct multicast overlay networks. In this paper, a novel mechanism of overlay construction called Multi-domain Topology-Aware Grouping (MTAG) is introduced. MTAG manages nodes in the same domain by a special node named domain manager. It can save the time used to discover topology information and execute the path matching algorithm if there are some multicast members in the same domain. The mechanism can lower the depth of the multicast tree too. Simulation results show that nodes can acquire multicast service more quickly when the group size is large or the percentage of subnet nodes is high.
