TY - THES AU - Gajewski, Tobias ID - 25220 TI - Referenzmodell zur Beschreibung der Geschäftsprozesse von After-Sales-Dienstleistungen unter besonderer Berücksichtigung des Mobile Business VL - 158 ER - TY - THES AU - Rüther, Michael ID - 25221 TI - Ein Beitrag zur klassifizierenden Modularisierung von Verfahren für die Produktionsplanung VL - 159 ER - TY - THES AU - Langen, Dominik ID - 25223 TI - Abschätzung des Ressourcenbedarfs von hochintegrierten mikroelektronischen Systemen VL - 161 ER - TY - CONF AU - Köpke, A. AU - Karl, Holger AU - Wolisz, A. ID - 2529 T2 - GI / ITG Fachgespräche Drahtlose Sensornetzwerke TI - Consensus in WSN – Identifying critical protocol mechanisms ER - TY - CHAP AU - Krimphove, Dieter ED - Schmeisser, Wilhelm ED - Krimphove, Dieter ED - Brinkkötter, Hans-Otto ID - 1956 T2 - Internationales Entgeltmanagement TI - Entgeltflexibilisierung im Europäischen Binnenmarkt ER - TY - CHAP AU - Krimphove, Dieter ED - Schmeisser, Wilhelm ED - Krimphove, Dieter ID - 1957 T2 - Management der Forschung und Entwicklung sowie der Technologiekooperation in kleinen und mittleren Unternehmen TI - Wettbewerbssicherung kleiner und mittelständischer Unternehmen durch Zugangsberechtigung zu fremden Betriebs- und Produktionsmitteln Eine ökonomischen Analyse der „essential-facility“-Doktrin im US-amerikanischen, europäischen und deutschen Recht ER - TY - JOUR AU - Krimphove, Dieter ID - 1958 IS - Jg. 35, Heft 1 JF - Rechtstheorie TI - Spieltheoretische Aspekte des Rechts – Ein Beitrag zur Analyse und Gestaltung von Recht mit Hilfe objektiver quanitvizierbaren Methodik – ER - TY - CHAP AU - Krimphove, Dieter ED - Hekimler, Alpay ID - 1959 T2 - TÜRKIYE & ENDÜSTRI ILIŞKILERI TI - Der Kündigungsschutz im Europäischen Arbeitsrecht ER - TY - CHAP AU - Krimphove, Dieter AU - Welp, Jürgen ED - Schmeisser, Wilhelm ED - Bretz, Michael ED - Keßler, Jürgen ID - 1960 T2 - Handbuch: Krisen- und Insolvenzmanagement TI - Das Recht der Unternehmensfinanzierung ER - TY - THES AU - Salzwedel, Kay ID - 19616 SN - 3-935433-62-X TI - Data Distribution Algorithms for Storage Networks VL - 153 ER - TY - CONF AU - Briest, Patrick AU - Brockhoff, Dimo AU - Degener, Bastian AU - Englert, Matthias AU - Gunia, Christian AU - Heering, Oliver AU - Jansen, Thomas AU - Leifhelm, Michael AU - Plociennik, Kai AU - Röglin, Heiko AU - Schweer, Andrea AU - Sudholt, Dirk AU - Tannenbaum, Stefan AU - Wegener, Ingo ID - 19692 SN - 0302-9743 T2 - Parallel Problem Solving from Nature - PPSN VIII TI - The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes ER - TY - CONF AU - Schweer, Andrea AU - Leifhelm, Michael AU - Degener, Bastian AU - Heering, Oliver AU - Tannenbaum, Stefan AU - Röglin, Heiko AU - Gunia, Christian AU - Englert, Matthias AU - Briest, Patrick AU - Sudholt, Dirk AU - Brockhoff, Dimo AU - Wegener, Ingo AU - Jansen, Thomas AU - Plociennik, Kai ID - 19693 T2 - Parallel Problem Solving from Nature - PPSN VIII TI - Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization ER - TY - CHAP AU - Büker, Petra ED - Köller, Katharina ED - Grosse-Holthaus, Marlies ID - 19706 T2 - Interkulturell lernen – erziehen – bilden (Paderborner Beiträge zur Unterrichtsforschung und Lehrerbildung, Bd. 8) TI - Dokumentationsschrift zum Paderborner Grundschultag 2003 VL - 8 ER - TY - CONF AB - Redundant arrays of independent disks, also called RAID arrays, have gained a wide popularity in the last twenty years. Most of the disks used in the server market are currently based on RAID technology. The primary reason for introducing RAID technology in 1988 has been the fact that large disk systems have become much slower and more expensive than the connection of a large number of inexpensive disks and the use of them as an array. The times seem to repeat themselves. Today, large scale RAID arrays have become incredible big and expensive. It seems that it makes sense to replace them by a collection of smaller and inexpensive arrays of JBODs or mid-ranged RAID arrays. In this paper we will show that combining these systems with state-of-the-art virtualization technology can lead to a system that is faster and less expensive than an enterprise storage system, while being as easy to manage and as reliable. Therefore we will outline the most important features of storage management and compare there realization in enterprise class storage systems and in current and future virtualization environments. AU - Brinkmann, André AU - Salzwedel, Kay AU - Vodisek, Mario ID - 19800 T2 - Proceedings of the international workshop on Storage network architecture and parallel I/Os - SNAPI '04 TI - A case for virtualized arrays of RAID ER - TY - CONF AB - Wireless connectivity is state of the art for local area networks. Currently, most W-LAN networks rely on a centralized design with access points routing all inner and outbound traffic. These access points are intrinsic communication bottlenecks. Mobile Ad Hoc Networks (MANET) overcome this problem, because every participant works as well as a simple node and as a router. Current MANETs are restricted in scalability, because they rely on flooding mechanisms or complete routing tables. Other approaches, providing better scalability use clustering, yet network performance deteriorates in case of high node mobility. We describe the design of a PAMANET, the Paderborn Mobile Ad Hoc Network, a MANET overcoming these problems providing scalability and reliability in a mobile scenario. When implemented, PAMANET works with standard W-LAN IEEE 802.11 radio devices, provides IPv6 communication interfaces and works on personal computers under a standard Linux distribution. First, we present current routing protocols and classify them with respect to scalability and stability in dynamically evolving MANETs. Then, we discuss related research in the area of distributed hash tables and consistent hashing, used for relieving hot spots in the Web, storage area networks and peerto-peer networks, which inspires the design of PAMANET. PAMANET consists of three main components: First, the embedding of the routing layer into IEEE 802.11 and IPv6 by using techniques used at the ad hoc support library (aslib) by Gupta et al. Second, the routing layer which combines a landmark routing, hierarchical clustering, consistent hashing for providing location dependent addresses and lookup-service for the location of nodes. Third, a peerto-peer data storage system based on egoistic distributed caches enabling hop and traffic efficient data access on replicated data partitions.
The routing layer incorporates a variety of new approaches. Link distances reflect the failure probability of links, which is estimated by the reciprocal age of the link. Then, we combine a landmarking system on this metric with the hierarchical layer graph yielding small landmark addresses and small routing tables. To balance the load of the distributed lookup-service for landmark addresses, a hierarchical weighted consistent hashing scheme is used. This ensures that each node receives an equal part of all landmark addresses. Using these mechanisms (regularly and on demand) PAMANET adjusts IPv6 routing tables such that short stable routes are preferred. For the distribution of control data like landmark information PAMANET uses a message box system interface to provide fast one-hop communication. On top of this system, PAMANET provides a peer-to-peer data storage and lookup system that realizes time, traffic, and load efficient access using egoistic caches and data segmentation strategies. AU - Schindelhauer, Christian AU - Böttcher, Stefan AU - Rammig, Franz ID - 19807 SN - 1581139209 T2 - Proceedings of the second international workshop on Mobility management & wireless access protocols TI - The design of PaMaNet the Paderborn mobile ad-hoc network ER - TY - CONF AB - The Internet-SCSI protocol [iSCSI] allows a client to interact with a remote SCSI-capable target by means of block-oriented commands encapsulated within TCP/IP packets. Thereby, iSCSI greatly simplifies storage virtualization, since clients can access storage in a unified manner, no matter whether the I/O-path is short or long distance. Intermediate devices located on the path between a client and a target can easily intercept iSCSI sessions and rewrite packets for the sake of load balancing, prefetching, or redundancy, to mention just a few beneficial applications. Within this paper we describe the design and implementation of such an iSCSI capable intermediate device that deploys prefetching strategies in combination with redundant disks to reduce average I/O-latency. Depending on its location within the network, this virtualization and prefetching device can hide wide area access latency and reduce network contention targeting remote SCSI-devices to a large extent. AU - Bleckmann, Peter AU - Schomaker, Gunnar AU - Slowik, Adrian ID - 19851 IS - 2 T2 - Proceeding of International Workshop on Storage Network Architecture and Parallel I/O TI - Virtualization with prefetching abilities based on iSCSI ER - TY - JOUR AU - Klein, Jan AU - Zachmann, Gabriel ID - 19879 IS - 6 JF - Computers and Graphics TI - Point Cloud Surfaces using Geometric Proximity Graphs VL - 28 ER - TY - CONF AU - Klein, Jan AU - Zachmann, Gabriel ID - 19883 T2 - Eurographics Symposium on Point-Based Grahics (SPBG'04) TI - Proximity Graphs for Defining Surfaces over Point Clouds ER - TY - CONF AU - Klein, Jan AU - Zachmann, Gabriel ID - 19889 T2 - SIGGRAPH 2004, Sketches TI - Nice and Fast Implicit Surfaces over Noisy Point Clouds ER - TY - CONF AU - Klein, Jan AU - Zachmann, Gabriel ID - 19891 T2 - Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004) TI - Point Cloud Collision Detection ER -