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

Modeling Dynamic Adaptive Streaming Over Information-Centric Networking

IEEE ACCESS 2016年 4卷 8362-8374页

作者： Jia, Riheng Liu, Zhe Wang, Xiong Gan, Xiaoying Wang, Xinbing Xu, Jun (Jim) Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200240 Peoples R China Xidian Univ State Key Lab Integrated Serv Networks Xian 710071 Peoples R China Georgia Inst Technol Coll Comp Atlanta GA 30332 USA

The dynamic adaptive streaming technique flexibly adapts the video bit-rate to link fluctuations, which can improve the quality of experience (QoE). In this paper, we present a systematic framework of video streaming in the context of information-centric networking, in order to facilitate the largescale deployment of the dynamic adaptive streaming technique. Specifically, we design the network as a two-layer coordinating structure, namely, the control layer and the transmission layer. The control layer employs the statistical data recorders to record the variations of the video popularity, link states, and user demands. On the other side, the network forwards user requests and caches data packets in the transmission layer, based on the statistical data which is obtained in the control layer. In addition, the network executes the real-time monitoring of link conditions in the transmission layer, and adjusts the video bit-rate accordingly. Under the above feedback circumstance, we first develop a distributed algorithm of joint dynamic forwarding and caching to theoretically maximize the total user demand rates within the network stability region. Then, we modify the distributed algorithm with a practical caching strategy to make the system applicable to real scenarios. Simulation results show the superior performance of the modified distributed algorithm in terms of low user delay and high QoE performance.

关键词： Information-centric networking (ICN) video streaming distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

A New Approach for Stability Maintenance of Wireless Control Network

A New Approach for Stability Maintenance of Wireless Control...

引用

International Conference on Energy, Communication, Data Analytics and Soft Computing

作者： Bhagyashri Dhondiram Bhalekar Dilip K. Budhwant Department of computer science and engineering MGM'S JNEC

ISBN: (纸本)9781538618882

Problem of instability of wireless control network has been studying from many years using computation of in network method. Architecture known as "Wireless Control Network"(WCN) in which each node in network maintain its own state and simultaneously update combination of output of neighboring node and node's own state, but this network has been shown to have little computational overhead, information loss, inflexibility of network, delay while sending and receiving data, security problem, scheduling problem. To overcome these problems, this paper represents fundamental topological conditions of network. For achieving this goal, "Liner iterative strategy" is used. So that wireless control network acts as linear dynamic network and analyze coupling between plants dynamic and network dynamic. Control input calculated if connectivity of vertex of network is larger than Eigen value of network. This is similar to min-cut condition which is required to problem of dissemination of information. Paper also represent conditions for stability of point to point network.

关键词： Wireless control network Network coding Sensor Actuator Controller Linear iterative strategy Network dynamic distributed algorithm Internal state Eigen values In-network stabilization Stability of network Time step

来源：评论

学校读者我要写书评

暂无评论

Approaching Optimal Centralized Scheduling With CSMA-Based Random Access Over Fading Channels

引用

IEEE COMMUNICATIONS LETTERS 2016年第6期20卷 1183-1186页

作者： Karaca, Mehmet Landfeldt, Bjorn Lund Univ Dept Elect & Informat Technol S-22100 Lund Sweden

Carrier sense multiple access (CSMA) based distributed algorithms can attain the largest capacity region as the centralized Max-Weight policy does. Despite their capability of achieving throughput optimality, these algorithms can either incur large delay and have large complexity or only operate over non-fading channels. In this letter, by assuming arbitrary backoff time, we first propose a fully distributed randomized algorithm whose performance can be pushed to the performance of the centralized Max-Weight policy not only in terms of throughput but also in terms of delay for completely connected interference networks with fading channels. Then, inspired by the proposed algorithm, we introduce an implementable distributed algorithm for practical networks with a reservation scheme. We show that the proposed practical algorithm can still achieve the performance of the centralized Max-Weight policy.

关键词： Max-Weight scheduling CSMA queue stability distributed algorithm fading channels

