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

Alert communication primitives above TCP

JOURNAL OF HIGH SPEED NETWORKS 2000年第2期9卷 139-150页

作者： Gouda, MG McGuire, TM Univ Texas Dept Comp Sci Austin TX 78712 USA

We consider communication primitives that can be executed by an application process to exchange messages with another application process over a TCP/IP network. A communication primitive is called alert iff it satisfies two conditions. First, if during any execution of the primitive no failure occurs, then the execution completes successfully. Second, if during any execution of the primitive some failure occurs, then the execution is aborted and the process that initiated the execution is informed of the failure. Clearly alert communication primitives are useful in designing reliable distributed applications. We argue that the send primitive over TCP is alert, but the receive primitive over TCP is not. Then, we propose three new receive primitives over TCP and show that each of them is alert. We also discuss how to implement these three primitives and compare their performance.

关键词： distributed applications fault tolerance Internet interprocess communication reliability Transmission Control Protocol

来源：评论

学校读者我要写书评

暂无评论

Securing dynamic itineraries for mobile agent applications

引用

JOURNAL OF NETWORK AND COMPUTER applications 2008年第4期31卷 487-508页

作者： Garrigues, Carles Robles, Sergi Borrell, Joan Autonomous Univ Barcelona Dept Informat & Commu Engn Bellaterra 08193 Spain

this paper we present a novel mechanism for the protection of dynamic itineraries for mobile agent applications. Itineraries that are decided as the agent goes are essential in complex applications based on mobile agents, but no approach has been presented until now to protect them. We have conceived a cryptographic scheme for shielding dynamic itineraries from tampering, impersonation and disclosure. By using trust strategically, our scheme provides a balanced trade-off between flexibility and security. Our protection scheme has been thought always bearing in mind a feasible implementation, and thus facilitates the development of applications that make use of it. An example application based on a real healthcare scenario is also presented to show its operation. (C) 2007 Elsevier Ltd. All rights reserved.

关键词： distributed applications Mobile agents Dynamic itineraries Security

来源：评论

学校读者我要写书评

暂无评论

Dynamic bandwidth auctions in multioverlay P2P streaming with network coding

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2008年第6期19卷 806-820页

作者： Wu, Chuan Li, Baochun Li, Zongpeng Univ Toronto Dept Elect & Comp Engn Toronto ON M5S 3G4 Canada Univ Calgary Dept Comp Sci Calgary AB T2N 1N4 Canada

In peer-to-peer (P2P) live streaming applications such as IPTV, it is natural to accommodate multiple coexisting streaming overlays, corresponding to channels of programming. In the case of multiple overlays, it is a challenging task to design an appropriate bandwidth allocation protocol, such that these overlays efficiently share the available upload bandwidth on peers, media content is efficiently distributed to achieve the required streaming rate, as well as the streaming costs are minimized. In this paper, we seek to design simple, effective, and decentralized strategies to resolve conflicts among coexisting streaming overlays in their bandwidth competition and combine such strategies with network-coding-based media distribution to achieve efficient multioverlay streaming. Since such strategies of conflict are game theoretic in nature, we characterize them as a decentralized collection of dynamic auction games, in which downstream peers bid for upload bandwidth at the upstream peers for the delivery of coded media blocks. With extensive theoretical analysis and performance evaluation, we show that these local games converge to an optimal topology for each overlay in realistic asynchronous environments. Together with network-coding- based media dissemination, these streaming overlays adapt to peer dynamics, fairly share peer upload bandwidth to achieve satisfactory streaming rates, and can be prioritized.

关键词： distributed networks distributed applications peer-to-peer streaming bandwidth auction multiple overlays

来源：评论

学校读者我要写书评

暂无评论

A network architecture supporting consistent rich behavior in collaborative interactive applications

引用

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS 2006年第3期12卷 405-416页

作者： Marsh, J Glencross, M Pettifer, S Hubbold, R Univ Manchester Sch Comp Sci Manchester M13 9PL Lancs England

