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

4th International Workshop on Self-Organizing systems, IWSOS 2009

作者： Spyropoulos, Thrasyvoulos Hummel, Karin Anna ETH Zürich Computer Engineering and Networks Laboratory ETZ G 96 Gloriastr. 35 Zürich Switzerland University of Vienna Department of Distributed and Multimedia Systems Lenaugasse 2/8 Vienna Austria

来源：评论

学校读者我要写书评

暂无评论

Fault-Tolerant Scheduling of Independent Tasks in Computational Grid

Fault-Tolerant Scheduling of Independent Tasks in Computatio...

引用

International Conference on Communication systems

作者： Qin Zheng Bharadwaj Veeravalli Chen-khong Tham Computer Networks and Distributed Systems Laboratory (CNDS) Department of Electrical and Computer Engineering National University of Singapore Singapore

Primary-backup approach is a common approach used for fault tolerance wherein each task has a primary copy and a backup copy on two different processors. The backup copy can overlap with other backup copies on the same processor, as long as their corresponding primary copies are scheduled on different processors. In this paper, we consider the problem of fault-tolerant scheduling of independent tasks using primary-backup approach with backup overlapping in computational grid. A fault-tolerant scheduling algorithm is developed which minimizes replication cost for backup copy by taking into account backup overlapping in cost function. A centralized scheme and a distributed scheme are developed for the proposed algorithm and their performance are studied through simulation experiments

关键词： Fault tolerance Processor scheduling Grid computing Fault tolerant systems Cost function distributed computing Scheduling algorithm computer networks Hardware Intelligent networks

来源：评论

学校读者我要写书评

暂无评论

On the resource allocation and pricing strategies in Compute Clouds using bargaining approaches

On the resource allocation and pricing strategies in Compute...

引用

IEEE International Conference on networks

作者： Ganesh Neelakanta Iyer Bharadwaj Veeravalli Computer Networks and Distributed Systems (CNDS) Laboratory Department of Electrical and Computer Engineering National University of Singapore Singapore

In this paper, we consider addressing the resource allocation and pricing strategies in a Compute Cloud for both independent tasks and tasks from workflow schemes. Workflow scheduling of tasks is an important problem due to the fact that individual sub-tasks constituting the workflow may demand additional resources and hence may stall the entire process. We employ two axiomatic bargaining approaches (Nash Bargaining Solution (NBS) and Raiffa Bargaining Solution (RBS)) proposed in the literature to formulate the problem and derive an optimal solution for allocating virtual CPU instances in a Compute Cloud for both independent tasks and workflow tasks. We also analyze the effectiveness of our strategies via rigorous simulation experiments and we show that our strategies are adaptable to the requirements by the Cloud service providers (CSPs) in estimating the resource requirements. Further, we show that NBS ensures proportional fairness whereas RBS can handle real-time task arrivals and task dynamics. Finally we introduce the concept of asymmetric pricing scheme in which a user can specify his budget constraints and CSPs can attempt to maximize the revenue without sacrificing the performance. This asymmetric bargaining approach is an important contribution in this work which allows the CSP to choose different parameters such as deadline and/or budget requirements for deriving optimal resource allocation. The deadline based resource allocation is particularly useful for workflow-based applications which have tasks waiting for the completion of other tasks.

关键词： NIST Resource management Pricing Real time systems Equations Quality of service Games

来源：评论

学校读者我要写书评

暂无评论

A Comprehensive Worst-Case Calculus for Wireless Sensor networks with In-Network Processing

A Comprehensive Worst-Case Calculus for Wireless Sensor Netw...

引用

Real-Time systems Symposium (RTSS)

作者： Jens B. Schmitt Frank A. Zdarsky Lothar Thiele Distributed Computer Systems Laboratory University of Kaiserslautern Germany Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology Switzerland

