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

IEEE Annual Conference on Pervasive Computing and Communications Workshops (PerCom)

作者： T. Heer S. Gotz S. Rieche K. Wehrle Protocol Engineering and Distributed Systems Group Wilhelm-Schickard-Institute for Computer Science University of Tübingen

While unstructured P2P systems have been embraced widely in mobile ad-hoc networks (MANETs), the applicability of structured approaches like distributed hash tables (DHTs) to such settings remains controversial. Existing research delivers promising empirical results addressing the concerns about performance, complexity, and reliability, but does not analyze the principles of combining DHTs and MANETs. This paper identifies and discusses the fundamental implications of non-infrastructural networks for DHTs and analyzes solutions to these challenges

关键词： Mobile ad hoc networks Protocols Peer to peer computing Routing Broadcasting systems engineering and theory computer science Mobile computing Ad hoc networks computer network reliability

来源：评论

学校读者我要写书评

暂无评论

Using Kademlia for the configuration of B3G radio access nodes

Using Kademlia for the configuration of B3G radio access nod...

引用

IEEE Annual Conference on Pervasive Computing and Communications Workshops (PerCom)

作者： S. Oechsner T. Hossfeld K. Tutschku F.-U. Andersen L. Caviglione Department of Distributed Systems Institute of Computer Science University of Würzburg Germany Siemens AG Berlin Germany Department of Communications Computer and Systems Science University of Genova Italy

Configuration and management of radio access nodes in beyond 3G (B3G) networks such as nodeBs, wireless LAN or WIMAX access points is a complex task that consumes a high amount of resources. Most configuration changes have to be done by an operator, especially when it comes to the adaption of a node to its environment, i.e., the cells surrounding its own. This is an expensive and inflexible method. Moreover, the required manual interference hampers the adaptivity of B3G networks towards topology changes. In this work, we present an architecture that allows for the detection of neighboring cells, thereby enabling an easy or even autonomic configuration of the access nodes. In addition to this, the presented Kademlia-based overlay network enables the storage of information needed for network management, such as configuration data or performance measures

关键词： computer network management Radio spectrum management Wireless LAN WiMAX Network topology computer science computer networks distributed computing Resource management Interference

来源：评论

学校读者我要写书评

暂无评论

Web Services for the Integration of XML-Based Content into Learning Platforms: A Three-level Model

Web Services for the Integration of XML-Based Content into L...

引用

International Symposium on Leveraging Applications of Formal Methods, Verification and Validation ( ISoLA)

作者： Reinhold Kröger Ulrike Lucke Markus Schmid Djamshid Tavangarian Distributed Systems Laboratory University of Applied Sciences of Wiesbaden Germany Institute of Computer Science University of Rostock Germany

Along with the increasing diversity of educational markup languages there is a strong need for flexible integration of such content into learning platforms. Therefore, we have identified four basic mechanisms: plain linking from the platform to external content, conversion of content into the platforms native format, and service-based invocation of external content as well as specific functionality related to it. Architectural principles, benefits, and drawbacks of these concepts are compared, and exemplary realizations are described.

关键词： Web services Markup languages Multidimensional systems Packaging Runtime Joining processes XML Application software computer science computer architecture

来源：评论

学校读者我要写书评

暂无评论

distributed wisdom: Designing a replication service for large peer-to-peer data grids

引用

IEEE distributed systems Online 2006年第3期7卷 25-30页

作者： Srinivas, A. Vijay Reddy, M. Venkateswara Janakiram, D. Indian Institute of Technology Madras India Distributed and Object Systems Lab. Department of Computer Science and Engineering Indian Institute of Technology Madras India Department of Computer Science and Engineering Indian Institute of Technology Madras India

Some of the key issues in building services for large scale distributed systems, realizing Vishwa, a peer-to-peer (P2P) middleware architecture for developing grid applications are discussed. Researchers are producing large amounts of scientific data and believe that distributed computations on the data must be scheduled and available to a large number of scientists. It is suggested that the platform must scale up to a large number of nodes and data units in the system and must also be scalable geographically. A scalable, reconfigurable shared-object space over the two-layer architecture can be developed that incorporates mechanisms to maintain replicated data and must also provide a shared-object abstraction over a wide-area distributed system.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Throughput Performance of Java Messaging Services Using FioranoMQ

Throughput Performance of Java Messaging Services Using Fior...

引用

13th GI/ITG Conference - Measuring, Modelling and Evaluation of computer and Communication systems

作者： Robert Henjes Michael Menth Sebastian Gehrsitz Department of Distributed Systems Institute of Computer Science University of Würzburg Am Hubland D-97074 Würzburg Germany

The Java messaging service (JMS) is a means to organize communication among distributed applications according to the publish/subscribe principle. If the subscribers install filter rules on the JMS server, JMS can be used as a message routing platform, but it is not clear whether its message throughput is sufficiently high to support large-scale systems. In this paper, we investigate the capacity of the high performance JMS server implementation by Fiorano. In contrast to other studies, we focus on the message throughput in the presence of filters and show that filtering reduces the performance significantly. We also present a model that describes the service time for a single message depending on the number of installed filters and validate it by measurements. This model helps to forecast the system throughput for specific application scenarios.

关键词： Random access memory Throughput

来源：评论

学校读者我要写书评

暂无评论

Backup Capacity Requirements for MPLS Fast Reroute

