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

inter-session network coding with Strategic Users: A Game-Theoretic Analysis of the Butterfly network

IEEE TRANSACTIONS ON COMMUNICATIONS 2013年第4期61卷 1473-1484页

作者： Mohsenian-Rad, Hamed Huang, Jianwei Wong, Vincent W. S. Jaggi, Sidharth Schober, Robert Univ Calif Riverside EE Dept Riverside CA 92521 USA Chinese Univ Hong Kong Dept Informat Engn Hong Kong Hong Kong Peoples R China Univ British Columbia ECE Dept Vancouver BC V5Z 1M9 Canada

We analyze inter-session network coding in a wired network using game theory. We assume that users are selfish and act as strategic players to maximize their own utility, which leads to a resource allocation game among users. In particular, we study a butterfly network, where a bottleneck link is shared by network coding and routing flows. We assume that network coding is performed using pairwise XOR operations. We prove the existence of Nash equilibrium for a wide range of utility functions. We also show that the number of Nash equilibria can be large (even infinite) for certain choices of parameters. This is in sharp contrast to a similar game setting with traditional packet forwarding, where the Nash equilibrium is always unique. We characterize the worst-case efficiency bound, i.e., the Price-of-Anarchy (PoA), compared to an optimal and cooperative network design. We show that by using a discriminatory pricing scheme which charges encoded and forwarded packets differently, we can improve the PoA in comparison with the case where a single pricing scheme is used. However, even when a discriminatory pricing scheme is used, the PoA is still worse than for the case when network coding is not applied. This implies that, although inter-session network coding can improve performance compared to routing, it is much more sensitive to users' strategic behavior.

关键词： inter-session network coding butterfly network game theory Nash equilibrium price-of-anarchy efficiency bound

来源：评论

学校读者我要写书评

暂无评论

inter-session network coding Schemes for 1-to-2 Downlink Access-Point networks With Sequential Hard Deadline Constraints

引用

IEEE-ACM TRANSACTIONS ON networkING 2017年第1期25卷 624-638页

作者： Li, Xiaohang Wang, Chih-Chun Lin, Xiaojun Purdue Univ Sch Elect & Comp Engn Ctr Wireless Syst & Applicat W Lafayette IN 47907 USA

Next generation wireless networks will carry traffic from a wide range of applications, and many of them may require packets to be delivered before their respective deadlines. In this paper, we investigate using inter-session network coding to send packets wirelessly for two deadline-constrained unicast sessions. In particular, each unicast session aims to transmit a file, whose packets have hard sequential deadline constraints. We first characterize the corresponding deadline-constrained capacity region under heterogeneous channel conditions and heterogeneous deadline constraints. We show that this deadline-constrained capacity region can be achieved asymptotically by modifying the existing generation-based (G-B) schemes. However, despite its asymptotic optimality, the G-B scheme has very poor performance for small and medium file sizes. To address these problems, we develop a new immediately-decodable network coding (IDNC) scheme that empirically demonstrates much better performance for short file sizes, and we prove analytically its asymptotic optimality when used to send large files. Our analysis uses a novel version of drift analysis, which could also be of independent interest to other IDNC schemes.

关键词： inter-session network coding 1-to-2 unicast sequential hard deadlines immediately-decodable network coding drift analysis

来源：评论

学校读者我要写书评

暂无评论

Decoding Delay Minimization in inter-session network coding

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2014年第6期62卷 1944-1957页

作者： Bourtsoulatze, Eirina Thomos, Nikolaos Frossard, Pascal Univ Bern Commun & Distributed Syst Lab CDS CH-3012 Bern Switzerland Univ Essex Colchester CO4 3SQ Essex England Ecole Polytech Fed Lausanne Signal Proc Lab LTS4 4 CH-1015 Lausanne Switzerland

Intra-session network coding has been shown to offer significant gains in terms of achievable throughput and delay in settings where one source multicasts data to several clients. In this paper, we consider a more general scenario where multiple sources transmit data to sets of clients over a wireline overlay network. We propose a novel framework for efficient rate allocation in networks where intermediate network nodes have the opportunity to combine packets from different sources using randomized network coding. We formulate the problem as the minimization of the average decoding delay in the client population and solve it with a gradient-based stochastic algorithm. Our optimized inter-session network coding solution is evaluated in different network topologies and is compared with basic intra-session network coding solutions. Our results show the benefits of proper coding decisions and effective rate allocation for lowering the decoding delay when the network is used by concurrent multicast sessions.

关键词： network coding decoding delay rate allocation inter-session network coding overlay networks