Today's wireless sensor networks (WSN) focus on energy-efficiency as the main metric to optimize. However, an increasing number of scenarios where sensor networks are considered for time-critical purposes in application scenarios like intrusion detection, industrial monitoring, or health care systems demands for an explicit support of performance guarantees in WSNs and, thus, in turn for a respective mathematical framework. In (J. Schmitt and U. Roedig, 2005) , a sensor network calculus was introduced in order to accommodate a worst-case analysis of WSNs. This sensor network calculus focused on the communication aspect in WSNs, but had not yet a possibility to treat in-network processing in WSNs. In this work, we now incorporate in-network processing features as they are typical for WSNs by taking into account computational resources on the sensor nodes. Furthermore, we propose a simple, yet effective priority queue management discipline which achieves a good balance of response times across sensor nodes in the field.

关键词： Calculus Wireless sensor networks Energy efficiency Sensor systems and applications Time factors Intrusion detection Monitoring Medical services Sensor phenomena and characterization Delay

来源：评论

学校读者我要写书评

暂无评论

Resource Unaware Computing - A distributed Strategy for Divisible Load Processing on Linear Daisy Chain networks

Resource Unaware Computing - A Distributed Strategy for Divi...

引用

IEEE International Conference on networks

作者： Jingxi Jia Bharadwaj Veeravalli Computer Networks and Distributed Systems Laboratory (CNDS) Department of Electrical and Computer Engineering National University of Singapore Singapore

ISBN: (纸本)0780397460

In this paper we present a novel load distribution strategy for scheduling divisible loads on linear networks, when the speeds of the computing nodes and the speeds of the communication links are unknown. This practical assumption is captured in our problem formulation and we present a novel strategy, referred to as early start strategy (ESS), to generate a load distribution. Our strategy estimates the speed parameters and takes distinct advantage in utilizing a processor that responds earliest in the computation and including other fast processors in a progressive manner in phases to minimize the overall processing time. We analyze the strategy under several influencing parameters such as, load size, network size, and probe load size. We present simulation studies to validate all the theoretical findings and quantify the performance of our strategy

关键词： computer networks distributed computing Processor scheduling Electronic switching systems Probes Delay effects Laboratories Drives Distribution strategy Parameter estimation

来源：评论

学校读者我要写书评

暂无评论

ANCAEE: A Novel Clustering Algorithm for Energy Efficiency in Wireless Sensor networks

引用

Wireless Sensor Network 2011年第9期3卷 307-312页

作者： A. P. Abidoye N. A. Azeez A. O. Adesina K. K. Agbele Wireless Sensor Networks & Natural Language Research Group Grid Computing & Distributed Systems Laboratory Department of Computer Science University of the Western Cape

One of the major constraints of wireless sensor networks is limited energy available to sensor nodes because of the small size of the batteries they use as source of power. Clustering is one of the routing techniques that have been using to minimize sensor nodes’ energy consumption during operation. In this paper, A Novel Clustering Algorithm for Energy Efficiency in Wireless Sensor networks (ANCAEE) has been proposed. The algorithm achieves good performance in terms of minimizing energy consumption during data transmission and energy consumptions are distributed uniformly among all nodes. ANCAEE uses a new method of clusters formation and election of cluster heads. The algorithm ensures that a node transmits its data to the cluster head with a single hop transmission and cluster heads forward their data to the base station with multi-hop transmissions. Simulation results show that our approach consumes less energy and effectively extends network utilization.

关键词： Sensor Nodes Clusters Cluster heads Wireless Sensor networks Base Station Clustering Algorithms Energy Efficiency

来源：评论

学校读者我要写书评

暂无评论

Hotspotter: An Incentivized Crowdsensing System for WiFi and Cellular Network Coverage Visualization

Hotspotter: An Incentivized Crowdsensing System for WiFi and...

引用

Asia-Pacific Conference on Communications

作者： Sebastian Luis S. Ortiz Justin Gabriel R. Enriquez Wilson M. Tan Cedric Angelo M. Festin Department of Computer Science Networks and Distributed Systems Laboratory University of the Philippines - Diliman Metro Manila Philippines

ISBN: (数字)9798331517816

ISBN: (纸本)9798331517823