来源：评论

学校读者我要写书评

暂无评论

From division of labor to the collective behavior of social insects

引用

BEHAVIORAL ECOLOGY AND SOCIOBIOLOGY 2016年第7期70卷 1101-1108页

作者： Gordon, Deborah M. Stanford Univ Dept Biol Stanford CA 94305 USA

'Division of labor' is a misleading way to describe the organization of tasks in social insect colonies, because there is little evidence for persistent individual specialization in task. Instead, task allocation in social insects occurs through distributed processes whose advantages, such as resilience, differ from those of division of labor, which are mostly based on learning. The use of the phrase 'division of labor' persists for historical reasons, and tends to focus attention on differences among individuals in internal attributes. This focus distracts from the main questions of interest in current research, which require an understanding of how individuals interact with each other and their environments. These questions include how colony behavior is regulated, how the regulation of colony behavior develops over the lifetime of a colony, what are the sources of variation among colonies in the regulation of behavior, and how the collective regulation of colony behavior evolves.

关键词： Task allocation distributed algorithm Social insects Collective behavior

来源：评论

学校读者我要写书评

暂无评论

Uniform Information Exchange in Multi-channel Wireless Ad Hoc Networks 17

Uniform Information Exchange in Multi-channel Wireless Ad Ho...

引用

International Conference on Autonomous Agents and Multiagent Systems

作者： Dongxiao Yu Li Ning Yong Zhang Hai Jin Yuexuan Wang Francis C. M. Lau Shengzhong Feng Services Computing Technology and System Lab Big Data Technology and System Lab Clusters and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Center for High Performance Computing Shenzhen Institutes of Advanced Technology CAS Department of Computer Science The University of Hong Kong

ISBN: (纸本)9781510855076

Information exchange is a basic primitive for maintaining the smooth running of a network or a system with multiple communicating agents. Given k packets initially stored at k nodes respectively, the problem is to disseminate the k packets to the whole network with the objective of minimizing the time used. We study this problem in single-hop multi-channel networks of n nodes, and target on devising uniform distributed protocols that do not rely on any prior knowledge of network parameters, such as the network size n or the number of packet holders k. Uniform protocols have better scalability and are more suitable for implementation in reality Specifically, we propose a uniform distributed protocol that with high probability accomplishes the dissemination in O(k/F+F·log n) rounds, assuming F available channels. This protocol is asymptotically optimal when k is large (k ≥ F~2 log n), and provides the best possible linear speedup with multiple channels comparing with the results using a single channel. To the best of our knowledge, this is the first uniform protocol for information exchange in multi-channel networks.

关键词： Information exchange Multi-channel networks distributed algorithm Uniform protocol information exchange distributed algorithms MULTICHANNEL Packet Uniform Uniforms Mobile ad hoc networks distributed protocol network parameters single-channel

来源：评论

学校读者我要写书评

暂无评论

Synchronous Robots vs Asynchronous Lights-Enhanced Robots on Graphs

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2016年 322卷 169-180页

作者： D'Emidio, Mattia Frigioni, Daniele Navarra, Alfredo GSSI Viale Francesco Crispi I-67100 Laquila Italy Univ Aquila Dept Informat Engn Comp Sci & Math Via Vetoio I-67100 Laquila Italy Univ Perugia Dept Math & Comp Sci Via Vanvitelli 1 I-06123 Perugia Italy

In this paper, we consider the distributed setting of computational mobile entities, called robots, that have to perform tasks without global coordination. Depending on the environment as well as on the robots' capabilities, tasks might be accomplished or not. In particular, we focus on the well-known scenario where the robots reside on the nodes of a graph and operate in Look-Compute-Move cycles. In one cycle, a robot perceives the current configuration in terms of robots positions (Look), decides whether to move toward some edge of the graph (Compute), and in the positive case it performs an instantaneous move along the computed edge (Move). We then compare two basic models: in the first model robots are fully synchronous, while in the second one robots are asynchronous and lights-enhanced, that is, each robot is equipped with a constant number of lights visible to all other robots. The question whether one model is more powerful than the other in terms of computable tasks has been considered in [Das et al., Int.'l Conf. on distributed Computing Systems, 2012] but for robots moving on the Euclidean plane rather than on a graph. We provide two different tasks, and show that on graphs one task can be solved in the fully synchronous model but not in the asynchronous lights-enhanced model, while for the other task the converse holds. Hence we can assert that the fully synchronous model and the asynchronous lights-enhanced model are incomparable on graphs. This opens challenging directions in order to understand which peculiarities make the models so different.