Network architectures for collaborative virtual reality have traditionally been dominated by client-server and peer-to-peer approaches, with peer-to-peer strategies typically being favored where minimizing latency is a priority, and client-server where consistency is key. With increasingly sophisticated behavior models and the demand for better support for haptics, we argue that neither approach provides sufficient support for these scenarios and, thus, a hybrid architecture is required. We discuss the relative performance of different distribution strategies in the face of real network conditions and illustrate the problems they face. Finally, we present an architecture that successfully meets many of these challenges and demonstrate its use in a distributed virtual prototyping application which supports simultaneous collaboration for assembly, maintenance, and training applications utilizing haptics.

关键词： virtual reality network architecture and design haptic I/O computer supported collaborative work computer-supported cooperative work simulation modeling and visualization client/server distributed applications computer aided design

来源：评论

学校读者我要写书评

暂无评论

Timed buffers: A technique for update propagation in nomadic environments

引用

COMPUTER COMMUNICATIONS 2008年第14期31卷 3209-3222页

作者： Bettini, Lorenzo Univ Turin Dipartimento Informat I-10149 Turin Italy

Optimistic replication algorithms allow data presented to users to be stale (non-up-to-date) but in a controlled way: they propagate updates in background and allow any replica to be accessed directly most of the time. When the timely propagation of updates to remote distributed replicas is an important issue, it is preferable that a replica gets the same update twice than it does not receive it at all. On the other hand, few assumptions on the topology of the network can be made in a nomadic environment, where connections are likely to change unpredictably. An extreme approach would be to blindly "push" every update to every replica;however, this would lead to a huge waste of bandwidth and of resources. In this paper, we present a novel approach based on timed buffers, a technique that tends to reduce the overall number of propagated updates while guaranteeing that every update is delivered to every replica and that the propagation is not delayed. (C) 2008 Elsevier B.V. All rights reserved.

关键词： epidemic propagation optimistic replication distributed applications

来源：评论

学校读者我要写书评

暂无评论

Digging Deep into the Data Mine with DataMiningGrid

引用

IEEE INTERNET COMPUTING 2008年第6期12卷 69-76页

作者： Stankovski, Vlado Trnkoczy, Jernej Swain, Martin Dubitzky, Werner Kravtsov, Valentin Schuster, Assaf Niessen, Thomas Wegener, Dennis May, Michael Roehm, Matthias Franke, Juergen Univ Ljubljana Dept Civil Informat Fac Civil Geodet Engn Ljubljana 61000 Slovenia Univ Ulster Coleraine BT52 1SA Londonderry North Ireland Technion Israel Inst Technol Distributed Syst Lab IL-32000 Haifa Israel

As modern data mining applications increase in complexity, so too do their demands for resources. Grid computing is one of several emerging networked computing paradigms promising to meet the requirements of heterogeneous, large-scale, and distributed data mining applications. Despite this promise, there are still too many issues to be resolved before grid technology is commonly applied to large-scale data mining tasks. To address some of these issues, the authors developed the DataMiningGrid system. It integrates a diverse set of programs and application scenarios within a single framework, and features scalability, flexible extensibility, sophisticated support for relevant standards and different users.

关键词： distributed Architectures distributed applications Data Mining Middleware Business Logic

来源：评论

学校读者我要写书评

暂无评论

DESCRIPTIVE NAME RESOLUTION

COMPUTER NETWORKS AND ISDN SYSTEMS

引用

COMPUTER NETWORKS AND ISDN SYSTEMS 1992年第4期23卷 211-227页

作者： NEUFELD, G UNIV BRITISH COLUMBIA DEPT COMP SCIVANCOUVER V6T 1W5BCCANADA

A name model that supports descriptive names for objects is presented. The objects and a context relation between the objects is stored in a directory database. Each object is composed of a set of primary attributes. An object also inherits attributes from its contexts. A descriptive name for an object is composed of a non-empty unordered subset of primary attributes, plus an unordered subset of attributes from the object's contexts. A name need only contain enough attributes to denote the object unambiguously. In order to make name resolution more efficient, the concept of a registered name, which is similar to the concept of a tradename or trademark, is introduced. The directory database is partitioned and replicated among a set of name servers. An algorithm, distributed among the name servers, is used to resolve descriptive names resulting in network transparent resolution. A variation of the algorithm has been incorporated in an OSI Directory Implementation as an alternative to the standard OSI name form.

关键词： NAME SERVICE DESCRIPTIVE NAMES NAME RESOLUTION ATTRIBUTES OBJECTS INHERITANCE distributed applications distributed SYSTEMS

来源：评论

