检索结果-南通市图书馆

A Distributed routing and Wavelength Assignment Algorithm for Online multicast in All-Optical WDM Networks

在线全文

cnki会议

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2002年第1期7卷 27-36页

作者： Huang Chuan-he, Chen Xin-meng, Jia Xiao-hua School of Computer, Wuhan University, Wuhan 430072, Hubei, China School of Computer Wuhan University Wuhan Hubei China

routing and wavelength assignment for online real-time multicast connection setup is a difficult task due to the dynamic change of availabilities of wavelengths on links and the consideration of wavelength conversion delay in WDM networks. This paper presents a distributed routing and wavelength assignment scheme for the setup of real-time multicast connections. It integrates routing and wavelength assignment as a single process, which greatly reduces the connection setup time. The proposed routing method is based on the Prim’s MST (Minimum Spanning Tree) algorithm and the K-restricted breadth-first search method, which can produce a sub-minimal cost tree under a given delay bound. The wave-length assignment uses the least-conversion and load balancing strategies. Simulation results show that the proposed algorithm is suitable for online multicast connection establishment in WDM networks.

关键词： Key words WDM networks routing and wavelength assignment multicast routing delay bounded routing

QUANTIFIED COST-BALANCED routing SCHEME FOR OVERLAY multicast

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Journal of Electronics(China) 2006年第6期23卷 882-887页

作者： Lu Jun Ruan Qiuqi Institute of Information Science Beijing Jiaotong University Beijing 100044 China

This paper focuses on the quantitative analysis issue of the routing metrics tradeoff problem, and presents a Quantified Cost-Balanced overlay multicast routing scheme (QCost-Balanced) to the metric tradeoff problem between overlay path delay and access bandwidth at multicast Server Nodes (MSN) for real-time ap-plications over Internet. Besides implementing a dynamic priority to MSNs by weighing the size of its service clients for better efficiency, QCost-Balanced tradeoffs these two metrics by a unified tradeoff metric based on quantitative analysis. Simulation experiments demonstrate that the scheme achieves a better tradeoff gain in both two metrics, and effective performance in metric quantitative control.

关键词： multicast routing Overlay network Quantified analysis

QoS Constrained Network Coding Technique to Data Transmission Using IoT

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Computer Systems Science & Engineering 2022年第11期43卷 531-544页

作者： A.Sathishkumar T.Rammohan S.Sathish Kumar J.Uma K.Srujan Raju Aarti Sangwan M.Sivachitra M.Prabu Department of ECE The Kavery Engineering CollegeMecheri636453TamilnaduIndia Department of EEE Karpagam College of EngineeringCoimbatore641032India Department of EEE M.Kumarasamy College of EngineeringKarur639113India Department of Computer Science and Engineering CMR Technical CampusHyderabad501401India Department of CST Manav Rachna UniversityFaridabad121004India Department of EEE Kongu Engineering CollegePerundurai638060India Department of EEE Nandha Engineering CollegePerunduraiTamilnadu638052India

The research work presents,constrained network coding technique to ensure the successful data transmission based composite channel cmos technology using dielectric *** charge fragmentation and charge splitting are two components of the filtered switch domino(FSD)*** behavior of selected switching is achieved using generator called conditional pulse generator which is employed in Multi Dynamic Node Domino(MDND)*** FSD and MDND technique need wide area compared to existing single nodekeeper domino *** aim of this research is to minimize dissipation of power and to achieve less consumption of *** proposed research,works by introducing the method namely Interference and throughput aware Optimized multicast routing Protocol(IT-OMRP).The main goal of this proposed research method is to introduce the system which can forward the data packets towards the destination securely and *** achieve the bandwidth and throughput in optimized data transmission,proposed multicast tree is selected by Particle Swarm Optimization which will select the most optimal host node as the branches of multi cast *** node selection is done by considering the objectives residual energy,residual bandwidth and *** node selection multi cast routing is done with the concern of interference to ensure the reliable and successful data *** case of transmission range size is higher than the coverage sense range,successful routing is ensured by selecting secondary host forwarders as a backup which will act as intermediate relay *** NS2 simulator is used to evaluate research outcome from which it is proved that the proposed technique tends to have increased packet delivery ratio than the existing work.

关键词： multicast routing optimal node selection secondary relay nodes probability of interference residual energy bandwidth throughput

Providing Delay-Guaranteed multicast Transmission Services for an SDN-Based Publish/Subscribe System

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

China Communications 2019年第12期16卷 176-187页

作者： Yali Wang Shuangxi Hong Junna Zhang College of Computer and Information Engineering Henan Normal UniversityXinxiang 450002China Engineering Laboratory of Intellectual Business and Internet of Things Technologies Henan ProvinceChina

