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

2013 5th IEEE International Conference On Broadband Network & Multimedia Technology

作者： Huaibing QI Zhengyong FENG School of Physics and Electronic Information China West Normal University

Over the IEEE 802.11 WLANs, the basic(lowest) data rate is used for multicast. In this way, it guarantees all members of the multicast group can properly receive the packets. However, in video multica

ISBN: (纸本)9781479900961

关键词： WLAN Video multicast Dynamic grouping QoS wireless local area network (WLAN) Quality of service multicast Videotapes data packets Network throughput multicast algorithms MEMBERS MPEG 4 Standard dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Bi-vector balance hierarchical multicast architecture algorithms for Data Grid

Bi-vector balance hierarchical multicast architecture algori...

引用

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Qingfeng Fan Qiongli Wu Frédéric Magoules Yanxiang He MAS Ecole Centrale de Paris France School of computer Wuhan University of China China Ecole Centrale de Paris France INRIA Saclay île-de-France France MAS Ecole Centrale de Paris France School of computer Wuhan University of China China

For massive data transmission in Data Grid supporting radio and wireless, a set of novel hierarchical multicast algorithms is proposed to attain higher efficiency of data transfers. The newly-proposed algorithms first form different clusters, second calculate the space weight vector W' and the data quantity weight vector W'' in very cluster. Then the algorithms try to find a new vector W composed by linear combination of the two old ones W' and W". The space factor and data factor game and balance, and the point of game and balance is ¿ i ¿ j=0 m-1 w i, j ' = ß i ¿ j=0 m-1 w i, j " a built a binary simple equation, and we sought linear parameters and generate a least weight path tree, namely multicast tree, which is then constructed by using the newly-proposed algorithms to implement the inter-cluster routing. Extended simulation results indicate that the new algorithms are more suitable for Data Grid.

关键词： multicast algorithms Clustering algorithms Vectors Computer architecture Grid computing Equations Routing Mobile communication Underwater communication Helium

来源：评论

学校读者我要写书评

暂无评论

QoS multicast routing algorithms based on Tabu Search with Elite candidate list

QoS multicast routing algorithms based on Tabu Search with E...

引用

International Conference on Application of Information and Communication Technologies (AICT)

作者： Mahsa Armaghan Abolfazl T. Haghighat Mohammadreza Armaghan Department of Electrical Computer & IT Islamic Azad University Qazvin Branch Qazvin Iran Islamic Azad University Tehran Tehran IR Department of Computer Engineering Islamic Azad University Tehran-South Branch Tehran Iran

Quality-of-Service multicast routing is a well-known NP-complete problem as constrained Steiner tree problem, which has various real-time multimedia applications in highspeed networks. The bandwidth-delay-constrained least-cost multicast routing algorithms based on Tabu Search are proposed in this paper. These algorithms can improve the search speed, and make a better solution by using one of the neglected aspects of Tabu Search, candidate list strategy. We evaluate the performance and efficiency of the proposed algorithms on a variety of random generated networks. Evaluation results indicate that the proposed algorithms overcome the other existing short-term memory version of TS-based algorithms and heuristics regarding average tree cost and running time.

关键词： Routing multicast algorithms Quality of service Costs Computer networks NP-complete problem Heuristic algorithms Communication networks Competitive intelligence Application software

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of application-level multicast routing algorithms for supporting multipoint interaction synchronization

Performance analysis of application-level multicast routing ...

引用

IEEE Latin-American Conference on Communications, LATINCOM

作者： Shan Jiang Qinghua Zheng Wei Chen Jin Cao MOE KLINNS Laboratory and SKLMS Lab Department of Computer Science and Technology Xi'an Jiaotong University Xi'an China

Multipoint Video Conferencing (MVC) where multiple participants can be simultaneous sources of video requires low-delay, low packet loss and multipoint interaction synchronization. However, the synchronization issue is ignored by existing application-level multicast schemes and usually, it is addressed by a dedicated synchronizing controller at each peer. The controller needs to implement complicated time-consuming operations to synchronize multiple interactive media streams. Unlike the existing application-level multicast schemes, this paper introduces an idea that the synchronization problem is solved in the process of application-level multicast routing, without using the dedicated synchronizing controller. Furthermore, the low-delay multicast communication is achieved on base of the idea. The contributions of this paper include: *** concept that application-level multicast routing algorithms support multipoint interaction synchronization is defined by us; *** effective lowdelay multicast routing algorithm that supports multipoint interaction synchronization is proposed; *** analysis of our algorithm and the existing similar algorithm is carried out. Finally, simulation experiments demonstrate our algorithm is correct and effective.