Reliable internet access is a key enabler for economic growth. Although the Philippine government launched initiatives to improve connectivity, connection speeds remained below the global average, especially for mobile networks. This paper presents Hotspotter, a system that aims to aid implementers and stakeholders in quantifying and addressing network coverage issues. Hotspotter is an incentivized crowdsensing system that collects, maps, and visualizes WiFi and cellular data to pinpoint hotspots and dead zones for the effective deployment and relocation of WiFi access points. A mobile application for Android was developed to facilitate data collection on geolocation, nearby WiFi access points, and connected cellular networks. The user interface visualizes the aggregated data in a hexagon-grid map. Fieldwork was conducted in two sitios of Barangay San Lorenzo, Norzagaray, Bulacan to stress-test the Hotspotter system in a Geographically Isolated and Disadvantaged Area (GIDA). It was found that 2G and 4G had the widest coverage and strongest signals overall, with modal signal strengths of 4.0 and 3.0, respectively. Being at the cutting edge, 5G was not yet supported. In the end, the mobile application’s passive sensing, collecting, and caching of data successfully operated even in the most isolated areas without an internet connection.

关键词： Cellular networks Crowdsensing Geology Government Data visualization Sensors Mobile applications Stakeholders Reliability Wireless fidelity

来源：评论

学校读者我要写书评

暂无评论

Majority Consensus Protocol for Strong Consistency and High Availability

Majority Consensus Protocol for Strong Consistency and High ...

引用

ChinaGrid Annual Conference (ChinaGrid)

作者： Rishan Chen Jiaji Zhu Wenhui Yao Jian Zhou Bo Peng Laboratory of Computer Networks and Distributed Systems Peking University Beijing China Alibaba Inc. Beijing China

This paper presents a new approach to coordinating clusters of fail-over storage servers. The proposed protocol is designed for supporting large scale on-line storage services which positioned for strong consistency and high availability. Without sacrificing much performance, the protocol requires only one round-trip message communication with redundant servers. A distributed file system with single centralized master extended with this protocol confirms its efficiency as tens of thousands of operations per second and high availability of 99.9995%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Int-BEB: Enhanced Binary Exponential Backoff using Q-learning

Int-BEB: Enhanced Binary Exponential Backoff using Q-learnin...

引用

International Conference on Pattern Analysis and Intelligent systems (PAIS)

作者： N. Zerguine Department of Computer Science Networks and Distributed Systems Laboratory Ferhat Abbas Setif 1 University Setif Algeria

Because of their development and success, MANETs are now preferred alternatives in many fields of study and application. The IEEE 802.11 standard is the basis of most wireless technologies. To treat collisions in wireless networks, IEEE 802.11 distributed Coordination Function (DCF) MAC layer employs Binary Exponential Backoff (BEB) algorithm, that is helpful in decreasing the potential of collision, but comes at the expense of several network performance metrics, such as medium access delay, bandwidth management, power use, and fairness. A Deep Learning technique called Deep Reinforcement Learning (DRL) allows an agent to communicate with the environment in order to accomplish a goal. In the present paper, we suggest Q-learning (QL), one of the DRL approaches to improve the Binary Exponential Backoff (BEB) in MANETs. The intelligently designed Int-BEB aims for better CW selection; this selection strikes to reduce collisions as much as possible and to give more chances to nodes that make collisions to access the channel by taking into consideration their residual energy. In-depth simulations are performed to evaluate the performance of the proposed mechanism. The performance of Int-BEB is evaluated in diverse networks with several criteria such as packet successful transmission, packet loss and energy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Network-based Caching Algorithms for Reservation-based Multimedia systems

Network-based Caching Algorithms for Reservation-based Multi...

引用

International Conference on Grid and Cooperative Computing (GCC)

作者： Bharadwaj Veeravalli Zeng Zeng Neeraj Gupta Guoguang Jia Computer Networks and Distributed Systems Laboratory National University of Singapore Singapore School of Computer and Communication Hunan University Changsha Hunan China

As streaming video over the Internet becomes increasingly popular, cost-effective caching of these large multimedia documents has become of utmost importance. For large media objects, such as a 2-hour video, treating the whole video as a single Web object for caching is not appropriate. The paper presents reservation-based caching algorithms to evaluate a segment-based buffer management approach for off-line scheduling and caching in polynomial time. The cache admission and replacement policies decide when, where and for how long videos will be cached. Requests for videos are available a priori

关键词： Multimedia systems Costs Streaming media Network servers Bandwidth Motion pictures Cache storage computer networks Processor scheduling High-speed networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：