检索结果-南通市图书馆

Network Coding and Quality of Service for Mobile <i>Ad Hoc</i>Networks

International Journal of Communications, Network and System Sciences 2014年第10期7卷 409-422页

作者： Michael Hay Basil Saeed Chung-Horng Lung Thomas Kunz Anand Srinivasan Systems and Computer Engineering Carleton University Ottawa Canada eion inc Ottawa Canada

Network Coding is a relatively new forwarding paradigm where intermediate nodes perform a store, code, and forward operation on incoming packets. Traditional forwarding approaches, which employed a store and forward operation, have not been able to approach the limit of the max-flow min-cut throughput wherein sources transmitting information over bottleneck links have to compete for access to these links. With Network Coding, multiple sources are now able to transmit packets over bottleneck links simultaneously, achieving the max-flow min-cut through-put and increasing network capacity. While the majority of the contemporary literature has focused on the performance of Network Coding from a capacity perspective, the aim of this research has taken a new direction focusing on two Quality of Service metrics, e.g., Packet Delivery Ratio (PDR) and Latency, in conjunction with Network Coding protocols in Mobile Ad Hoc Networks (MANETs). Simulations are performed on static and mobile environments to determine a Quality of Service baseline comparison between Network Coding protocols and traditional ad hoc routing protocols. The results show that the Random Linear Network Coding protocol has the lowest Latency and Dynamic Source Routing protocol has the highest PDR in the static scenarios, and show that the Random Linear Network Coding protocol has the best cumulative performance for both PDR and Latency in the mobile scenarios.

关键词： Network Coding Mobility Quality of Service Mobile Ad Hoc Networks Performance Evaluation

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

A subtree-based approach to failure detection and protection for multicast in SDN

引用

Frontiers of Information Technology & Electronic Engineering 2016年第7期17卷 682-700页

作者： Vignesh RENGANATHAN RAJA Chung-Horng LUNG Abhishek PANDEY Guo-ming WEI Anand SRINIVASAN Department of Systems and Computer Engineering Carleton UniversityOttawaOntario KIS 5B6Canada School of Computer Science Carleton UniversityOttawaOntario KIS 5B6Canada eion inc. OttawaOntario K2K 2E3Canada

Software-defined networking(SDN) has received tremendous attention from both industry and *** centralized control plane in SDN has a global view of the network and can be used to provide more effective solutions for complex problems,such as traffic *** study is motivated by recent advancement in SDN and increasing popularity of multicasting *** propose a technique to increase the resiliency of multicasting in SDN based on the subtree protection *** is a group communication technology,which uses the network infrastructure efficiently by sending the data only once from one or multiple sources to a group of receivers that share a common *** applications,e.g.,live video streaming and video conferencing,become popular,but they are delay-sensitive *** in an ongoing multicast session can cause packet losses and delay,which can significantly affect quality of service(Qo S).In this study,we adapt a subtree-based technique to protect a multicast tree constructed for Open Flow switches in *** proposed algorithm can detect link or node failures from a multicast tree and then determines which part of the multicast tree requires changes in the flow table to recover from the *** a centralized controller in SDN,the backup paths can be created much more effectively in comparison to the signaling approach used in traditional multiprotocol label switching(MPLS) networks for backup paths,which makes the subtree-based protection mechanism *** also implement a prototype of the algorithm in the POX controller and measure its performance by emulating failures in different tree topologies in Mininet.

关键词： Software-defined networks(SDNs) Open Flow Multicast tree Protection POX controller Mininet Multiprotocol label switching(MPLS)

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Beaconless Position-based Routing with Guaranteed Delivery for Wireless Ad hoc and Sensor Networks

引用

自动化学报 2006年第6期32卷 846-855页

作者： CHAWLA Mohit GOEL Nishith KALAICHELVAN Kalai NAYAK Amiya STOJMENOVIC Ivan Department of Computer Science & Engineering IIT GuwahatiGuwahati 781039India Cistel Technology inc OttawaOntario K2E 7V7Canada eion Technology inc OttawaOntario K1Y 2X5Canada SITE University of OttawaOttawaOntario K1N 6N5Canada

Existing position-based routing algorithms, where packets are forwarded in the geographic direction of the destination, normally require that the forwarding node should know the positions of all neighbors in its transmission range. This information on direct neighbors is gained by observing beacon messages that each node sends out periodically. Several beaconless greedy routing schemes have been proposed recently. However, none of the existing beaconless schemes guarantee the delivery of packets. Moreover, they incur communication overhead by sending excessive control messages or by broadcasting data packets. In this paper, we describe how existing localized position based routing schemes that guarantee delivery can be made beaconless, while preserving the same routes. In our guaranteed delivery beaconless routing scheme, the next hop is selected through the use of control RTS/CTS messages and biased timeouts. In greedy mode, the neighbor closest to destination responds first. In recovery mode, nodes closer to the source will select shorter timeouts, so that other neighbors, overhearing CTS packets, can eliminate their own CTS packets if they realize that their link to the source is not part of Gabriel graph. Nodes also cancel their packets after receiving data message sent by source to the selected neighbor. We analyze the behavior of our scheme on our simulation environment assuming ideal MAC, following GOAFR+ and GFG routing schemes. Our results demonstrate low communication overhead in addition to guaranteed delivery.

关键词： Beaconless routing geometric routing guaranteed delivery sensor networks

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：