关键词： Performance analysis Routing multicast algorithms Synchronization Streaming media Videoconference Delay Analytical models Communication system control Traffic control

来源：评论

学校读者我要写书评

暂无评论

Supporting Efficient Collective Communication in NoCs

Supporting Efficient Collective Communication in NoCs

引用

18th IEEE International Symposium on High-Performance Computer Architecture (HPCA)

作者： Ma, Sheng Jerger, Natalie Enright Wang, Zhiying Natl Univ Def Technol Sch Comp Changsha Hunan Peoples R China Univ Toronto Dept Elect & Comp Engn Toronto ON Canada

ISBN: (纸本)9781467308243;9781467308267

Across many architectures and parallel programming paradigms, collective communication plays a key role in performance and correctness. Hardware support is necessary to prevent important collective communication from becoming a system bottleneck. Support for multicast communication in Networks-on-Chip (NoCs) has achieved substantial throughput improvements and power savings. In this paper, we explore support for reduction or many-to-one communication operations. As a case study, we focus on acknowledgement messages (ACK) that must be collected in a directory protocol before a cache line may be upgraded to or installed in the modified state. This paper makes two primary contributions: an efficient framework to support the reduction of ACK packets and a novel Balanced, Adaptive multicast (BAM) routing algorithm. The proposed message combination framework complements several multicast algorithms. By combining ACK packets during transmission, this framework not only reduces packet latency by 14.1% for low-to-medium network loads, but also improves the network saturation throughput by 9.6% with little overhead. The balanced buffer resource configuration of BAM improves the saturation throughput by an additional 13.8%. For the PARSEC benchmarks, our design offers an average speedup of 12.7% and a maximal speedup of 16.8%.(1)

关键词： role performance TNK2 gene SMC3 gene multicast algorithms PARSEC Communication Research Packet multicast communication NOCT gene Throughput Speeding

来源：评论

学校读者我要写书评

暂无评论

GRASP-BSMA: A Fast Algorithm for Delay Constrained multicast Routing

GRASP-BSMA: A Fast Algorithm for Delay Constrained Multicast...

引用

IEEE International Conference on Communications (ICC)

作者： Feng, Gang Univ Wisconsin Dept Elect Engn Platteville WI 53818 USA

ISBN: (纸本)9781457720536

Constrained minimum Steiner tree (CMST) problem is a key issue in multicast routing with quality of service (QoS) support. Many heuristics have been developed to solve this NP-complete problem. In recent years, some interesting work has been done to use the greedy randomized adaptive search procedure (GRASP) to solve this problem. While it helps to achieve very high success ratios of finding optimal solutions on networks of small or medium sizes (less than 100 nodes), a high computation time is also required, usually in the range of tens of seconds. Considering a normal call admission time is expected to be in the range of tens or hundreds of milliseconds and network sizes may become much larger, it is worth developing algorithms that can run faster while keeping the tree cost at an acceptable level. In this paper, an algorithm called GRASP-BSMA is proposed for such purpose. By using an efficient procedure to construct the initial feasible solution, together with the best implementation of the bounded shortest multicast algorithm (BSMA), the proposed algorithm well meets the expectations.

关键词： multicast Nondeterministic polynomial-time hard optimal solution Network routing greedy method time delay Quality of service MILLISECOND computational time Fasting multicast algorithms algorithms

来源：评论

学校读者我要写书评

暂无评论

Layered multicast With Inter-Layer Network Coding for Multimedia Streaming

引用

IEEE TRANSACTIONS ON MULTIMEDIA 2011年第2期13卷 353-365页

作者： Shao, Mingkai Dumitrescu, Sorina Wu, Xiaolin McMaster Univ Dept Elect & Comp Engn Hamilton ON Canada

Multirate multicast is a powerful methodology of multimedia communication in heterogenous networks. A variant of multirate multicast motivated by scalable multimedia streaming is layered multicast, where the transmitted signal is presented in successive data layers. With recent advances of network coding theory, many layered multicast schemes using network coding have been proposed to improve the performance of traditional routing-based layered multicast. They divide the network into different layers and construct a unirate multicast network code for each layer. However, these schemes do not perform network coding between data layers, and consequently cannot realize the full potential of network coding. In this paper, we propose a novel approach to layered multicast that allows network coding of data in different layers. This relaxation lends the proposed scheme greater flexibility in optimizing the data flow than previous layered solutions, and thus achieves higher throughput.

关键词： multicast algorithms multimedia communication network coding optimization scalable source coding

来源：评论

学校读者我要写书评