Backup Capacity Requirements for MPLS Fast Reroute

引用

2006 ITG Symposium on Photonic Networks

作者： Ruediger Martin Michael Menth Department of Distributed Systems Institute of Computer Science University of Würzburg Am Hubland D-97074 Würzburg Germany

ISBN: (纸本)9783800729593;3800729598

MPLS fast reroute (MPLS-FRR) mechanisms deviate the traffic in case of network failures at the router closest to the outage location to achieve an extremely fast reaction time. We review and compare the one-to-one backup and the facility backup concept that are options for MPLS-FRR to deviate the traffic via a detour or a bypass, respectively. Basically, the backup paths can take the shortest path that avoids the outage location from the point of local repair to the tail-end router or to the merge point. We then evaluate the backup capacity requirements and the configuration overhead in terms of the number of backup paths per primary path in a parametric study depending on the network characteristics. While the facility backup concept imposes clearly less configuration overhead than the one-to-one backup, its standard path layout requires more capacity. This can be reduced by a simple modification.

关键词： Legged locomotion

来源：评论

学校读者我要写书评

暂无评论

Cerco: Supporting Range Queries with a Hierarchically Structured Peer-to-Peer System

Cerco: Supporting Range Queries with a Hierarchically Struct...

引用

Conference on Local computer Networks (LCN)

作者： Simon Rieche Klaus Wehrle Leo Petrak Clemens Wrzodek Distributed Systems Group RWTH Aachen University Germany Germany Wilhelm-Schickard-Institute for Computer Science University of Tubingen Germany

Structured peer-to-peer systems are designed for a highly scalable, self organizing, and efficient lookup for data. The key space of the so-called distributed hash tables (DHTs) is partitioned and each partition with its keys and values is assigned to a node in the DHT. For data retrieval however, the very nature of hash tables allows only exact pattern matches. We propose Cerco, a simple solution for the problem of range queries by employing a hierarchically structured P2P approach based on the principles of distributed hash tables. We show that a dynamic hierarchy of DHTs with on-demand classification of items can positively influence the response time of queries while maintaining lookup correctness

关键词： Peer to peer computing Load management Information retrieval Pattern matching Delay computer science Organizing Tree data structures Scalability Linux

来源：评论

学校读者我要写书评

暂无评论

Simplification and analysis of transitive trust networks

引用

Web Intelligence and Agent systems 2006年第2期4卷 139-161页

作者： Jøsang, Audun Gray, Elizabeth Kinateder, Michael School of Software Engineering and Data Communications Queensland University of Technology Australia Computer Science Department Trinity College Dublin Ireland Institute of Parallel and Distributed Systems Faculty of Computer Science University of Stuttgart Germany

When transacting and interacting through open computer networks, traditional methods used in the physical world for establishing trust can no longer be used. Creating virtual network substitutes with which people, organisations and software agents can derive trust in other parties requires computerised analysis of the underlying trust networks. This article describes an approach to trust network analysis using subjective logic (TNA-SL), that consists of the three following elements. Firstly it uses a concise notation with which trust transitivity and parallel combination of trust paths can be expressed. Secondly it defines a method for simplifying complex trust networks so that they can be expressed in this concise form. Finally it allows trust measures to be expressed as beliefs, so that derived trust can be automatically and securely computed with subjective logic. We compare our approach with trust derivation algorithms that are based on normalisation such as PageRank and EigenTrust. We also provide a numerical example to illustrates how TNA-SL can be applied. © 2006 - IOS Press and the authors. All rights reserved.

关键词： computer networks

来源：评论

学校读者我要写书评

暂无评论

Eliminating execution overhead of disabled optional features in connectors 3rd

Eliminating execution overhead of disabled optional features...

引用

3rd European Workshop on Software Architecture, EWSA 2006

作者： Bulej, LubomÍr Bure Š, TomÁš Distributed Systems Research Group Department of Software Engineering Charles University Malostranské nám. 25 Prague118 00 Czech Republic Institute of Computer Science Academy of Sciences of the Czech Republic Pod Vodárenskou věží 2 Prague182 07 Czech Republic

ISBN: (纸本)9783540692713

Connectors are used to realize component interactions in component systems. Apart from their primary function, which is mediating the communication, their implementation can also support additional features that, while unrelated to the primary function, may benefit from their placement in connectors. Such features are often optional in the sense that they can be activated and deactivated at run-time. The problem is that even if they are disabled, their very presence in the connector incurs certain overhead. In this paper, we describe an approach to eliminate this overhead by reconfiguration of the connector implementation. Besides connectors, the approach is applicable to similar technologies such as reflective middleware and other architecture-based component systems and frameworks. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

Adaptive Batching for Replicated Servers

Adaptive Batching for Replicated Servers

引用

Reliable distributed systems

作者： Roy Friedman Erez Hadad Computer Science Department Technion - Israel Institute of Technology Haifa Israel Distributed Computing Systems Group IBM Haifa Research Lab Haifa Israel

This paper presents two novel generic adaptive batching schemes for replicated servers. Both schemes are oblivious to the underlying communication protocols. Our novel schemes adapt their batching levels automatically and immediately according to the current communication load. This is done without any explicit monitoring or calibration of the system. Additionally, the paper includes a detailed performance evaluation

关键词： Delay Throughput Monitoring Protocols Costs Computational efficiency Bandwidth computer science Calibration distributed computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：