关键词： distributed algorithm Synchronicity Mobile Robots Luminous Robots

来源：评论

学校读者我要写书评

暂无评论

Discovery Through Gossip

引用

RANDOM STRUCTURES & algorithmS 2016年第3期48卷 565-587页

作者： Haeupler, Bernhard Pandurangan, Gopal Peleg, David Rajaraman, Rajmohan Sun, Zhifeng Carnegie Mellon Univ Dept Comp Sci Pittsburgh PA 15213 USA Nanyang Technol Univ Div Math Sci Singapore 637371 Singapore Brown Univ Dept Comp Sci Providence RI 02912 USA Univ Houston Dept Comp Sci Houston TX 77204 USA Weizmann Inst Sci Dept Comp Sci & Appl Math IL-76100 Rehovot Israel Northeastern Univ Coll Comp & Informat Sci Boston MA 02115 USA

We study randomized gossip-based processes in dynamic networks that are motivated by information discovery in large-scale distributed networks such as peer-to-peer and social networks. Awell-studied problem in peer-to-peer networks is resource discovery, where the goal for nodes (hosts with IP addresses) is to discover the IP addresses of all other hosts. Also, some of the recent work on self-stabilization algorithms for P2P/overlay networks proceed via discovery of the complete network. In social networks, nodes (people) discover new nodes through exchanging contacts with their neighbors (friends). In both cases the discovery of new nodes changes the underlying network new edges are added to the network - and the process continues in the changed network. Rigorously analyzing such dynamic (stochastic) processes in a continuously changing topology remains a challenging problem with obvious applications. This paper studies and analyzes two natural gossip-based discovery processes. In the push discovery or triangulation process, each node repeatedly chooses two random neighbors and connects them (i. e., "pushes" their mutual information to each other). In the pull discovery process or the two-hop walk, each node repeatedly requests or "pulls" a random contact from a random neighbor and connects itself to this two-hop neighbor. Both processes are lightweight in the sense that the amortized work done per node is constant per round, local, and naturally robust due to the inherent randomized nature of gossip. Our main result is an almost-tight analysis of the time taken for these two randomized processes to converge. We show that in any undirected n-node graph both processes take O(n log(2) n) rounds to connect every node to all other nodes with high probability, whereas Omega(n log n) is a lower bound. We also study the two-hop walk in directed graphs, and show that it takes O(n(2) log n) time with high probability, and that the worst-case bound is tight for arbitrary dir

关键词： random process resource discovery social network gossip-based algorithm distributed algorithm probabilistic analysis

来源：评论

学校读者我要写书评

暂无评论

distributed algorithms for Energy-Efficient Even Self-Deployment in Mobile Sensor Networks

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2014年第5期13卷 1035-1047页

作者： Song, Yuan Wang, Bing Shi, Zhijie Pattipati, Krishna R. Gupta, Shalabh Univ Connecticut Dept Comp Sci & Engn Storrs CT 06269 USA Univ Connecticut Dept Elect & Comp Engn Storrs CT 06269 USA

