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

Providing VoD services Based on Unstructured Overlay

Providing VoD Services Based on Unstructured Overlay

2007年第三届语义和知识网格国际会议(Third International Conference on Semantics,Knowledge,and Grid)(SKG 2007)

作者： Bin Cheng Hai Jin Xiaofei Liao Zongfen Han Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

It is still a challenging task to provide large scale video-on-demand (VoD) streaming services based on overlay network due to its inherent dynamicity and heterogeneity. Most of previous work has focused on how to construct a structured overlay to tackle this issue, i.e., tree-based overlay and DHT. However, they always suffer from inefficient resource utilization and poor reliability. In this paper, we propose a new solution based on unstructured overlay, called GridCast, in which a directional gossip protocol and a score-based partner selection algorithm are designed to explore multiple data suppliers for each joined peer. In this way, GridCast can make efficient use of the available upload bandwidth of peers to achieve better scalability and reliability. The experimental results from our early deployment show that it is feasible to provide scalable VoD services based on unstructured overlay.

关键词： Peer to peer computing Streaming media Bandwidth Protocols Algorithm design and analysis Scalability Web and internet services Costs Video sharing computers

来源：评论

学校读者我要写书评

暂无评论

Negotiated Coscheduling in a P2P Based HPC Platform

Negotiated Coscheduling in a P2P Based HPC Platform

引用

第六届网格与协同计算国际会议(The Sixth International Conference on Grid and Cooperative computing GCC 2007)

作者： Fei Luo Hai Jin Xiaofei Liao Qin Zhang Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

To promote peer-to-peer (P2P) based high performance computing (HPC), new scheduling strategies are necessarily designed to break the limitation in current systems, which only support applications with independent tasks. Therefore, we introduce a negotiated coscheduling policy, which supports applications with interactive tasks in a structured P2P based HPC platform, P2HP-2. In this policy, with the help of a project description file, a negotiated dispatching metric with two priorityentitling algorithms is proposed, which distributes tasks across computing resources. The coscheduling is further processed with two steps: spinning for dependent data and performing tasks' ***, a reliable message-event transmission method and a load balancer are developed to improve the performance. All our preliminary results show that this scheduling policy is efficient and fault-tolerant to support applications with task-dependent relationships.

关键词： Processor scheduling Distributed computing Concurrent computing Pervasive computing Grid computing Internet computer science Peer to peer computing High performance computing Application software

来源：评论

学校读者我要写书评

暂无评论

OCTOPUS: A Hybrid Scheduling Strategy for P2P VoD services

OCTOPUS: A Hybrid Scheduling Strategy for P2P VoD Services

引用

第六届网格与协同计算国际会议(The Sixth International Conference on Grid and Cooperative computing GCC 2007)

作者： Xiaofei Liao Hai Jin Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

Peer-to-Peer (P2P) networks have been shown to be a promising approach to provide large-scale Video on Demand (VoD) services over Internet for its potential high scalability. However, for a normal peer,how to efficiently schedule media data to multiple asynchronous peers for VoD services in such networks remains a major challenge. Hereby we propose a hybrid scheduling scheme for data dissemination in P2P VoD system in this paper, called OCTOPUS,which is combined with adaptive scheduling scheme at normal time and special scheduling strategy emergently. Usually each peer is given a value,meaning scheduling bandwidth to represent service capacity, which is an integrated evaluation for peer's bandwidth and services ability, also including statistical characteristics about historical data transferring. According to the value, one peer can adjust the expectation of each neighbor's abilities and send scheduling request of media data to all *** case of failure scheduling, emergent scheduling scheme will be called and limited data requests will be sent to media servers. OCTOPUS scheme helps to make sufficient utilization of end-peers' resource,alleviate the load of source server and improve their scalability. Experimental result from a P2P VoD system, GridCast, based on OCTOPUS schemes,shows that OCTOPUS achieves obvious effect.

关键词： Peer to peer computing Streaming media Bandwidth Network servers Processor scheduling Scalability Grid computing Internet Web server computers

来源：评论

学校读者我要写书评

暂无评论

Data management services and transfer scheme in ChinaGrid

