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

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

来源：评论

学校读者我要写书评

暂无评论

distributed rate allocation for Network-Coded Multicast Networks

引用

IEEE COMMUNICATIONS LETTERS 2013年第11期17卷 2204-2207页

作者： Lee, Sang Hyun Vishwanath, Sriram Univ Texas Austin Dept Elect & Comp Engn Austin TX 78712 USA

This letter addresses a distributed rate allocation for a class of multicast networks employing linear network coding. The goal is to minimize the cost, e.g., the sum rate allocated to links in the network, while satisfying a multicast rate requirement for each users in the network. In essence, it aims to achieve the network capacity while ensuring that the operation cost is minimal. This letter uses an alternating direction method of multipliers (ADMM) framework to obtain a distributed algorithm for the rate allocation. Simulation results demonstrate the convergence of this algorithm to the optimal solution.

关键词： distributed rate allocation multicast networks ADMM

来源：评论

学校读者我要写书评

暂无评论

Semi-distributed Coflow Scheduling in Datacenters

引用

IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT 2024年第4期21卷 4268-4281页

作者： El-Azouzi, Rachid De Pellegrini, Francesco Arfaoui, Afaf Richier, Cedric Leguay, Jeremie Luu, Quang-Trung Magnouche, Youcef Martin, Sebastien Univ Avignon LIA F-84000 Avignon France Huawei Technol France Res Ctr F-92100 Boulogne Billancourt France Hanoi Univ Sci & Technol Sch Elect & Elect Engn Hanoi 100000 Vietnam

With the advent of big data applications, coflow scheduling has become a cornerstone for the engineering of traffic in datacenters. Minimizing the average weighted Coflow Completion Times (CCT) is a crucial step to minimize the execution time of jobs running in distributed computing frameworks. In this paper, we present a new sigma -order coflow scheduling solution, ONE-PARIS, an online semi-clairvoyant and semi-distributed implementation suitable to minimize the weighted CCT in production environments. We achieves this through ONE-PARIS scheduler for ordering coflows and a decentralized resource allocation mechanism, called Sync-rate, enabling to respect the order of priority of coflows provided by ONE-PARIS and ensuring efficient synchronization between flows of the same coflow in order to free up bandwidth for low-priority flows. Extensive simulations on both synthetic and real traffics show that our proposed coflow scheduler outperforms other state-of-art schemes.

关键词： Resource management Scheduling Switches Processor scheduling Task analysis Fabrics Standards Coflow scheduling sigma-order distributed rate allocation pricing task scheduling resource allocation

来源：评论

学校读者我要写书评

暂无评论

A distributed rate allocation Algorithm for Slepian-Wolf Coding based Data Aggregation in Wireless Sensor Networks

A Distributed Rate Allocation Algorithm for Slepian-Wolf Cod...

引用

International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Zheng, Jun Huang, Zhenzhong Shu, Qihuang Mitton, Nathalie Southeast Univ Natl Mobile Commun Res Lab Nanjing 210096 Jiangsu Peoples R China Inria Lille Nord Europe F-59650 Villeneuve Dascq France

ISBN: (纸本)9781479903085

This paper considers the Slepian-Wolf coding based energy-minimization rate allocation problem in a wireless sensor network (WSN) and propose a distributed rate allocation algorithm to solve the problem. The proposed distributed algorithm is based on an existing centralized rate allocation algorithm which has a high computational complexity. To reduce the computational complexity of the centralized algorithm and make the rate allocation performable in a distributed manner, we make necessary modifications to the centralized algorithm by reducing the number of sets in calculating the average energy consumption cost and limiting the number of conditional nodes that a set can use. Simulation results show that the proposed distributed algorithm can significantly reduce the computational time when compared with the existing centralized algorithm at the cost of the overall energy consumption for data transmission and the total amount of data transmitted in the network.

关键词： distributed rate allocation Slepian-Wolf coding data aggregation wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

Utility Maximisation in the Coordinator-Less IOTA Tangle 7th

Utility Maximisation in the Coordinator-Less IOTA Tangle

引用

7th International Symposium on Ubiquitous Networking (UNet)