暂无评论

Churn-Resilient Protocol for Massive Data Dissemination in P2P Networks

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2011年第8期22卷 1342-1349页

作者： Li, Zhenyu Xie, Gaogang Hwang, Kai Li, Zhongcheng Chinese Acad Sci Inst Comp Technol Beijing 100190 Peoples R China Univ So Calif Dept Elect Engn Los Angeles CA 90089 USA

Massive data dissemination is often disrupted by frequent join and departure or failure of client nodes in a peer-to-peer (P2P) network. We propose a new churn-resilient protocol (CRP) to assure alternating path and data proximity to accelerate the data dissemination process under network churn. The CRP enables the construction of proximity-aware P2P content delivery systems. We present new data dissemination algorithms using this proximity-aware overlay design. We simulated P2P networks up to 20,000 nodes to validate the claimed advantages. Specifically, we make four technical contributions: 1). The CRP scheme promotes proximity awareness, dynamic load balancing, and resilience to node failures and network anomalies. 2). The proximity-aware overlay network has a 28-50 percent speed gain in massive data dissemination, compared with the use of scope-flooding or epidemic tree schemes in unstructured P2P networks. 3). The CRP-enabled network requires only 1/3 of the control messages used in a large CAM-Chord network. 4) Even with 40 percent of node failures, the CRP network guarantees atomic broadcast of all data items. These results clearly demonstrate the scalability and robustness of CRP networks under churn conditions. The scheme appeals especially to web-scale applications in digital content delivery, network worm containment, and consumer relationship management over hundreds of datacenters in cloud computing services.

关键词： P2P networks data dissemination multicast algorithms distributed systems cloud computing

来源：评论

学校读者我要写书评

暂无评论

Linear Optimal Hierarchical multicast Tree algorithms for P2P Database

Linear Optimal Hierarchical Multicast Tree Algorithms for P2...

引用

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Qingfeng Fan Frédéric Magoulès Qiongli Wu Yanxiang He School of Computer Wuhan University Wuhan Hubei China Applied Mathematics and Systems laboratory Ecole Centrale Paris Chatenay-Malabry France

For attained high data multicast efficiency for the P2P database system, the paper proposes a set of novel multicast algorithms. In contrast with the current algorithms, the new algorithms firstly divide the group members into different clusters in terms of static delay distance, then find the central node in the clusters, calculate the space weight of every node, search the data quantity of every node, and find the maximal data quantity node. After obtaining the spatial weight vector and the data quantity weight vector, the algorithms try to find a new vector composed by linear combination of the spatial and data weight vectors. Then the algorithms build binary simple equations between them, seek linear modulus and generate a least weight path tree, namely multicast tree. The multicast tree is then constructed by using the new algorithms. Extended simulation results indicate that these new algorithms are more suitable for P2P Database compared with other well-known existing multicast solutions.

关键词： multicast algorithms Databases Clustering algorithms Vectors Routing Delay Equations Mobile computing Sensor systems Mathematics

来源：评论

学校读者我要写书评

暂无评论

multicast algorithms for Multi-Channel Wireless Mesh Networks

Multicast Algorithms for Multi-Channel Wireless Mesh Network...

引用

The 15th IEEE International Conference on Network Protocols(ICNP 2007)(第15届IEEE国际网络协议大会)

作者： Guokai Zeng Bo Wang Yong Ding Li Xiao Matt Mutka Department of Computer Science and Engineering Michigan State University

multicast is a key technology that provides efficient data communication among a set of nodes for wireless multi-hop networks. In sensor networks and MANETs, multi cast algorithms are designed to be energy efficient and to achieve optimal route discovery among mobile nodes, respectively. However, in wireless mesh networks, which are required to provide high quality service to end users as the "last-mile" of the Internet, throughput maximization conflicting with scarce bandwidth has the paramount priority. We propose a Level Channel Assignment (LCA) algorithm and a Multi-Channel multicast (MCM) algorithm to optimize throughput for multi-channel and multi interface mesh networks. The algorithms first build a multicast structure by minimizing the number of relay nodes and hop count distances between the source and destinations, and use dedicated channel assignment strategies to improve the network capacity by reducing interference. We also illustrate that the use of partially overlapping channels can further improve the throughput. Simulations show that our algorithms greatly outperform the single-channel multicast algorithm. We observe that MCM achieves better throughput and shorter delay while LCA can be realized in distributed manner.

关键词： multicast algorithms Wireless mesh networks Throughput Data communication Wireless sensor networks Spread spectrum communication Algorithm design and analysis Energy efficiency IP networks Web and internet services

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：