来源：评论

学校读者我要写书评

暂无评论

Distributed Rate Allocation in inter-session network coding

引用

IEEE TRANSACTIONS ON MULTIMEDIA 2014年第6期16卷 1752-1765页

作者： Bourtsoulatze, Eirina Thomos, Nikolaos Frossard, Pascal Univ Bern Inst Comp Sci & Appl Math Commun & Distributed Syst CDS Lab CH-3012 Bern Switzerland Univ Essex Dept Comp Sci & Elect Engn Colchester CO4 3SQ Essex England Ecole Polytech Fed Lausanne Signal Proc Lab LTS4 4 CH-1015 Lausanne Switzerland

In this work, we propose a distributed rate allocation algorithm that minimizes the average decoding delay for multimedia clients in inter-session network coding systems. We consider a scenario where the users are organized in a mesh network and each user requests the content of one of the available sources. We propose a novel distributed algorithm where network users determine the coding operations and the packet rates to be requested from the parent nodes, such that the decoding delay is minimized for all clients. A rate allocation problem is solved by every user, which seeks the rates that minimize the average decoding delay for its children and for itself. Since this optimization problem is a priori non-convex, we introduce the concept of equivalent packet flows, which permits to estimate the expected number of packets that every user needs to collect for decoding. We then decompose our original rate allocation problem into a set of convex subproblems, which are eventually combined to obtain an effective approximate solution to the delay minimization problem. The results demonstrate that the proposed scheme eliminates the bottlenecks and reduces the decoding delay experienced by users with limited bandwidth resources. We validate the performance of our distributed rate allocation algorithm in different video streaming scenarios using the NS-3 network simulator. We show that our system is able to take benefit of inter-session network coding for simultaneous delivery of video sessions in networks with path diversity.

关键词： Delay minimization distributed rate allocation inter-session network coding multimedia communications overlay networks

来源：评论

学校读者我要写书评

暂无评论

Control of Multi-Hop Communication networks for inter-session network coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2011年第2期57卷 1092-1110页

作者： Eryilmaz, Atilla Lun, Desmond S. Swapna, B. T. Ohio State Univ Dept Elect & Comp Engn Columbus OH 43210 USA Rutgers State Univ Dept Comp Sci Camden NJ 08102 USA Rutgers State Univ Ctr Comp & Integrat Biol Camden NJ 08102 USA

This paper provides a solution to the question of how, when and where to perform inter-session network coding for a general network model both under wired and wireless conditions. In particular, an original queuing architecture and a dynamic routing-scheduling-coding strategy are introduced for serving multiple sessions when linear network coding is allowed across sessions. This policy provides a novel extension to the class of back-pressure policies by incorporating inter-session coding decisions via simple rules on the relevant queue-length levels. Despite the fact that the capacity region of inter-session coding is a challenging open problem, in this paper, we prove that our algorithm can support any set of rates in a nontrivial characterized region of achievable rates. In addition to its practical implications, this work also provides a theoretical framework in which the gains of inter-session network coding and pure routing can be compared.

关键词： Backpressure policies butterfly network dynamic algorithms inter-session network coding Lyapunov stability stochastic networks

来源：评论

学校读者我要写书评

暂无评论

A rule-based inter-session network coding scheme over IEEE 802.16(d) mesh CDS-mode networks

引用

COMPUTER networkS 2012年第2期56卷 661-685页

作者： Wang, Shie-Yuan Lin, Chih-Che Chang, Yu-Chi Natl Chiao Tung Univ Dept Comp Sci Hsinchu Taiwan

In the literature, an opportunistic inter-session network coding scheme needs to exchange extra control messages to maintain traffic flow states to operate. However, such a requirement increases the implementation complexity of a network coding scheme. In this paper, we propose a rule-based network coding scheme (RNC) that performs opportunistic intersession network coding using a stateless design. By exploiting this stateless design, the proposed coding scheme is easy to implement and deploy. In addition, in this paper based on RNC we study the hidden terminal problems between different coding structures. Such a problem may result in severe packet collisions in a network-coding-based network and thus degrade network coding performance. To alleviate this problem, based on RNC we propose a smart handshake procedure (called RNC-SHP) over the IEEE 802.16(d) mesh coordinated distributed scheduling (CDS) mode to reduce the number of hidden terminals between pairwise network coding structures. Our simulation results show that the proposed RNC schemes can greatly outperform the original routing-based scheme on end-to-end flow goodputs and packet delays. (C) 2011 Elsevier B.V. All rights reserved.