作者： Jay, Mathilde Mollard, Ambre Sun, Ye Zheng, Ruyi Amigo, Isabel Reiffers-Masson, Alexandre Rincon, Santiago Ruano IMT Atlantique Brest France IMT Atlantique Lab STICC UMR 6285 F-29238 Brest France

ISBN: (纸本)9783030863555;9783030863562

Getting rid of the Coordinator in the IOTA Tangle is a challenging task, especially regarding the network trustworthiness. Using a customised testbed, we experimentally analyse the functioning of the GoShimmer, IOTA's current implementation of the decentralised Tangle, with respect to specific network performance metrics. We observe that a trade-off exists among such metrics. We thus propose to determine the optimal rate allocation through an optimization problem maximising network performance and user utility. We further propose a distributed and asynchronous scheme to allow nodes to solve such problem.

关键词： Tangle Utility maximisation distributed rate allocation

来源：评论

学校读者我要写书评

暂无评论

Service and Resource Aware Flow Management Scheme for an SDN-Based Smart Digital Campus Environment

引用

IEEE ACCESS 2020年 8卷 119635-119653页

作者： Njah, Yosra Pham, Chuan Cheriet, Mohamed Ecole Technol Super Montreal PQ H3C 1K3 Canada

Recently, campuses have been embracing smart digital technologies in order to boost the efficiency of education and creativity. Thus, massive heterogeneous flows are generated as a result of multitude simultaneous access from several heterogeneous devices. This is putting pressure on campuses to make better management of their constrained resources and to ensure the required Quality of Service (QoS). In this paper, we propose a multi-flow management scheme over a software-defined smart digital campus network, named Service and Resource Aware Flow Management (SRAFM). Our approach offers a unified fully-programmable architecture, a distributed end-host-based flow characterization plane, and a centralized software-defined optimization model to efficiently manage heterogeneous flows. Network functionalities, including QoS aware routing and resource allocation optimization, are formulated as a mixed-integer linear programming problem. Due to its NP-hard complexity, we propose an approximation algorithm in a decomposed fashion based on Lagrangian Dual Decomposition (LDD) and subgradient methods to find an optimal solution for flow management. We evaluate our scheme from different aspects, including the number of simultaneous heterogeneous flows, QoS provisioning, characterization impacts, and network scalability. Compared to the well-known benchmarks in QoS aware routing and optimization problem, SWAY and LARAC, our simulation results conducted with a large number of flows over a small-scale network show promising performance. The proposed scheme significantly improves the cost reduction by 51% as compared to LARAC, the end-to-end delay by 21% and 34%, the bandwidth availability by 27% and 36%, and the QoS violation by 11% and 29% as compared to SWAY and LARAC, respectively.

关键词： Smart digital campus Internet of Things (IoT) software-defined networking (SDN) flow characterization Quality of Service (QoS) distributed rate allocation and resource optimization

来源：评论

学校读者我要写书评

暂无评论

A distributed rate allocation Algorithm for Slepian-Wolf Coding based Data Aggregation in Wireless Sensor Networks

A Distributed Rate Allocation Algorithm for Slepian-Wolf Cod...

引用

International Conference on Wireless Communications and Signal Processing

作者： Jun Zheng Zhenzhong Huang Qihuang Shu Nathalie Mitton National Mobile Communications Research Laboratory Southeast University Nanjing Jiangsu 210096 China|c|

ISBN: (纸本)9781479903061

关键词： distributed rate allocation Slepian-Wolf coding Data aggregation Wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

A unified framework for distributed video rate allocation over wireless networks

引用

AD HOC NETWORKS 2011年第4期9卷 608-622页

作者： Zhu, Xiaoqing Girod, Bernd Cisco Syst Inc Adv Architecture & Res San Jose CA 95134 USA Stanford Univ Informat Syst Lab Stanford CA 94305 USA

