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

IEEE International Conference on Pervasive Computing and Communications (PerCom)

作者： Sean Reilly Distributed Systems Group Department of Computer Science Trinity College Dublin Ireland

We propose an extension to the event-based programming model for sensor-driven ubiquitous computing applications. The extension consists of three abstractions: Multi-event handlers, execution policies and event streams. We believe that these additional abstractions simplify the task of writing applications in this domain. We present the abstractions and describe an example application from the sports domain implemented using our prototype middleware.

关键词： Ubiquitous computing Application software computer science Educational institutions Writing Prototypes Middleware computer applications Filters Large-scale systems

来源：评论

学校读者我要写书评

暂无评论

The edge node file system: A distributed file system for high performance computing

引用

Scalable Computing 2009年第1期10卷 115-130页

作者： Ponnavaikko, Kovendhan Janakiram, D. Distributed and Object Systems Lab Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai India

The concept of using Internet edge nodes for High Performance Computing (HPC) applications has gained acceptance in recent times. Many of these HPC applications also have large I/O requirements. Consequently, an edge node file system that efficiently manages the large number of files involved can assist in improving application performance significantly. In this paper, we discuss the design of a distributed File System (DFS) specialized for HPC applications that exploits the storage, computation and communication capabilities of Internet edge nodes and empowers users with the autonomy to flex file management strategies to suit their needs. © 2009 SCPE.

关键词： File organization

来源：评论

学校读者我要写书评

暂无评论

Modeling and analysis of bandwidth-inhomogeneous swarms in BitTorrent

Modeling and analysis of bandwidth-inhomogeneous swarms in B...

引用

International Conference on Peer-to-Peer Computing

作者： M. Meulpolder J. A. Pouwelse D. H. J. Epema H. J. Sips Parallel and Distributed Systems Group Department of Computer Science Delft University of Technnology Netherlands

ISBN: (纸本)9781424450664

