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

Ontology-driven Web services composition platform

Information systems and e-Business Management 2005年第2期3卷 175-199页

作者： Arpinar, I. Budak Zhang, Ruoyan Aleman-Meza, Boanerges Maduko, Angela Large Scale Distributed Information Systems Lab. Computer Science Department University of Georgia Athens GA 30602-7404 United States

Discovering and composing individual Web services into more complex yet new and more useful Web processes is an important challenge. In this paper, we present three techniques for (semi) automatically composing Web services into Web processes by using their ontological descriptions and relationships to other services. In Interface-Matching Automatic composition technique, the possible compositions are obtained by checking semantic similarities between interfaces of individual services. Then these compositions are ranked considering their Quality of Services (QoS) and an optimum composition is selected. In Human-Assisted composition the user selects a service from a ranked list at certain stages. We also address automatic compositions in a Peer-to-Peer network. © Springer-Verlag Berlin 2005.

关键词： Composition Discovery Ontology Web services

来源：评论

学校读者我要写书评

暂无评论

Roles:From objects, security and databases perspective

Roles:From objects, security and databases perspective

引用

2005 AAAI Fall Symposium

作者： Chandra Sekharaiah, Kangaluru Janaki Ram, D. Distributed Object Systems Group Department of Computer Science and Engg. JNTU College of Engineering Hyderabad India Distributed Object Systems Lab. Department of Computer Science and Engg. Indian Institute of Technology Madras

ISBN: (纸本)1577352548

A role paradigm conformance model (RPCM) called Typehole model was developed and implemented in Java. It does not use Is-role-of inheritance and is free from the object schizophrenia (OS) problem (OSP). An extended distributed role model provides multifarious role hierarchies at different sites. Modeling object role systems is prone to OSP. OSP is the error in the RPCM design to subscribe to the viewpoints in the client space. OS and OSP are contrasted. A classification of OSPs is made. Role modeling problem is the requirement to design an OSP-free RPCM with Is-role-of inheritance. The existing object-oriented role models have been evaluated as regards OSP. No role model has strong claims as regards solving the role modeling problem. A security model was developed for RPCM-based distributed object systems and implemented on CORBA. By designing message filter hierarchies, hybrid security is developed at global and local levels for RPCM-based object systems. Role is either abstract or concrete as it can be a type or an instance. Copyright © 2005, American Association for Artificial Intelligence (***). All rights reserved.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

A flexible and extensible object middleware: CORBA and beyond

A flexible and extensible object middleware: CORBA and beyon...

引用

5th International Workshop on Software Engineering and Middleware, SEM 2005

作者： Hauck, Franz J. Kapitza, Rüdiger Reiser, Hans P. Schmied, Andreas I. Distributed Systems Lab. University of Ulm Germany Dept. of Computer Science University of Erlangen-Nürnberg Germany

This paper presents a CORBA-compliant middleware architecture that is more flexible and extensible compared to standard CORBA. The portable design of this architecture is easily integrated in any standard CORBA middleware;for this purpose, mainly the handling of object references (IORs) has to be changed. To encapsulate those changes, we introduce the concept of a generic reference manager with portable profile managers. Profile managers are pluggable and in extreme can be downloaded on demand. To illustrate the use of this approach, we present a profile manager implementation for fragmented objects and another one for bridging CORBA to the Jini world. The first profile manager supports truly distributed objects, which allow seamless integration of partitioning, scalab.lity, fault tolerance, end-to-end quality of service, and many more implementation aspects into a distributed object without losing distribution and location transparency. The second profile manager illustrates how our architecture enables fully transparent access from CORBA applications to services on non-CORBA platforms. Copyright 2005 ACM.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

GDP: A paradigm for intertask communication in grid computing through distributed pipes

引用

2nd International Conference on distributed Computing and Internet Technology, ICDCIT 2005

作者： Janakiram, D. Reddy, M. Venkateswara Srinivas, A. Vijay Mohamed, M. A. Maluk Kumar, S. Santosh Distributed and Object Systems Lab. Dept. of Computer Science and Engg. Indian Institute of Technology Madras Chennai India

ISBN: (纸本)3540309993

Existing grid models target purely data parallel applications without inter-task communication. This paper proposes a transparent programming model to support communicating parallel tasks in a wide area grid. The proposed grid model with distributed Pipes (DP) abstraction named as, GDP, enables location independent intertask communication among processes on machines spread over a wide area distributed system. This approach enables anonymous migration of communicating parallel tasks adjusting to grid dynamics. The proposed model supports sequential load to coexist with parallel load. A prototype of the proposed model has been implemented over clusters of nodes spread across the Internet. A steady state equilibrium engineering problem was studied over the model. Performance studies show linear to super linear speed up for the application. © Springer-Verlag Berlin Heidelberg 2005.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

