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

37th Chinese Control Conference (CCC)

作者： Long, Dan Li, Xiaohui Ding, Yuemin Liu, Zhenxing Wuhan Univ Sci & Technol Coll Informat Sci & Engn Wuhan 430081 Hubei Peoples R China Tianjin Univ Technol Coll Comp & Commun Engn Tianjin 300384 Peoples R China

ISBN: (纸本)9789881563958

Due to the smart device with heavy load may be far away from the control center, the multicast routing algorithm that only based on delay constraint applied in smart grids will cause the longer communication delay for high power intelligent device. Designing a suitable routing algorithm to reduce the communication delay and balance the electricity demand response of smart grids is highly required. Therefore, the multicast routing algorithm under Demand Response Constraint (MRA-DRC) was proposed. However, when using this method in real power grid communication network, the topology of network model has a great influence on the performance of the proposed algorithm. Accordingly, the performance analysis of MRA-DRC running in different network models constructed by complex theory was presented in this paper. The simulation results and performance analysis will help the engineers to improve the communication network when using the proposed algorithm in smart grids.

关键词： smart grids multicast routing algorithm delay Demand Response (DR) complex networks

来源：评论

学校读者我要写书评

暂无评论

A multicast routing algorithm based on searching in directed graph

引用

APPLIED MATHEMATICS AND COMPUTATION 2011年第7期218卷 3723-3732页

作者： Sun Zhixin Xu Yuhua Gong Jing Ren Zhiguang Nanjing Univ Posts & Telecommun Minist Educ Key Lab Broadband Wireless Commun & Sensor Networ Nanjing 210003 Peoples R China Nanjing Univ State Key Lab Novel Software Technol Nanjing 210093 Peoples R China

Aiming at constructing a delay and delay variation bounded Steiner tree in the real-time streaming media communication, in this paper, we discuss a multicast routing algorithm based on searching a directed graph (MRASDH). During the process of the construction of the multicast tree, some nodes and links in the network topology do not affect the outcome of the constructed tree. Therefore, based on the thought of shrinking the search space through deleting these non-relative nodes and edges to the utmost, the ant algorithm is utilized to generate a directed sub-graph of the network topology for each destination node, in which each node owns a bounded out-degree. And all these sub-graphs can be merged into a new directed graph that serves as the new search space. In the new space, the simulated annealing algorithm is applied to obtain a multicast tree that satisfies the condition for the optimization. The performance analysis and simulation results demonstrate that this algorithm can effectively construct a delay and delay variation bounded multicast tree. They also show that the algorithm have lower time complexity than the current ones, which means a much better result would be achieved when the system scale rises greatly. (C) 2011 Elsevier Inc. All rights reserved.

关键词： multicast routing algorithm Delay and delay variation bounded Directed graph Ant algorithm Simulated annealing algorithm

来源：评论

学校读者我要写书评

暂无评论

A Comparative Study of multicast routing under DR Constraint for Smart Grids

A Comparative Study of Multicast Routing under DR Constraint...

引用

第37届中国控制会议

作者： Dan Long Xiaohui Li Yuemin Ding Zhenxing Liu College of Information Science and Engineering Wuhan University of Science and Technology College of Computer and Communication Engineering Tianjin University of Technology

Due to the smart device with heavy load may be far away from the control center,the multicast routing algorithm that only based on delay constraint applied in smart grids will cause the longer communication delay for high power intelligent *** a suitable routing algorithm to reduce the communication delay and balance the electricity demand response of smart grids is highly ***,the multicast routing algorithm under Demand Response Constraint(MRA-DRC) was ***,when using this method in real power grid communication network,the topology of network model has a great influence on the performance of the proposed ***,the performance analysis of MRA-DRC running in different network models constructed by complex theory was presented in this *** simulation results and performance analysis will help the engineers to improve the communication network when using the proposed algorithm in smart grids.

关键词： smart grids multicast routing algorithm delay Demand Response(DR) complex networks

来源：评论

学校读者我要写书评

暂无评论

Integrated multicast routing algorithms considering traffic engineering for broadband IPTV services

引用

EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING 2013年第1期2013卷 1-10页