关键词： network coding 802.16 Wireless mesh network Hidden terminal inter-session network coding

来源：评论

学校读者我要写书评

暂无评论

P2P VIDEO STREAMING WITH inter-session network coding

P2P VIDEO STREAMING WITH INTER-SESSION NETWORK CODING

引用

IEEE international Conference on Multimedia and Expo (ICME)

作者： Saltarin, Jonnahtan Thomos, Nikolaos Bourtsoulatze, Eirina Frossard, Pascal Ecole Polytech Fed Lausanne Signal Proc Lab LTS4 CH-1015 Lausanne Switzerland

ISBN: (纸本)9781612843490

We present a novel receiver-driven p2p system for delivery of multiple concurrent time constrained data streams in overlay networks. We propose an effective combination of rateless coding with intra- and inter-session network coding to efficiently exploit the path diversity in the streaming overlay. network nodes can decide to forward rateless coded packets or to code them in intra-or inter-session mode before transmission. The transmission strategy is determined based on the availability of data sources and the demands of the children nodes. Each network node solves independently a simple flow maximization problem in order to determine the optimal coding policy. The overall system is evaluated for various networks and the results outline the advantages of the proposed approach over intra-session network coding based schemes in terms of clients' satisfaction, innovative flow rate and decoding delay.

关键词： inter-session network coding Raptor codes multicast transmission overlay networks

来源：评论

学校读者我要写书评

暂无评论

An Optimization Multi-path inter-session network coding in Wireless Sensor networks

An Optimization Multi-path Inter-Session Network Coding in W...

引用

international Conference on Intelligent Computing and Information Science

作者： Xia, Zhuo-qun Liu, Chao Zhu, Xue-han Liu, Pin-chao Xie, Li-tong Changsha Univ Sci & Technol Sch Comp & Telecommun Engn Changsha 410114 Hunan Peoples R China

ISBN: (纸本)9783642181283

Wireless sensor networks (wsns) typically provide several paths from a source to a destination, and by using such paths efficiently. This has the potential not only to increase multiplicatively the achieved end-to-end rate, but also to provide robustness against performance fluctuations of any single link in the system. network coding is a new technique which improves the network performance. This paper we analyze how to using network coding according to the characteristic of multi-path routing in the wsns. As a result, an optimization multi-path inter-session network coding is designed to improve the wsns performance.

关键词： Wireless sensor networks inter-session network coding multi-path routing

来源：评论

学校读者我要写书评

暂无评论

An Efficient Algorithm for Time-Driven Data Gathering in Wireless Sensor networks Using inter-session network coding

An Efficient Algorithm for Time-Driven Data Gathering in Wir...

引用

2011 4th IEEE international Conference on Computer Science and Information Technology(ICCSIT 2011)

作者： Qian Xiao,Kangfeng Zheng,Shoushan Luo,Yixian Yang Key Laboratory of network and Information Attack & Defence Technology of MOE,Beijing University of Posts and Telecommunications Beijing 100876,China

Energy consumption and time delay,i.e.,the amount of energy and time consumed by all nodes for transmitting data,are two critical factors for estimating the efficiency of algorithms in wireless sensor *** focus on the application of time-driven data gathering,where all nodes act as sources at the same time,transmitting data to an immobile sink node,and propose an efficient algorithm called DGNC for this scenario using inter-session network coding and opportunistic *** theoretically quantify the energy and time delay saving that our algorithm could offer in a rectangular grid network,and demonstrate the fact by simulation results in random networks,which DGNC could offer significant benefits in terms of both energy consumption and time delay in time-driven data gathering.

关键词： wireless sensor networks time-driven data gathering inter-session network coding opportunistic routing

来源：评论

学校读者我要写书评

暂无评论

Capacity regions for multiple unicast flows using inter-session network coding 07

Capacity regions for multiple unicast flows using inter-sess...

引用

Proceedings of the 3rd international conference on Wireless internet

作者： Abdallah Khreishah Chih-Chun Wang Ness B. Shroff Purdue University The Ohio State University

ISBN: (纸本)9789639799127

In this paper we consider the problem of transmitting packets through multiple unicast sessions when inter-session linear network coding is permitted. We propose and formulate two new capacity regions for this problem. Distributed rate allocation algorithms and coding schemes are also provided for these capacity regions. The two capacity regions are compared with other known capacity regions in the literature to represent their benefits in terms of throughput, fairness, complexity, and ease of implementation.

关键词： capacity region multiple-unicast-sessions problem distributed algorithm inter-session network coding rate control coding scheme fairness

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：