A number of analytical models exists that capture various properties of the BitTorrent protocol. However, until now virtually all of these models have been based on the assumption that the peers in the system have homogeneous bandwidths. As this is highly unrealistic in real swarms, these models have very limited applicability. Most of all, these models implicitly ignore BitTorrent's most important property: peer selection based on the highest rate of reciprocity. As a result, these models are not suitable for understanding or predicting the properties of real BitTorrent networks. Furthermore, they are hardly of use in the design of realistic BitTorrent simulators and new P2P protocols. In this paper, we extend existing work by presenting a model of a swarm in BitTorrent where peers have arbitrary upload and download bandwidths. In our model we group peers with (roughly) the same bandwidth in classes, and then analyze the allocation of upload slots from peers in one class to peers in another class. We show that our model accurately predicts the bandwidth clustering phenomenon observed experimentally in other work, and we analyze the resulting data distribution in swarms. We validate our model with experiments using real BitTorrent clients. Our model captures the effects of BitTorrent's well-known `tit-for-tat' mechanism in bandwidth-inhomogeneous swarms and provides an accurate mathematical description of the resulting dynamics.

关键词： Bandwidth Protocols Predictive models Mathematical model Peer to peer computing computer science Internet Mechanical factors Fluid dynamics Analytical models

来源：评论

学校读者我要写书评

暂无评论

BarterCast: A practical approach to prevent lazy freeriding in P2P networks

BarterCast: A practical approach to prevent lazy freeriding ...

引用

International Symposium on Parallel and distributed Processing (IPDPS)

作者： M. Meulpolder J.A. Pouwelse D.H.J. Epema H.J. Sips Parallel and Distributed Systems Group Department of Computer Science Delft University of Technnology Netherlands

A well-known problem in P2P systems is freeriding, where users do not share content if there is no incentive to do so. In this paper, we distinguish lazy freeriders that are merely reluctant to share but follow the protocol, versus die-hard freeriders that employ sophisticated methods to subvert the protocol. Existing incentive designs often provide theoretically attractive resistance against die-hard freeriding, yet are rarely deployed in real networks because of practical infeasibility. Meanwhile, real communities benefit greatly from prevention of lazy freeriding, but have only centralized technology available to do so. We present a lightweight, fully distributed mechanism called BARTERCAST that prevents lazy freeriding and is deployed in practice. BarterCast uses a maxflow reputation algorithm based on a peer's private history of its data exchanges as well as indirect information received from other peers. We assess different reputation policies under realistic, trace-based community conditions and show that our mechanism is consistent and effective, even when significant fractions of peers spread false information. Furthermore, we present results of the deployment of BarterCast in the BitTorrent-based Tribler network which currently has thousands of users worldwide.

关键词： Protocols Intelligent networks computer science History Peer to peer computing Proposals Privacy Particle measurements

来源：评论

学校读者我要写书评

暂无评论

Protection Based on Neighborhood-Trust in Clustered Wireless Mesh Networks

Protection Based on Neighborhood-Trust in Clustered Wireless...

引用

International Conference on Next Generation Mobile Applications, Services and Technologies (NGMAST)

作者： Fahad Samad Sadeq Ali Makram Department of Computer Science Communication and Distributed Systems RWTH Aachen University Aachen Germany

Wireless mesh network (WMWMNN) is unquestionably an interesting technology addition in wireless communication networks because of its self-organizing, self-healing and reliability dimensions. However, possible misuse or hijacking of these networks by adversaries make them highly vulnerable. In this paper, we provide a protection mechanism based on neighborhood trust to gain required security and identification privacy in a clustered WMN. Our approach renders a lightweight protection against security vulnerabilities using hash chains and does not require any trusted authority.

关键词： Protection Wireless mesh networks Privacy Authentication Information security Mesh networks Telecommunication network reliability Communication system security Network topology Next generation networking

来源：评论

学校读者我要写书评

暂无评论

Instant-X: Towards a generic API for multimedia middleware

Instant-X: Towards a generic API for multimedia middleware

引用

International Conference on Internet Multimedia Services Architecture and Applications, IMSAA

作者： Jan-Patrick Elsholz Holger Schmidt Sven Schober Franz J. Hauck Andreas Kassler Institute of Distributed Systems Ulm University Germany Computer Science Department Karlstads Universitet Sweden

ISBN: (纸本)9781424447923;9781424447930

The globalisation of our society leads to an increasing need for spontaneous communication. However, the development of such applications is a tedious and error-prone process. This results from the fact that in general only basic functionality is available in terms of protocol implementations and encoders/decoders. This leads to inflexible proprietary software systems implementing unavailable functionality on their own. In this work we introduce Instant-X, a novel component-based middleware platform for multimedia applications. Unlike related work, Instant-X provides a generic programming model with an API for essential tasks of multimedia applications with respect to signalling and data transmission. This API abstracts from concrete component implementations and thus allows replacing specific protocol implementations without changing the application code. Furthermore, Instant-X supports dynamic deployment, i.e., unavailable components can be automatically loaded at runtime. To show the feasibility of our approach we evaluated our Instant-X prototype regarding code complexity and performance.

关键词： Middleware Application software Protocols Globalization Decoding Software systems Data communication Abstracts Concrete Runtime

来源：评论

学校读者我要写书评

暂无评论

Multi-Agent-Architecture for simulating traffic management — A case study on highway networks

Multi-Agent-Architecture for simulating traffic management ...

引用

International Workshop on Nonlinear Dynamics and Synchronization, INDS

作者： Ante Vilenica Wolfgang Renz Jan Sudeikat Winfried Lamersdorf Distributed Systems and Information Systems Computer Science Department University of Hamburg Hamburg Germany Multimedia Systems Laboratory Hamburg University of Applied Sciences Hamburg Germany

ISBN: (纸本)9781424438440;9781424422876

This paper addresses the automated management and simulation of capacity problems for motor highway infrastructures, which often cannot keep up with traffic increases produced by, e.g., cars, motorbikes and trucks. Such kinds of problems require rather intelligent highway infrastructure management with strategies with, often, contradictory goals: On the one hand side, individual drivers would like to use a traffic infrastructure which suits their individual needs best, e.g. with respect to time, resources, and personal driving comfort, and, on the other, the highway operators may want to optimize the use of their respective traffic infrastructure w.r.t. security, cost, and overall user satisfaction. This paper claims that such kinds of problems can be modelled best with using agent-oriented models and techniques. Therefore, it demonstrates how to use a generic multi-agent-system architecture that supports both modelling and simulating of such an application. It demonstrates how such an architecture can be used for applying, analyzing and comparing different traffic management strategies, inspired by different sources like network management, feedback control, or nature inspired coordination algorithms.

关键词： Telecommunication traffic Traffic control Road transportation Automated highways Motorcycles Resource management Security Cost function Algorithm design and analysis Communication system traffic control

来源：评论

学校读者我要写书评

暂无评论

Offer-based scheduling of deadline-constrained Bag-of-Tasks applications for utility computing systems

Offer-based scheduling of deadline-constrained Bag-of-Tasks ...

引用

International Symposium on Parallel and distributed Processing (IPDPS)

作者： Marco A. S. Netto Rajkumar Buyya Grid Computing and Distributed Systems Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia

Metaschedulers can distribute parts of a bag-of-tasks (BoT) application among various resource providers in order to speed up its execution. When providers cannot disclose private information such as their load and computing power, which are usually heterogeneous, the metascheduler needs to make blind scheduling decisions. We propose three policies for composing resource offers to schedule deadline-constrained BoT applications. Offers act as a mechanism in which resource providers expose their interest in executing an entire BoT or only part of it without revealing their load and total computing power. We also evaluate the amount of information resource providers need to expose to the metascheduler and its impact on the scheduling. Our main findings are: (i) offer-based scheduling produces less delay for jobs that cannot meet deadlines in comparison to scheduling based on load availability (i.e. free time slots); thus it is possible to keep providers' load private when scheduling multi-site BoTs; and (ii) if providers publish their total computing power they can have more local jobs meeting deadlines.

关键词： Processor scheduling computer applications Job shop scheduling Grid computing Cloud computing Application software Information resources Delay Biological system modeling Message passing

来源：评论

学校读者我要写书评

暂无评论

A Lie group based Gaussian mixture model distance measure for multimedia comparison 09

A Lie group based Gaussian mixture model distance measure fo...

引用

1st International Conference on Internet Multimedia Computing and Service, ICIMCS 2009

作者： Gong, Liyu Wang, Tianjiang Yu, Yan Liu, Fang Hu, Xiangen Intelligent and Distributed Computing Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan Hubei 430074 China Department of Information and Computing Science School of Science Wuhan University of Science and Technology Wuhan Hubei 430065 China Department of Psychology Institute for Intelligent Systems University of Memphis Memphis TN 38152 United States

ISBN: (纸本)9781605588407

In this paper, we propose a novel method to measure the distance between two Gaussian Mixture Models. The proposed distance measure is based on the minimum cost that must paid to transform from one Gaussian Mixture Model into the other. We parameterize the components of a Gaussian Mixture Model which are Gaussian probability density functions (pdf) as positive definite lower triangular transformation matrices. Then we identify that Gaussian pdfs form a Lie group. Based on Lie group theory, the geodesic length can be used to measure the minimum cost that must paid to transform from one Gaussian pdf into the other. Combining geodesic length with the earth mover's distance, we propose the Lie group earth mover's distance for Gaussian Mixture Models. We test our distance measure in image retrieval. The experimental results indicate that our distance measure is more effective than other measures including the Kullback-Liebler divergence. Copyright 2009 ACM.

关键词： Probability density function

来源：评论

学校读者我要写书评

暂无评论

Evaluation of P2P overlays for aoi management in distributed virtual environments

Evaluation of P2P overlays for aoi management in distributed...

引用

2009 International Conference on Ultra Modern Telecommunications and Workshops

作者： Bettinger, Christian Oechsle, Rainer Esch, Markus Schloss, Hermann Sturm, Peter Trier University of Applied Sciences Department of Computer Science D-54293 Trier Germany University of Luxembourg Faculty of Sciences Technology and Communication 1359 Luxembourg Luxembourg University of Trier System Software and Distributed Systems D-54286 Trier Germany

ISBN: (纸本)9781424439416

Client/Server-based DVE approaches incur scalability and load balancing problems while addressing massive number of users. In order to mitigate these problems P2P overlays are proposed for content provision and management issues instead. However, content provision and management in a distributed manner is much more complicated and requires an exhaustive study of overlay network properties. In order to investigate which kinds of overlay networks suit the requirements stated by DVEs at best, we have performed a comparative evaluation of the deterministic DHT-based Tapestry overlay and the nondeterministic prefix-tree-based P-Grid overlay considering their data location performance and construction cost. In this paper we discuss these evaluation results and exemplarily show how AoI management and content provision can be realized by using the P-Grid overlay. ©2009 IEEE.

关键词： Overlay networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：