DO-WF2Q: Delay-optimised WF2Q packet scheduling

DO-WF2Q: Delay-optimised WF2Q packet scheduling

引用

作者： Fei, X. Marshall, A. Luo, J. Advanced Telecommunications Systems Lab. School of Electrical and Electronic Engineering Queen's University of Belfast United Kingdom Computer Communications and Networks Group Department of Computer Science and Engineering Southeast University China

Packet scheduling is an essential element of any QoS enabled packet-switched network. (QoS provisioning and packet scheduling play important roles in present and future Internet applications.) In terms of packet fair queueing, worst case fair WFQ (WF2Q) is better than weighted fair queueing (WFQ) in that it can provide a bounded worst-case fairness index (WFI). The delay property of these two queueing schemes are studied. To do this, the delay index (DI) and the worst-case delay index (WDI) are defined to measure the discrepancy between the delay using these queueing schemes and that obtained using generalised processor sharing (GPS). Simulations show that in some circumstances WF2Q has higher DI than that using WFQ. The reason why WF2Q sometimes experiences higher DI is analysed, and based on this, an adaptive packet queueing algorithm termed delay-optimised WF2Q (DO-WF2Q) is proposed. This algorithm aims to improve the delay index (DI) while maintaining the WFI bound provided by WF2Q. Verifications and simulations show that DO-WF2Q can reduce the DI while maintaining the WFI bound, and at the same time retaining the same complexity as WF2Q. © IEE, 2005.

关键词： Packet networks

来源：评论

学校读者我要写书评

暂无评论

M/sup 3/HN: an adaptive protocol for mobility management in multi-hop heterogeneous networks

M/sup 3/HN: an adaptive protocol for mobility management in ...

引用

IEEE Symposium on computers and Communications (ISCC)

作者： A. George A. Kumar Mobile Information Networks and Distributed Systems (MINDS) Lab Computer Engineering and Computer Science University of Louisville Louisville KY USA

One of the research challenges for 4G-wireless systems is the design of mobility management techniques that integrate cellular and ad-hoc networks. Currently there are no structured mobility management schemes for these heterogeneous multi-hop networks. In this paper we propose an adaptive protocol for mobility management in multi-hop heterogeneous networks (M/sup 3/HN) for seamless mobility in an integrated cellular and ad-hoc network. This paper describes techniques for tracking a mobile node in a multi-hop network with minimum overhead. Using M/sup 3/HN a node can migrate from a single-hop network to a multi-hop connectivity seamlessly. This scheme is independent of the routing protocol used in a multi-hop network.

关键词： Mobile radio mobility management Intelligent networks Spread spectrum communication Ad hoc networks Cellular networks Land mobile radio cellular systems Broadcasting Wireless application protocol Mobile computing computer networks

来源：评论

学校读者我要写书评

暂无评论

M2DR: A near-optimal multiclass minimum-delay routing algorithm for smart radio access networks

M2DR: A near-optimal multiclass minimum-delay routing algori...

引用

IEEE Conference on Local computer networks - 30th Anniversary, LCN 2005

作者： Hollick, Matthias Mogre, Parag S. Krop, Tronje Huth, Hans-Peter Schmitt, Jens B. Steinmetz, Ralf Department of Electrical Engineering and Information Technology Technische Universität Darmstadt Merckstrasse 25 64283 Darmstadt Germany Siemens AG Corporate Technology Department Information and Communications Munich Germany Distributed Computer Systems Lab. Computer Science Department University of Kaiserslautern Germany

ISBN: (纸本)0769524214

Today, we witness a transformation of radio access network topologies from strictly tree-structured towards meshed architectures. Yet, these edge networks follow mostly circuit-switched paradigms to support quality of service applications such as voice or video communication. In this work, we develop a novel quality of service aware routing framework to optimize the performance of edge networks in the packet-switched domain. Starting from the Internet's best-effort routing paradigm and building on related work, we formulate a near-optimal multiclass minimum-delay routing algorithm. Our algorithm optimizes network-wide end-to-end delay and allows for differentiation of service. We exploit two orthogonal dimensions namely multipath routing and class-based service prioritization. We provide a precise description of our algorithm and a detailed experimental analysis against state of the art routing algorithms. Our algorithm is able to achieve excellent performance while maintaining the simplicity of a decentralized and distributed routing algorithm, thus matching the requirements for future radio access networks. © 2005 IEEE.

关键词： Telecommunication networks