作者： Youm, Sungkwan Shon, Taeshik Kim, Eui-Jik Samsung Elect Co Ltd Telecommun Syst Div Suwon 443742 South Korea Ajou Univ Div Informat & Comp Engn Suwon 443749 South Korea KT Corp Adv Inst Technol Seoul 137792 South Korea

With the rapid growth of broadband network deployment and multimedia streaming development, Internet protocol (IP) multicast networks have become a delivery mechanism for Internet protocol television (IPTV). IPTV provides a two-way interactive service to the viewers, which generates the path request for IP multicast network. Thus, it is essential to evaluate the path rejection probability accurately and further to reduce it. In this paper, we propose a new dynamic multicast routing algorithm for broadband IPTV services and apply it to three legacy algorithms. These integrated multicast routing algorithms support the minimum cost and the traffic engineering features, in order to maximize the acceptance rate for bandwidth constraint path request under IPTV service environments. Furthermore, we compare their network performances in terms of the acceptance rate and delay by experimental simulations. The simulation result gives us that the nearest node first Dijkstra algorithm can be the optimal solution of multicast connection for IPTV service delivery.

关键词： Internet protocol television multicast routing algorithm Quality of service Traffic engineering

来源：评论

学校读者我要写书评

暂无评论

ESC: Estimation of selecting core for reducing multicast delay variation under delay constraints

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2011年第1期24卷 40-52页

作者： Kim, Moonseong Mutka, Matt W. Kim, Hye-Young Hongik Univ Sch Games Game Software Seoul South Korea Michigan State Univ Dept Comp Sci & Engn E Lansing MI 48824 USA

With the spread of multimedia group applications, the construction of multicast trees satisfying the Quality of Service (QoS) requirements becomes a problem of prime importance. A principal factor of these real-time applications is to optimize the delay- and delay variation-bounded multicast tree (DVBMT) problem. This problem is to satisfy the minimum delay variation and the end-to-end delay within an upper bound. The DVBMT problem is known as an NP-complete problem. The representative algorithms are the DVMA, the DDVCA, and the ECS algorithm. In this paper, we show that the proposed ESC algorithm outperforms the DDVCA and the ECS algorithm. The efficiency of our algorithm is verified through performance evaluation and the enhancement is up to about 19.6% in terms of normalized surcharge for multicast delay variation. The time complexity of our algorithm is O(mn(2)), which is comparable to the well-known DDVCA. Copyright (C) 2010 John Wiley & Sons, Ltd.

关键词： multicast routing algorithm delay- and delay variation-bounded multicast tree (DVBMT) problem Steiner trees

来源：评论

学校读者我要写书评

暂无评论

Research on the routing algorithm Based Greedy multicast algorithm

Research on the Routing Algorithm Based Greedy Multicast Alg...

引用

The 2010 International Conference on Computer Application and System Modeling(2010计算机应用与系统建模国际会议 ICCASM 2010)

作者： LuQingmei HeLilin Department of Electronic Science and Technology North University of China Taiyuan Shanxi China Shenzhen Clou Electronics Co. Ltd Shenzhen China 518057

ISBN: (纸本)9781424472352

Because all the nodes are multi-cast, the minimum spanning tree is the best, therefore, it is expected by the niche tree dynamic greed multicast routing algorithms produce more of the performance with a reasonable level. As for the greedy algorithm and the text of the characters tree dynamic greedy algorithm are made detailed emulation, Simulations result indicates that the results of the algorithm in multicast node are with greater density of the advantages and it shows that the invalid in other cases were acceptable, and has complicated the low quality.

关键词： computer networks multicast routing algorithm dynamic multi astrouting algorithm

来源：评论

学校读者我要写书评

暂无评论

On Minimum Cost multicast routing Based on Cost Prediction

引用

JOURNAL OF COMMUNICATIONS AND NETWORKS 2009年第5期11卷 500-508页

作者： Kim, Moonseong Mutka, Matt W. Hwang, Dae-Jun Choo, Hyunseung Sungkyunkwan Univ Sch Informat & Commun Engn Suwon 440746 South Korea Michigan State Univ Dept Comp Sci & Engn E Lansing MI 48824 USA