Providing end-to-end delay guarantees in traditional Internet is a complex task due to the distributed nature of TCP/IP protocols. Software Defined Networking(SDN) gives a new dimension to improve QoS(Quality of Service) as it can benefit from its flexibility, programmability and centralized view. In this paper, we provide delay-guaranteed data transmission service instead of "best efforts" service for a topic-based publish/subscribe system by means of exploring these specific features of SDN. We attribute this routing problem in such conditions to Delay-Constraint Lowest Cost Steiner Tree(DCLCST) problem. To solve it, we compute the shortest delay paths from source node to every subscribe node and the shortest cost paths from every subscribe node to any other node using dijkstra algorithm. Then we construct a delay-constraint least cost steiner tree for per-topic based on these paths as multicast tree. We also present experimental results to demonstrate the effectiveness of the algorithms and methods we proposed.

关键词： minimum steiner tree multicast routing publish/subscribe system overlay network

Achieving High-Dependability Optimal multicast in Wireless Mesh Networks

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Achieving High-Dependability Optimal Multicast in Wireless M...

2011 IEEE 13th International Conference on Communication Technology(ICCT 2011)

作者： Mojtaba Mansouri Majid Meghdadi Reza Askari Moghaddam Payame Noor University Tehran Branch Tehran Iran Zanjan University Zanjan Iran

ISBN: (纸本)9781612843063

Wireless Mesh Networks （WMNs） form a recent class of networks that has appeared lately. multicasting is the transfer of information or messages to multiple destination hosts at the same time and over wireless mesh networks is an essential communication function and also a challenging aim. Because WMNs are used as wireless backbones in a characteristic manner, they have the nature that the wireless communication isn’t dependable. Hence, it is important to defend them versus link or node failures. Distributing data utilizing multicast in an undependable network doesn’t assure trustworthy delivery, which is the major necessity for many significant applications. In this paper, we design a high- dependability optimal multicast protocol called HDMesh based on minimum-delay route trees for WMNs. The proposed protocol, HDMesh, uses a local repair mechanism based on a failure occurrence prediction mechanism, which intends to decrease the control overhead and obtain fast repair before route breakage happens. The new local repair mechanism is more adaption to the real WMNs. Mathematical analysis and simulation results demonstrate that the HDMesh protocol works in an efficient and dependable manner for WMNs and network performance can be improved in an important manner.

关键词： multicast routing Wireless Mesh Network Local Repair Mechanism Dependability failure occurrence prediction.

基于蚂蚁算法的移动Ad Hoc组播路由算法

在线全文

cnki会议

学校读者我要写书评

暂无评论

基于蚂蚁算法的移动Ad Hoc组播路由算法

2006年全国理论计算机科学学术年会

作者：王新生史钗郭慧燕山大学信息科学与工程学院燕山大学信息科学与工程学院燕山大学信息科学与工程学院

＜正＞1 引言随着无线通信和计算机技术的发展,移动Ad Hoc网具有了越来越广阔的应用前景,受到了越来越多关注和研究。组播技术能有效地缓解Ad Hoc 网中带宽和能源受限的问题,有效地支持组通信和

关键词： Mobile Ad Hoc networks multicast routing Ant algorithm End-to-end delay

基于边选择的时延及时延抖动受限组播路由算法

在线全文

cnki会议

学校读者我要写书评

暂无评论

基于边选择的时延及时延抖动受限组播路由算法

2005年全国理论计算机科学学术年会

作者：曾华朴朱文兴福州大学数学与计算机科学学院福州大学数学与计算机科学学院

＜正＞ 1 引言随着通信网络综合业务的发展,实时多媒体通信带来了组播的需求。组播是一点到多点的通信,目标是找到一种算法或策略,在给定的网络和组播需求的情况下,找到一种链路连接方式,使网络资源能够得到有效利用。通过寻找连接源节... 详细信息

＜正＞ 1 引言随着通信网络综合业务的发展,实时多媒体通信带来了组播的需求。组播是一点到多点的通信,目标是找到一种算法或策略,在给定的网络和组播需求的情况下,找到一种链路连接方式,使网络资源能够得到有效利用。通过寻找连接源节点和一组目标节点的一棵组播路由树,使信息沿这棵路由树的路径进行发送,却只需在树的分支节点处进行复制,以节省网络资源。

关键词： multicast routing Alternative routing Delay variation

在线全文

cnki会议

学校读者我要写书评

暂无评论

基于关键节点的动态多播最小生成树算法

基于关键节点的动态多播最小生成树算法

2005年全国理论计算机科学学术年会

作者：李佐勇朱文兴福州大学计算机科学与技术系福州大学计算机科学与技术系

＜正＞ 1 引言多播技术可以有效地解决单点发送多点接收、多点发送多点接收的问题,在多媒体会议、数据分发、分布式处理和分布式交互仿真等方面获得了广泛的应用。根据动态多播的基本模型,目标主机可以在任何时候,通过多播地址告诉路由... 详细信息

＜正＞ 1 引言多播技术可以有效地解决单点发送多点接收、多点发送多点接收的问题,在多媒体会议、数据分发、分布式处理和分布式交互仿真等方面获得了广泛的应用。根据动态多播的基本模型,目标主机可以在任何时候,通过多播地址告诉路由器该主机希望加入或退出哪一个多播组,即要实现多播组成员的动态加入或退出。在多播组成员发生变化时,多播路由必须维护一棵多播生成树,使得其费用

关键词： multicast routing Minimal spanning tree Dynamic algorithm