学校读者我要写书评

暂无评论

DIANNE: a modular framework for designing, training and deploying deep neural networks on heterogeneous distributed infrastructure

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2018年 141卷 52-65页

作者： De Coninck, Elias Bohez, Steven Leroux, Sam Verbelen, Tim Vankeirsbilck, Bert Simoens, Pieter Dhoedt, Bart Ghent Univ Imec Dept Informat Technol IDLab Technol Pk Zwijnaarde 15 B-9052 Ghent Belgium

Deep learning has shown tremendous results on various machine learning tasks, but the nature of the problems being tackled and the size of state-of-the-art deep neural networks often require training and deploying models on distributed infrastructure. DIANNE is a modular framework designed for dynamic (re)distribution of deep learning models and procedures. Besides providing elementary network building blocks as well as various training and evaluation routines, DIANNE focuses on dynamic deployment on heterogeneous distributed infrastructure, abstraction of Internet of Things (loT) sensors, integration with external systems and graphical user interfaces to build and deploy networks, while retaining the performance of similar deep learning frameworks. In this paper the DIANNE framework is proposed as an all-in-one solution for deep learning, enabling data and model parallelism though a modular design, offloading to local compute power, and the ability to abstract between simulation and real environment. (C) 2018 Elsevier Inc. All rights reserved.

关键词： Artificial neural networks distributed applications Machine learning Internet of Things

来源：评论

学校读者我要写书评

暂无评论

Communicating and migratable interactive multimedia documents

引用

MULTIMEDIA TOOLS AND applications 2012年第3期61卷 599-622页

作者： Concolato, Cyril Dufourd, Jean-Claude Le Feuvre, Jean Park, Kyungmo Song, Jaeyeon Telecom ParisTech Multimedia Grp Paris France Samsung Elect Co Ltd Suwon South Korea Telecom ParisTech Signal Proc & Image Dept Paris France

In ubiquitous computing environments, new interactive multimedia applications need to be mobile, device independent, potentially distributed across devices and to leverage existing services in the environment. Multimedia documents, when combined with scripting technologies, can represent complex interactive multimedia applications. However, they are still not appropriate for the creation of migratable, distributed applications in dynamic environments. We present a framework for interactive multimedia documents, which enables the communication of documents with a changing environment, the mobility of documents and the distribution of communicating document components in this environment. This framework uses an original approach, which describes communication processing outside of the document. It is based on: an abstraction model for dynamic network services;the definition of a binding description language that describes how to connect the network processing with the multimedia document processing;and on associated script programming interfaces. An implementation is presented and several examples, demonstrating in particular document mobility and document modularity, are discussed.

关键词： Multimedia documents Dynamic networking Multimedia communication Migration Mobility Interactive application distributed applications

来源：评论

学校读者我要写书评

暂无评论

Cyclic storage for fault-tolerant distributed executions

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2006年第9期17卷 1028-1036页

作者： Marcelin-Jimenez, Ricardo Rajsbaum, Sergio Stevens, Brett Univ Autonoma Metropolitana Iztapalapa Dept Ingn Elect Mexico City 09340 DF Mexico Univ Nacl Autonoma Mexico Inst Matemat Mexico City 04510 DF Mexico Carleton Univ Sch Math & Stat Ottawa ON K1S 5B6 Canada

Given a set V of active components in charge of a distributed execution, a storage scheme is a sequence B-0, B-1,..., Bb-1 of subsets of V, where successive global states are recorded. The subsets, also called blocks, have the same size and are scheduled according to some fixed and cyclic calendar of b steps. During the ith step, block Bi is selected. Each component takes a copy of its local state and sends it to one of the components in Bi, in such a way that each component stores ( approximately) the same number of local states. Afterward, if a component of Bi crashes, all of its stored data is lost and the computation cannot continue. If there exists a block with no failed components in it, then a recent global state can be retrieved and the computation does not need to start over from the very beginning. The goal is to design storage schemes that tolerate as many crashes as possible, while trying to have each component participating in as few blocks as possible and, at the same time, working with large blocks ( so that a component in a block stores a small number of local states). In this paper, several such schemes are described and compared in terms of these measures.

关键词： load balancing and task assignment distributed applications checkpoint/restart fault-tolerance storage/repositories distributed systems network repositories/data mining/backup

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：