When multiple video streams share a wireless network, careful rate allocation is needed to prevent congestion, as well as to balance the video qualities among the competing streams. In this paper, we present a unified optimization framework for video rate allocation over wireless networks. Our framework applies to both unicast and multicast sessions, and accommodates both scalable and non-scalable streams. The optimization objective is to minimize the total distortion of all video streams without incurring excessive network utilization. Our system model explicitly accounts for heterogeneity in wireless link capacities, traffic contention among neighboring links, as well as different video rate-distortion (RD) characteristics. The proposed distributed media-aware rate allocation scheme leverages cross-layer information exchange between the MAC and application layers to achieve fast convergence at the optimal allocation. We evaluate performance of the proposed scheme for streaming of high-definition (HD) and standard-definition (SD) video sequences over 802.11-based wireless networks, both in unicast and multicast scenarios. The scheme consistently outperforms conventional TCP-Friendly rate Control (TFRC) in terms of overall video quality, and achieves more balanced qualities among the streams. (C) 2010 Elsevier B.V. All rights reserved.

关键词： distributed rate allocation Video streaming Wireless networking Cross-layer design

来源：评论

学校读者我要写书评

暂无评论

On the Adaptive Sum-Capacity of distributed Multiple Access with Individual CSI

引用

IETE JOURNAL OF RESEARCH 2015年第6期61卷 659-672页

作者： Iyer, Krishnamoorthy Pillai, Sibi Raj B. Dey, Bikash K. Indian Inst Technol Dept Elect Engn Bombay Maharashtra India

In wireless communications, a fading multiple-access channel (MAC) is typically used to model the uplink communication. Conventional MACs assume a centralized system, where the transmission rate and power are chosen centrally for every fading vector realization. On the other hand, there is considerable interest in the performance of distributed multiple access systems, where the lack of global channel state information (CSI) demands novel communication strategies. We consider a block-fading MAC where each transmitter is aware only of its own link CSI, which we term as the individual CSI MAC. The receiver has access to the full CSI of all links. This model was recently introduced in the information theory literature, and naturally leads to a distributed access system with several applications. An important utility of interest for this model is known as the power-controlled adaptive sum-capacity, whose evaluation is an open problem. This is the main subject of the current paper. We present the power-controlled adaptive sum-capacity of a wide class of popular fading MAC models. In particular, we characterize the sum-capacity when the statistics of the channel are identical across users. The proposed schemes also allow a low-complexity successive-cancellation decoding using rate-splitting. Furthermore, the optimal schemes are extended to situations in which each transmitter has additional finite-rate partial CSI on the link quality of others.

关键词： Capacity Region distributed CSI distributed rate allocation Fading Statistics Multiple-Access Channel Power control

来源：评论

学校读者我要写书评

暂无评论

distributed rate allocation Policies for Multihomed Video Streaming Over Heterogeneous Access Networks

引用

IEEE TRANSACTIONS ON MULTIMEDIA 2009年第4期11卷 752-764页

作者： Zhu, Xiaoqing Agrawal, Piyush Singh, Jatinder Pal Alpcan, Tansu Girod, Bernd Stanford Univ Dept Elect Engn Stanford CA 94305 USA Deutsch Telekom Inc R&D Lab Altos CA 94022 USA Deutsch Telekom Labs D-10587 Berlin Germany

We consider the problem of rate allocation among multiple simultaneous video streams sharing multiple heterogeneous access networks. We develop and evaluate an analytical framework for optimal rate allocation based on observed available bit rate (ABR) and round-trip time (RTT) over each access network and video distortion-rate (DR) characteristics. The rate allocation is formulated as a convex optimization problem that minimizes the total expected distortion of all video streams. We present a distributed approximation of its solution and compare its performance against H-infinity-optimal control and two heuristic schemes based on TCP-style additive-increase-multiplicative-decrease (AIMD) principles. The various rate allocation schemes are evaluated in simulations of multiple high-definition (HD) video streams sharing multiple access networks. Our results demonstrate that, in comparison with heuristic AIMD-based schemes, both media-aware allocation and H-infinity-optimal control benefit from proactive congestion avoidance and reduce the average packet loss rate from 45% to below 2%. Improvement in average received video quality ranges between 1.5 to 10.7 dB in PSNR for various background traffic loads and video playout deadlines. Media-aware allocation further exploits its knowledge of the video DR characteristics to achieve a more balanced video quality among all streams.

关键词： distributed rate allocation heterogeneous access networks multihomed video streaming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：