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

International Symposium on Information Theory and Its Applications, ISITA

作者： Yoshihiro Murayama Takayuki Nozaki Dept. of Informatics Yamaguchi University JAPAN

ISBN: (纸本)9781538682234;9784885523182

Fountain codes are erasure correcting codes realizing reliable communication systems for the multicast on the Internet. The zigzag decodable fountain (ZDF) code is one of generalization of the Raptor code, i.e, applying shift operation to generate the output packets. The ZDF code is decoded by a two-stage iterative decoding algorithm, which combines the packet-wise peeling algorithm and the bit-wise peeling algorithm. By the bit-wise peeling algorithm and shift operation, ZDF codes outperform Raptor codes under iterative decoding in terms of decoding erasure rates and overheads. However, the bit-wise peeling algorithm spends long decoding time. This paper proposes a fast bit-wise decoding algorithm for the ZDF codes. Simulation results show that the proposed algorithm drastically reduces the decoding time compared with the existing algorithm.

关键词： Decoding Iterative decoding Encoding Receivers Internet multicast algorithms

来源：评论

学校读者我要写书评

暂无评论

A SLNR-Based Precoding Algorithm for Max-Min Fairness Problem in Physical-Layer multicasting

A SLNR-Based Precoding Algorithm for Max-Min Fairness Proble...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Shuo Zhang Mingchuan Yang Qing Guo Yuming Wei School of Electronics and Information Engineering Harbin Institute of Technology Harbin China

ISBN: (纸本)9781538663592;9781538663585

Considering the fairness between the users in physical-layer multigroup multicasting, the Max-Min Fairness (MMF) precoding problem is investigated under the per-antenna power constraints. A suboptimal precoding algorithm is proposed by decoupling the problem into a precoding direction vector design problem and a power allocation problem. Particularly, the SLNR (Signal to Leakage plus Noise Ratio) metric is considered in the precoding direction vector design to properly mitigate the inter-group interference. Moreover, aiming at the MMF criterion, the power allocation procedure can guarantee fairness between users. The simulation results show that the proposed algorithm has less complexity than the primary MMF algorithm at the cost of some performance loss, while has better performance than a low complex algorithm, and consequently provides a solution for the tradeoff between complexity and performance.

关键词： Precoding Interference multicast communication Quality of service multicast algorithms Complexity theory Resource management

来源：评论

学校读者我要写书评

暂无评论

Dissemination of Edge-Heavy Data on Heterogeneous MQTT Brokers 6

Dissemination of Edge-Heavy Data on Heterogeneous MQTT Broke...

引用

IEEE 6th International Conference on Cloud Networking (CloudNet)

作者： Banno, Ryohei Sun, Jingyu Fujita, Masahiro Takeuchi, Susumu Shudo, Kazuyuki NTT Network Innovat Labs Tokyo 1808585 Japan Tokyo Inst Technol Tokyo 1528550 Japan Kyoto Sangyo Univ Kyoto 6038555 Japan

ISBN: (纸本)9781509040261

MQTT is one of the promising protocols for exchanging IoT data. IoT data have a characteristic called "edgeheavy" which means that things at the network edge generate a massive volume of data with high locality of utilization. For dissemination of such edge-heavy data, an architecture in which multiple MQTT brokers placed at the network edges cooperate with each other is quite effective. This edge-based architecture makes latency lower, as well as reducing consumption of cloud resources. However, under this kind of architecture, heterogeneity could be a vital issue, i.e., an appropriate product of MQTT broker could vary according to the different environment of each network edge. In this paper, we propose Interworking Layer of Distributed MQTT brokers (ILDM), which enables arbitrary kinds of MQTT brokers to cooperate with each other. We provide two basic cooperation algorithms, including the way to furnish MQTT-specific functions such as QoS and Retain. To evaluate the feasibility of ILDM, we also formulate a benchmark method which can be used for both a single broker and multiple brokers. Experimental results show that the throughput of five brokers running together by ILDM is improved 4.3 times at maximum than that of single broker.

关键词： Publish-subscribe Distributed information systems Edge computing multicast algorithms

来源：评论

学校读者我要写书评

暂无评论

Distance-Aware Requester Grouping for Distributed Sub-Tree Scheme in Elastic Optical Datacenter Networks