Even self-deployment is one of the best strategies to deploy mobile sensors when the region of interest is unknown and manual deployment is infeasible. A widely used distributed algorithm, Lloyd` s method, can achieve even self-deployment. It however suffers from two critical issues when being used in mobile sensor networks. First, it does not consider limited sensor communication range. Second, it does not optimize sensor movement distances, and hence can lead to excessive energy consumption, a primary concern in sensor networks. This paper first formulates a locational optimization problem that achieves even deployment while it takes account of energy consumption due to sensor movement, and then proposes two iterative algorithms. The first algorithm, named Lloyd-a, reduces the movement step sizes in Lloyd` s method. It saves traveling distance whilemaintaining the convergence property. However, it leads to a larger number of deployment steps. The second algorithm, named distributed Energy-Efficient selfDeployment (DEED), reduces sensor traveling distances and requires a comparable number of deployment steps as that in Lloyd` s method. This paper further proposes an intuitivemethod to deal with limited sensor communication range that is applicable to all three methods. Extensive simulation using NS-2 demonstrates that DEED leads to up to 54 percent less traveling distance and 46 percent less energy consumption than Lloyd` smethod.

关键词： Mobile sensor networks distributed algorithm even self-deployment Lloyd's method centroidal voronoi tessellation

来源：评论

学校读者我要写书评

暂无评论

Efficient Parallel algorithm for Optimal DAG Structure Search on Parallel Computer with Torus Network 16th

Efficient Parallel Algorithm for Optimal DAG Structure Searc...

引用

16th International Conference on algorithms and Architectures for Parallel Processing (ICA3PP)

作者： Honda, Hirokazu Tamada, Yoshinori Suda, Reiji Univ Tokyo Grad Sch Informat Sci & Technol Tokyo 1138656 Japan

ISBN: (纸本)9783319495835;9783319495828

The optimal directed acyclic graph search problem constitutes searching for a DAG with a minimum score, where the score of a DAG is defined on its structure. This problem is known to be NP-hard, and the state-of-the-art algorithm requires exponential time and space. It is thus not feasible to solve large instances using a single processor. Some parallel algorithms have therefore been developed to solve larger instances. A recently proposed parallel algorithm can solve an instance of 33 vertices, and this is the largest solved size reported thus far. In the study presented in this paper, we developed a novel parallel algorithm designed specifically to operate on a parallel computer with a torus network. Our algorithm crucially exploits the torus network structure, thereby obtaining good scalability. Through computational experiments, we confirmed that a run of our proposed method using up to 20,736 cores showed a parallelization efficiency of 0.94 as compared to a 1296-core run. Finally, we successfully computed an optimal DAG structure for an instance of 36 vertices, which is the largest solved size reported in the literature.

关键词： Optimal DAG structure Optimal bayesian network structure Parallel algorithm distributed algorithm Torus network

来源：评论

学校读者我要写书评

暂无评论

Uniform Circle Formation by Asynchronous Robots: A Fully-distributed Approach

Uniform Circle Formation by Asynchronous Robots: A Fully-Dis...

引用

International Conference on Computer Communication and Networks

作者： Shan Jiang Jiannong Cao Jia Wang Milos Stojmenovic Julien Bourgeois Hong Kong Polytechnic University Hong Kong China Singidunum University Belgrade Serbia FEMTO-ST Institute Montbeliard France

Recent advances in robotics technology have made it practical to deploy a large number of inexpensive robots in a wide range of application domains. In many of those applications, a group of autonomous robots is required to form a predefined geometric shape such as a line or a circle. This problem, namely pattern formation, is one of the most important coordination problems in multi-robot systems. A particular pattern extensively studied in literature is the uniform circle, and the corresponding problem is called uniform circle formation. In uniform circle formation, a set of simple mobile robots (asynchronous, autonomous), starting from arbitrary positions on the plane, have to arrange themselves on the vertices of a regular polygon eventually. Towards addressing the problem, existing works usually make conveniently strong assumptions, i.e., the robots are regarded as mass points and have unlimited sensing and communication range. The question of whether the robots with actual size and limited sensing and communication range could form a uniform circle, to our knowledge, has remained open. In this paper, we propose a new approach towards addressing this issue. Three phases, consensus on the circle, circle formation, and uniform transformation, constitute our approach. We propose novel distributed algorithms for convex hull construction and cardinality estimation. Simulation results, theoretical analysis, and successful deployment have shown the effectiveness and practicability of our approach.

关键词： multi-robot system uniform circle formation distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：