We have designed an algorithm for a problem in multicast communication. The problem is to construct a multicast tree while minimizing its cost, which is known to be NP-complete. Our algorithm, which employs new concepts defined as potential cost and spanning cost, generates a multicast tree more efficiently than the well-known heuristic called Takahashi and Matsuyama (TM) [1] in terms of tree cost. The time complexity of our algorithm is O(kn(2)) for an n-node network with k members in the multicast group and is comparable to the TM. Our empirical performance evaluation comparing the proposed algorithm with TM shows that the enhancement is up to 1.25%similar to 4.23% for each best case.

关键词： Minimal Steiner trees minimum cost trees multicast communications multicast routing algorithm Takahashi and Matsuyama (TM) algorithm

来源：评论

学校读者我要写书评

暂无评论

Advanced bounded shortest multicast algorithm for delay constrained minimum cost

Advanced bounded shortest multicast algorithm for delay cons...

引用

7th International Conference on Computational Science (ICCS 2007)

作者： Kim, Moonseong Jho, Gunu Choo, Hyunseung Sungkyunkwan Univ Sch Informat & Commun Engn Seoul South Korea Samsung Elect Telecommun Network business Seoul South Korea

ISBN: (纸本)9783540725831

The Bounded Shortest multicast algorithm (BSMA) is a very well-known one of delay-constrained minimum-cost multicast routing algorithms. Although the algorithm shows excellent performance in terms of generated tree cost, it suffers from high time complexity. For this reason, there is much literature relating to the BSMA. In this paper, the BSMA is analyzed. The algorithms and shortcomings are corrected, and an improved scheme is proposed without changing the main idea of the BSMA.

关键词： multicast routing algorithm delay-bounded minimum steiner tree (DBMST) problem and bounded shortest multicast algorithm (BSMA)

来源：评论

学校读者我要写书评

暂无评论

Lifetime-aware multicast routing in wireless ad hoc networks

Lifetime-aware multicast routing in wireless ad hoc networks

引用

IEEE Wireless Communications and Networking Conference

作者： Maleki, M Pedram, M Univ So Calif Dept EE Syst Los Angeles CA 90089 USA

ISBN: (纸本)0780383443

One of the main design constraints in mobile ad hoc networks (MANETs) is that they are energy constrained. Hence, routing algorithms must be developed to consider energy, consumption of the nodes in the network as a primary goal. In MANETS, every node has to perform the functions of a router. So if some nodes die early due to lock of energy and/or the network becomes fragmented, then it will not be possible for other nodes in the network to communicate with each other. This paper presents a lifetime-aware multicast routing algorithm that maximizes the ad hoc network lifetime by finding routing solutions that minimize the variance of the remaining energies of the nodes in the network. Extensive simulation results are provided to evaluate the performance of the new routing algorithm compared to a number of different metrics and in comparison to a variety of existing multicast routing a algorithms.

关键词： mobile radio ad hoc networks multicast protocols routing protocols mobile ad hoc network lifetime routing solutions MANET energy consumption multicast routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A fuzzy multicast routing algorithm for interaction and co-operative system over the Internet

A fuzzy multicast routing algorithm for interaction and co-o...

引用

International Conference on Info-Tech and Info-Net (ICII 2001)

作者： Tian, YS Hou, YB Qian, Y Chen, YB Li, Y Dan, ZP Huang, ZQ Xian Jiaotong Univ Coll Engn Comp & Informat Technol Inst Xian 710049 Peoples R China

ISBN: (纸本)7900081585

Cost and network delay are two important requirements of multicast routing, and they effect each other. According to the cost importance, users were divided into three classes. Most of users haven't clear requirements of the cost and network delay, so we introduce the belong function of fuzzy logic into multicast routing algorithm. Through the membership function, fuzzy multicast routing algorithm transforms cost and network delay into weight. Weight is the only parameter when select the multicast routing. Simulations had shown that costs can be reduced by adjusting the belong function.

关键词： interaction and co-operative multicast routing algorithm fuzzy multicast routing algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：