来源：评论

学校读者我要写书评

暂无评论

Journal of Information Science and Engineering: Editorial notice

引用

Journal of Information Science and Engineering 2005年第5期21卷 i-ii页

作者： Lee, Der-Tsai Amato, Nancy M. Chang, Shih-Fu Chen, Homer H. Chen, Tsuhan Hsu, Tsan-Sheng Hwang, Jenq-Neng Kuo, Sy-Yen Kuo, Tei-Wei Li, Chung-Sheng Tokuyama, Takeshi Wing, Jeannette Wu, Tzong-Chen Yen, John Computer Science at Texas A and M University United States Parasol Laboratory United States IEEE Transactions on Parallel and Distributed Systems Computing Research Association's Committee on the Status of Women in Computing Research CRA-W's Distributed Mentor Program United States Department of Electrical Engineering Columbia University United States Lab. United States College of Electrical Engineering and Computer Science National Taiwan University Taiwan IEEE Transactions on Circuits and Systems for Video Technology IEEE Department of Electrical and Computer Engineering Carnegie Mellon University Pittsburgh PA United States ACM ACM SIGACT IEEE Computer Society IICM Austria Research and Development of the Department Multimedia Signal Processing Technical Committee IEEE Signal Processing Society United States IEEE Transactions on Circuits and systems for Video Technology College of Electrical Engineering and Computer Science National Taiwan Ocean University Keelung Taiwan Department of Electrical Engineering National Taiwan University Taiwan Department of Computer Science and Information Engineering National Taiwan University Taipei Taiwan IEEE Technical Committee on Real-Time Systems Computer Science Division IBM T.J. Watson Research Center United States IBM Research Division Graduate School of Information Sciences Tohoku University Japan ACM IPSJ Mathematical Society of Japan Japan Department of Computer Science Computer Science Department Carnegie Mellon University United States National Academies of Science's Computer Science and Telecommunications Board United States Microsoft's Trustworthy Academic Advisory Board Intel Research Pittsburgh's Advisory Board United States Dartmouth's Institute for Security Technology Studies Advisory Committee Canada Sloan Research Fellowships Program Committee United States ACM Taiwan China Information Sciences and Technology Pennsylvania State University United States Laboratory for Intelligent Agents Penn State's School of Info

No abstract availab.e

关键词：

来源：评论

学校读者我要写书评

暂无评论

Enhancing mobile QoS based on movement contracts

Enhancing mobile QoS based on movement contracts

引用

2004 Twelfth IEEE International Workshop on Quality of Service, IWQoS 2004

作者： Zdarsky, Frank A. Schmitt, Jens B. Distributed Computer Systems Lab. Computer Science Department University of Kaiserslautern Germany

ISBN: (纸本)0780382773

Resource management for individual flows can significantly improve quality of service (QoS) in mobile cellular networks. However, its efficiency depends on the availab.lity of information about the movement of mobile terminals. Movement prediction can potentially provide this information, but is costly if performed by the network and usually assumes a certain movement model, which may not adequately reflect each individual user's behavior. Instead, we propose the concept of movement contracts, where a mobile terminal specifies its movement to the network, which in return provides a better QoS as long as the provided specification is sufficiently accurate. We describe approaches to specify the spatial and temporal aspects of movement with a parsimonious parameter set and evaluate these approaches through simulations. We find that movement contracts can significantly reduce both session blocking and handover dropping probability simultaneously, whereas existing approaches have to make a tradeoff between these.

关键词： Mobile telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Generating realistic workloads for network intrusion detection systems

Generating realistic workloads for network intrusion detecti...

引用

Proceedings of the Fourth International Workshop on Software and Performance, WOSP'04

作者： Antonatos, Spyros Anagnostakis, Kostas G. Markatos, Eyangelos P. Institute of Computer Science Found. for Research and Technology Hellas Greece Distributed Systems Lab. CIS Department Univ. of Pennsylvania United States

ISBN: (纸本)1581136730

While the use of network intrusion detection systems (nIDS) is becoming pervasive, evaluating nIDS performance has been found to be challenging. The goal of this study is to determine how to generate realistic workloads for nIDS performance evaluation. We develop a workload model that appears to provide reasonably accurate estimates compared to real workloads. The model attempts to emulate a traffic mix of different applications, reflecting characteristics of each application and the way these interact with the system. We have implemented this model as part of a traffic generator that can be extended and tuned to reflect the needs of different scenarios. We also present an approach to measuring the capacity of a nIDS that does not require the setup of a full network testbed. security, intrusion detection, workload characterization and generation.

关键词： computer networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：