引用

International Journal of Web and Grid services 2007年第4期3卷 447-461页

作者： Wu, Song Jin, Hai Xiong, Muzhou Wang, Wei Service Computing Technology and System Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ChinaGrid is a nationwide grid project supported by the Chinese government that aims at integrating massive heterogeneous resources distributed on the China Education and Research Network (CERNET). The ChinaGrid Supporting Platform (CGSP) is a grid middleware developed for ChinaGrid. It provides a series of system-level services for ChinaGrid, helps to build application portals and integrate grid resources, and supports the secondary development of grid services. Data Management services (DMS) is a group of system-level services in CGSP for managing storage and data resources, supporting transparent data access, and guaranteeing high-performance data transfer on the grid. It consists of metadata management service, storage resource management service, replication management service, storage agent and transfer client. It offers the fundamental support for data access on ChinaGrid. In this paper, we introduce the design principle and implementation of DMS and its transfer scheme. © 2007, Inderscience Publishers.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

HAND: Highly Available Dynamic Deployment Infrastructure for Globus Toolkit 4

HAND: Highly Available Dynamic Deployment Infrastructure for...

引用

Euromicro Conference on Parallel, Distributed and Network-Based Processing

作者： Li Qi Hai Jin Ian Foster Jarek Gawor Cluster and Grid Computing Laboratory Services Computing Technology and System Laboratory Huazhong University of Science and Technology Wuhan China Department of Computer Science University of Chicago USA Mathematics and Computer Science Division Argonne National Laboratory USA

Grid computing is becoming more and more attractive for coordinating large-scale heterogeneous resource sharing and problem solving. Of particular interest for effective grid computing is a software provisioning mechanism. We propose a highly available dynamic deployment infrastructure, HAND, based on the Java Web services core of Globus toolkit 4. HAND provides capability, availability, and extensibility for dynamic deployment of Java Web services in dynamic grid environments. We identify the factors that have impact to dynamic deployment in static and dynamic environments. We also present the design, analysis, implementation, and evaluation of two different approaches to dynamic deployment (service level and container level), and examine the performance of alternative data transfer protocol for service implementations. Our results demonstrate that HAND can deliver significantly improved availability and performance relative to other approaches

关键词： Grid computing Java Web services Availability Large-scale systems Resource management Problem-solving Performance analysis Containers Protocols

来源：评论

学校读者我要写书评

暂无评论

Integrating Attribute and Status Constraint into the RBAC Model for Access Control in Ubiquitous systems

Integrating Attribute and Status Constraint into the RBAC Mo...

引用

International Conference on Future Generation Communication and Networking (FGCN)

作者： Deqing Zou Jong Hyuk Park Tai-hoon Kim Xueguang Chen Cluster and Grid Computing Laboratory & Services Computing Technology and System Laboratory School of Computer Science and Technology Huazhong University of Science and Technology China Department of Computer Engineering Kyungnam University Masan Gyeongsangnam South Korea Hannam University South Korea Department of Control Science and Engineering Huazhong University of Science and Technology China

It now becomes a trend to implement the interconnections between resources as well as services in ubiquitous systems. Attribute-based authorization mechanisms, protocols and systems are gaining in popularity, such as SAML, XACML, Shibboleth, etc. However, their management efficiency could be further improved. The Role-based Access Control (RBAC) mechanism is widely accepted as a general mechanism for authorization management. However, RBAC is still not flexible enough to address various application scenarios in ubiquitous systems. We propose a new architecture for access control in ubiquitous systems that impose attribute and status constraints on the RBAC model, which can significantly enhance the generality and flexibility of authorization by integrating the advantages of RBAC and attributed- based access control models. Moreover, the state mechanism proposed in this architecture captures the states of the authorization elements so as to reflect the outcomes of the authorization control. Finally, we analyze the flexibility and generality of this architecture in ubiquitous systems.

关键词： Access control Authorization Permission Grid computing Pervasive computing Access protocols Application software Markup languages computer science Control system analysis

来源：评论

学校读者我要写书评

暂无评论

Distributed application integration based on agent grid intelligent platform

Distributed application integration based on agent grid inte...

