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

IEEE International Conference on communications (ICC)

作者： Michael Menth Ruediger Martin Ulrich Spoerlein Department of Distributed Systems Institute of Computer Science University of Würzburg Germany

The self-protecting multipath (SPM) is a simple protection switching mechanism that can be implemented, e.g., by MPLS. We present a linear program to optimize the SPM load balancing parameters for network dimensioning. Our study shows that the SPM is a very efficient mechanism in the sense that it requires only little backup capacity since it outperforms the p-cycle approach and the shortest path rerouting by far. The investigation of the computation time and the memory consumption recommends the Simplex method as an LP solver rather than an interior point method (IPM). The computation time of the program depends mainly on the number of links in the network and it is well feasible for small and and medium size networks. For large networks, however, fast heuristics are required.

关键词： Scanning probe microscopy Protection switching Telecommunication traffic Load management Multiprotocol label switching Resilience Routing Availability Quality of service computer science

来源：评论

学校读者我要写书评

暂无评论

A new efficient block-matching algorithm for motion estimation

引用

Journal of VLSI Signal Processing systems for Signal, Image, and Video Technology 2006年第1期42卷 21-33页

作者： Mahmoud, Hanan Goel, Sumeer Shaaban, Mohsen Bayoumi, Magdy Faculty of Engineering University of Alexandria University Buildings 9 Albert Street Semouha Alexandria 21321 Egypt Center for Advanced Computer Studies University of Louisiana at Lafayette 110 Rex Street Lafayette LA 70504 Faculty of Engineering University of Alexandria Computer Science Department Department of Computer Engineering Department of Computer Science Center for Advanced Computer Studies University of Louisiana Lafayette Technical Committee on Circuits and Systems for Communication Technical Committee on Signal Processing Design and Implementation Neural Network and the Multimedia Technology Technical Committees University of Louisiana Lafayette

This paper presents a new full-search block-matching algorithm: Multi-stage Interval-based Motion Estimation algorithm (MIME). The proposed algorithm is a block based motion estimation algorithm that utilizes successive elimination technique. We define two approximate functions, as the upper and lower boundaries of the interval that includes the Conventional distortion metric SAD. Each stage in the proposed algorithm;except for the last stage;incorporates low resolution pixels for the boundary functions calculations. The final stage is a full resolution block matching stage. MIME has a high probability of finding the optimal motion vector at any stage of the algorithm. The proposed algorithm reduces the computational complexity by successively eliminating non-candidate blocks from the search window at each stage. This computational reduction leads to enhanced performance in terms of low power consumption and fast motion vector estimation. A low power VLSI implementation of the algorithm is also presented in this paper. Simulation results on benchmark video sequences shows that MIME algorithm eliminates almost 88% of the candidate blocks after only two interval based stages. © Springer science + Business Media, Inc. 2006.

关键词： Motion estimation

来源：评论

学校读者我要写书评

暂无评论

Adaptive bandwidth allocation: impact of routing and load balancing on tunnel capacity requirements

Adaptive bandwidth allocation: impact of routing and load ba...

引用

Conference on Next Generation Internet Networks, NGI

作者： J. Milbrandt K. Humm M. Menth Department of Distributed Systems Institute of Computer Science University of Würzburg Wurzburg Germany

In this paper, we consider adaptive bandwidth allocation (ABA) for capacity tunnels as an effective means for multi-hour network design. Traffic engineering (TE) tunnels established in a network from border-to-border (b2b) can be used not only for route pinning between ingress/egress node pairs but also for efficient implementation of resilient network admission control. If static bandwidth allocation (SBA) based on peak-rate traffic assumptions is used to dimension the b2b tunnels, fluctuations of the network traffic can lead to under- or overprovisioning of network capacity in the tunnels. If ABA is used instead, the tunnel sizes are dynamically adapted to current traffic conditions. The efficient use of network capacity assigned to TE tunnels strongly depends on the structure of these tunnels. The contribution of this paper is an assessment of the bandwidth savings that are achievable with ABA in comparison to SBA for various tunnel structures with different path layouts and load balancing strategies. Our results show that the capacity savings due to ABA depend on the routing and load balancing schemes provisioned in the network and that these savings may be increased by appropriately chosen tunnel implementations

关键词： Channel allocation Routing Load management communication system traffic control Tellurium Telecommunication traffic Admission control Fluctuations Bandwidth Quality of service

来源：评论

学校读者我要写书评

暂无评论

A Peer-to-Peer Reference Architecture

A Peer-to-Peer Reference Architecture

引用

International Conference on communication systems Software and Middleware (COMSWARE)

作者： A. Singh M. Haahr Distributed Systems Group Department of Computer Science Trinity College Dublin Dublin Ireland

Peer-to-peer (P2P) applications are extremely popular on the Internet because they allow users to share information in a decentralized manner. Internet users use file-sharing applications (e.g., BitTorrent, KaZaA) to share and exchange files and collaboration applications (e.g., Jabber, Groove) to exchange chat messages and work on shared documents. A reference architecture for a domain provides an architecture template which can be used as a starting point for designing the software architecture of a system in that domain. Despite the popularity of P2P applications there is no reference architecture for the P2P domain. This paper presents a reference architecture for the P2P domain. The reference architecture has been designed to satisfy the concerns that a P2P application needs to address. The reference architecture takes a service-centric view of the P2P domain. The reference architecture can be used to describe the structure of existing P2P applications and middlewares. The paper validates the reference architecture by describing the structure of some of the existing P2P applications and middlewares using the reference architecture