Distance-Aware Requester Grouping for Distributed Sub-Tree S...

引用

Asia Communications and Photonics Conference (ACP)

作者： Li, Xin Tang, Ying Gao, Tao Zhang, Lu Yin, Shan Guo, Bingli Huang, Shanguo Beijing Univ Posts & Telecommun State Key Lab Informat Photon & Opt Commun Beijing 100876 Peoples R China

A distance-aware requester grouping (DA-RG) strategy which aims to minimize the total spectrum consumption of all constructed sub-trees is proposed for the distributed sub-tree scheme. Simulations show that DA-RG achi... 详细信息

ISBN: (纸本)9781943580347

关键词： multicast algorithms Optical fiber networks Telecommunication traffic Photonics Optical transmitters Resource management Asia

来源：评论

学校读者我要写书评

暂无评论

multicasting in Linear Deterministic Relay Network by Matrix Completion

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2016年第2期62卷 870-875页

作者： Soma, Tasuku Univ Tokyo Grad Sch Informat Sci & Technol Bunkyo Ku 7-3-1 Hongo Tokyo 1138656 Japan

We provide a deterministic polynomial time algorithm for multicasting in a linear deterministic relay network and a wireless communication framework proposed by Avestimehr et al. The running time of our algorithm is faster than existing ones and matches the current best complexity of unicast computations for each sink. Our approach is based on the polylinking flow model of Goemans et al. and the mixed matrix completion technique of Harvey et al.

关键词： Wireless communication relay networks multicast algorithms network coding optimization

来源：评论

学校读者我要写书评

暂无评论

Optimal multicast Control for Simple Network Coding

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2015年第6期64卷 2375-2386页

作者： Lee, Dujeong Kim, Kyounghye Rhee, June-Koo Kevin Korea Adv Inst Sci & Technol Dept Elect Engn Taejon 305701 South Korea

We propose a network coding strategy for multicast applications called the simple network coding scheme, which takes network coding chances raised among adjacent nodes. The proposed scheme incorporates both intrasession and intersession network coding strategies and effectively improves multicast throughput. We characterize the capacity region of the proposed scheme and derive an optimal control algorithm for the proposed scheme. We perform a complexity analysis for the proposed control algorithm and provide some insights into its practical implementation. For a comparison, we also formulate the capacity region of conventional multicast schemes and provide performance evaluation using a linear programming solver. In empirical analyses, we investigate how the proposed scheme improves multicast throughput gains from various perspectives (i.e., the number of flows, the number of network coded packets, and split-multicast) and find out that most of the gains can be achieved by simple pairwise network coding with non-split-multicast. We observe dramatic throughput gains up to 75% beyond the conventional schemes on random topologies with ten nodes.

关键词： Cross-layer design multicast algorithms network coding optimal control routing

来源：评论

学校读者我要写书评

暂无评论

Optimal multicasting in Hybrid RF/FSO DTNs

Optimal Multicasting in Hybrid RF/FSO DTNs

引用

IEEE Global Communications Conference

作者： Michael Atakora Harsha Chenji School of Electrical Engineering and Computer Science Ohio University

ISBN: (纸本)9781509013296

The multi-copy routing paradigm in Delay Tolerant Networks (DTNs) implies that increasing contact bandwidth leads to a decrease in data delivery delay and an improvement in throughput. With Hybrid Radio Frequency/Free Space Optical (RF/FSO) PHY layers, the high data rate FSO links can be used to increase the contact bandwidth. However, due to the highly directional nature of FSO links, broadcasting is difficult. A naive broadcast strategy where the beam divergence angle is increased to include many nodes in the broadcast set results in low data rate, and does not always result in the minimum achievable delay. In this work we develop an optimal multicast algorithm for hybrid RF/FSO networks. We show that the problem is an abstraction of the minimum weight set cover problem which is known to be NP-hard. A computationally cheap greedy local optimum heuristic is proposed. A comprehensive evaluation using delay, throughput and computation time as metrics is performed using various solutions. These extensive evaluations show that our solution outperforms both naive broadcast and multiple unicast, taking 95% less time as compared to the exact algorithm, while providing comparable performance.

关键词： beam divergence Minimum weight multicast algorithms Low Data Rate Throughput multicast communication multicast comprehensive assessment broadcasting HYBRID Hybrid electric vehicles computational time Abstraction Metronidazole