引用

2nd International Conference on Innovative computing, Information and Control, ICICIC 2007

作者： Wang, Maoguang Shi, Zhongzhi Luo, Jiewen Zeng, Li School of Computer Science and Technology China University of Mining and Technology Xuzhou 221226 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China Graduate School Chinese Academy of Sciences Beijing 100039 China

ISBN: (纸本)0769528821

Due to the existence of a large amount of legacy information systems, how to obtain the information and integrate the legacy systems is becoming more and more concerned. This paper introduces the integration pattern based on agent grid. And we propose an agent grid intelligent platform called AGrIP, which can erase information islands and integrate external systems efficiently by encapsulating the distributed application system to agents. AGrIP adopts distributed hierarchical structure, which is capable of integrating external systems to provide the users various services dynamically. AGrIP has proved itself scalable and efficient during the industry projects development and application. © 2007 IEEE.

关键词： Intelligent agents

来源：评论

学校读者我要写书评

暂无评论

Supporting VCR Functions in P2P VoD services Using Ring-Assisted Overlays

Supporting VCR Functions in P2P VoD Services Using Ring-Assi...

引用

IEEE International Conference on Communications (ICC)

作者： B. Cheng H. Jin X. Liao Service Computing Technology and System Lab Cluster and Gride Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Peer-to-peer (P2P) networks have been shown to be a promising approach to providing large-scale video-on-demand (VoD) services over the Internet for their potential scalability. However, how to efficiently support VCR functions for VoD services in such networks remains a major challenge. In this paper we propose a novel ring-assisted overlay topology, called RINDY, to address this issue. In RINDY, a peer can implement fast relocation of random seeks by maintaining some near neighbors and remote neighbors in a set of concentric rings with power law radii. We explore several key problems in RINDY including ring organization, neighbor placement over rings and neighbor lookup for random seeks. We evaluate its performance through simulations and compare it with some existing approaches. The experimental results show that RINDY outperforms previous schemes in terms of control overhead, latency and quality of streaming, especially under frequent VCR operations.

关键词： Video recording Peer to peer computing Streaming media Web and internet services Network servers Scalability Network topology Protocols Web server Communications Society

来源：评论

学校读者我要写书评

暂无评论

Matching request profile and service profile for semantic web service discovery

Matching request profile and service profile for semantic we...

引用

2007 AAAI Workshop

作者： Peng, Hui Shi, Zhongzhi Qiu, Lirong Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences 100080 Beijing China School of Computer Science and Engineering Hunan University of Science and Technology Xiang Tan 411201 China Graduate School Chinese Academy of Sciences 100039 Beijing China

ISBN: (纸本)9781577353386

OWL-S Service Profile provides a way to describe services offered by providers and services needed by requesters. But some items in the Profile are not very suitable for describing a requester's demands while some important information about the requester himself such as his identity which may play important role in precondition match are not considered in the Service Profile. In this paper we define an OWL compatible Request Profile ontology especially for service requesters to describe their special properties and their expectation about a service. Then a match algorithm is proposed to match service request described in Request Profile with service advertise described in Service Profile. The experiment results show that the match algorithm is efficient.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Efficient entity relation discovery on Web

引用

Journal of Computational Information systems 2007年第4期3卷 1699-1704页

作者： He, Jing Liu, Yuan Tu, Qichen Yao, Conglei Di, Nan Computer Networks and Distributed System Laboratory School of Computer Science and Technology Peking University Beijing 100871 China

With popularization of Web, there are billions of pages on Web, which contain affluent information of real world entities and their relations. Therefore, much research focuses on named entity extraction and entity relation discovery for constructing social networks which can reflect the real society. However, some former entity relation discovery approaches, extracting a small group of entities in a limited community or intranet, is not so scalable. So when it is applied to a large group of entities on Web, it may fail. In this paper, we employ co-occurrence to identify the relations between entities. The contribution of the paper is: 1. Empirically evaluating various frequently used measures for co-occurrence and find Cosine outperforms the others;2. Presenting two novel efficient algorithms for discovering relations between entities and comparing them.

关键词： Information systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：