关键词： Peer to peer computing computer architecture Application software Internet Software architecture Middleware Collaborative work Software design Software systems computer science

来源：评论

学校读者我要写书评

暂无评论

Consistent Replication of Multithreaded distributed Objects

Consistent Replication of Multithreaded Distributed Objects

引用

Reliable distributed systems

作者： Hans P. Reiser Jorg Domaschka Franz J. Hauck Rudiger Kapitza Wolfgang Schroder-Preikschat Distributed Systems Laboratory Faculty of Computer Science University of Ulm (EBS) Germany Germany Department of Distributed Systems and Operating Systems University Erlangen-Nuünberg Germany

Determinism is mandatory for replicating distributed objects with strict consistency guarantees. Multithreaded execution of method invocations is a source of nondeterminism, but helps to improve performance and avoids deadlocks that nested invocations can cause in a single-threaded execution model. This paper contributes a novel algorithm for deterministic thread scheduling based on the interception of synchronisation statements. It assumes that shared data are protected by mutexes and client requests are sent to all replicas in total order; requests are executed concurrently as long as they do not issue potentially conflicting synchronisation operations. No additional communication is required for granting locks in a consistent order in all replicas. In addition to reentrant mutex locks, the algorithm supports condition variables and time-bounded wait operations. An experimental evaluation shows that, in some typical usage patterns of distributed objects, the algorithm is superior to other existing approaches

关键词： Yarn System recovery Scheduling algorithm Frequency synchronization computer science Operating systems Protection Multicast protocols computer crashes Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Multi-modal biometric recognition

Multi-modal biometric recognition

引用

International Conference on computer science and Its Applications, CIIA 2006

作者： Adjoudj, Réda Boukelif, Aoued Evolutionary Engineering and Distributed Information Systems Laboratory EEDIS Computer Science Department University of Sidi Bel-Abbès Algeria Digital Signal Processing Laboratory DSP Electronic Department University of Sidi Bel-Abbès Algeria

来源：评论

学校读者我要写书评

暂无评论

Multi-Node Global Directory Construction in Peer-to-Peer systems

Multi-Node Global Directory Construction in Peer-to-Peer Sys...

引用

International Conference on Advanced Information Networking and Applications (AINA)

作者： InSung Kang HongSoo Kim SungJin Choi MaengSoon Baik ChongSun Hwang Distributed Systems Laboratory Department of Computer Science and Engineering Korea University Seoul South Korea

In P2P systems, the speed of searching for desired lists of sharable files is one of the most important measurement issues in evaluation of overall system performance. Although the searching schemes of existing non-structured P2P systems have been improved to enhance speed considerably, they still never reach to the level of those of the centralized and structured systems. In this paper, we propose a multi-node global directory in P2P systems, where all the lists of sharable resources of the joining peers are aggregated and divided into the chosen nodes while keeping collating sequence as a whole to make one big linked list. Thus in indexed sequential searching, the system provides us with convenience of using the command like 'dir' of MS-DOS, and in general keyword searching, which is naturally impossible for the structured P2P systems, the searching speed is even faster than those of centralized P2P systems since a small list segment is scanned at each node synchronously in parallel

关键词： Peer to peer computing Keyword search System performance Laboratories computer science Velocity measurement Power generation economics Machine vision Bandwidth Memory

来源：评论

学校读者我要写书评

暂无评论

Works in progress

Works in progress

引用

作者： Curry, Edward Mossière, Jacques Beloued, Abdelkrim Gilliot, Jean-Marie Segarra, Maria-Teresa André, Françoise Dyo, Vladimir Di Muro, Etienne Antoniutti Jaeger, Michael A. National University of Ireland Galway Institut National Polytechnique de Grenoble ENST-Bretagne University of Rennes Department of Computer Science ENST-Bretagne Brest France University of Rennes 1 IRISA INRIA Laboratory Rennes France University College London Department of Computer Science University College London Università degli Studi di Trieste Reliable Distributed Systems Group Università degli Studi di Trieste Italy Berlin University of Technology Communication and Operating Systems Group Berlin University of Technology Germany

The main focuses of the 2nd International Middleware Doctoral Symposium took place at Middleware 2005 are discussed. The symposium is a forum for an invited group of doctoral students and it provides an opportunity for them to obtain guidance from mentors and to meet with their peers. The event is aimed to give students constructive criticism before their thesis defense and foster discussions related to future career opportunities. The symposium attracted many high-quality submissions, ensuring a competitive selection process.

关键词： Online systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Dependable distributed start and stop

Dependable distributed start and stop

引用

2006 IEEE International Conference on Industrial Informatics, INDIN'06

作者： Riedl, Matthias Diedrich, Christian Naumann, Frank Rose, Nico Institut f. Automation und Kommunikation e.V. Magdeburg Steinfeldstr. 3 39179 Barleben Germany Faculty of Computer Science Department of Distributed Systems Otto-von-Guericke-University Magdeburg Germany

ISBN: (纸本)0780397010

The international standard IEC 61499 defines an event-driven, distributed application based on Function Blocks. Such a block represents a kind of object with an internal behaviour. The blocks interact via input and output variables with other blocks or with their environment. Based on a distributed, object-oriented automation system, the whole application shall be dependable started or stopped. The article describes an algorithm solving such tasks. 1 ©2006 IEEE.

关键词： Standards

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：