来源：评论

学校读者我要写书评

暂无评论

The SpiNNaker Project

引用

PROCEEDINGS OF THE IEEE 2014年第5期102卷 652-665页

作者： Furber, Steve B. Galluppi, Francesco Temple, Steve Plana, Luis A. Univ Manchester Sch Comp Sci Manchester M13 9PL Lancs England

The spiking neural network architecture (SpiNNaker) project aims to deliver a massively parallel million-core computer whose interconnect architecture is inspired by the connectivity characteristics of the mammalian brain, and which is suited to the modeling of large-scale spiking neural networks in biological real time. Specifically, the interconnect allows the transmission of a very large number of very small data packets, each conveying explicitly the source, and implicitly the time, of a single neural action potential or "spike.'' In this paper, we review the current state of the project, which has already delivered systems with up to 2500 processors, and present the real-time event-driven programming model that supports flexible access to the resources of the machine and has enabled its use by a wide range of collaborators around the world.

关键词： Brain modeling multicast algorithms multiprocessor interconnection networks neural network hardware parallel programming

来源：评论

学校读者我要写书评

暂无评论

引用

IEEE Global Communications Conference

作者： Yuan Xu Xiao Chen Dept. of Comput. Sci. Texas State Univ. San Marcos TX USA

ISBN: (纸本)9781479935130

Mobile social networks (MSNs) where people contact each other through mobile devices have become increasingly popular. In this paper, we study a special kind of MSNs formed impromptu when people gather together at conferences, social events, etc. multicast is an important routing service which supports the dissemination of messages to a group of users. Most of the existing related multicast algorithms are designed for general Delay Tolerant Networks (DTNs) where social factors are neglected. Recently, a social-profile-based multicast (SPM) protocol that utilizes the static social features in user profiles has been proposed. We believe that in a dynamic environment such as the IMSN, static social features may not reflect people's dynamic behavior. Therefore, in this paper, we propose a novel Social-Similarity-based multicast Algorithm (Multi-Sosim) using nodes' dynamic social features and a compare-split scheme to improve multicast efficiency in IMSNs. Simulation results using a real trace show that our algorithm outperforms its variations and the existing one using static social features.

关键词： information dissemination mobile computing multicast protocols social networking (online) telecommunication network routing IMSN Multi-Sosim compare-split scheme delay tolerant networks dynamic environment message dissemination mobile devices mobile social networks multicast algorithms multicast efficiency node dynamic social features routing service social-profile-based multicast protocol social-similarity-based multicast algorithm static social features user profiles Algorithm design and analysis Heuristic algorithms History Measurement Routing Unicast Vectors multicast multicast tree social features social similarity

来源：评论

学校读者我要写书评

暂无评论

A Simplified Node Selection Algorithm for multicast Resource Reservation in TDMA-based Narrowband Mobile Ad-hoc Networks

A Simplified Node Selection Algorithm for Multicast Resource...

引用

6th IFIP/IEEE Wireless Days Conference (WDays)

作者： Helmle, Sebastian Dehm, Mathias Kuhn, Michael Lieckfeldt, Dominik Pesch, Dirk Rohde & Schwarz GmbH & Co KG Stuttgart Germany Univ Appl Sci Darmstadt Darmstadt Germany Cork Inst Technol Nimbus Res Ctr Cork Ireland

ISBN: (纸本)9781479905430

The probability of packet collisions, particularly in multicast communications, can be minimised by utilising auxiliary nodes that forward reservation information to hidden nodes. In this paper, a simplified algorithm for auxiliary node selection based on geographical information is proposed and compared with algorithm used in a new NATO draft standard for narrowband MANETs. Since the proposed approach requires only information about single-hop neighbours (which is expected to be both more accurate and more frequently available), the algorithm may be beneficial in situations of high mobility and for initial network entry where only limited neighbour information is available. Utilising single-hop topology information reduces by at least 50 percent both the signalling overhead for reservation and the time until the algorithm achieves correct operation (equilibrium) compared to the NATO reference system. In addition, due to the low complexity, the algorithm may be favourable especially for devices where battery capacity is critical.

关键词： Wireless communication mobile ad-hoc networks narrowband multicast algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：