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

37th International Conference on Parallel Processing, ICPP 2008

作者： Yang, Sirui Jin, Hai Li, Bo Liao, Xiaofei Yao, Hong Tu, Xuping Services Computing Technology and System Lab. School of Computer Science and Technology Huazhong University of Science and Technology China Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay Kowloon Hong Kong

ISBN: (纸本)9780769533742

There has been significant progress in the development and deployment of Peer-to-Peer (P2P) live video streaming systems. However, there has been little study on the security aspect in such systems. Our prior experiences in Anysee exhibit that existing systems are largely vulnerable to intermediate attacks, in which the content pollution is a common attack that can significantly reduce the content availability, and consequently impair the playback quality. This paper carries out a formal analysis of content pollution and discusses its implications in P2P live video streaming systems. Specifically, we establish a probabilistic model to capture the progress of content pollution. We verify the model using a real implementation based on Anysee system;we evaluate the content pollution effect through extensive simulations. We demonstrate that (1) the number of polluted peers can grow exponentially, similar to random scanning worms. This is vital that with 1 % polluters, the overall system can be compromised within minutes;(2) the effective bandwidth utilization can be sharply decreased due to the transmission of polluted packets;(3) Augmenting the number of polluters does not imply a faster progress of content pollution, in which the most influential factors are the peer degree and access bandwidth. We further examine several techniques and demonstrate that a hash-based signature scheme can be effective against the content pollution, in particular when being used during the initial phase.1 © 2008 IEEE.

关键词： Pollution

来源：评论

学校读者我要写书评

暂无评论

D-overlay: A delay-aware overlay for gaming services

D-overlay: A delay-aware overlay for gaming services

引用

3rd International Conference on Innovative computing Information and Control, ICICIC'08

作者： Xiaofei, Liao Linchen, Yu Hai, Jin Hong, Yao Cluster and Grid Computing Lab. Services Computing Technology and System Lab. Huazhong University of Science and Technology Wuhan 430074 China School of Computer Science and Technology China University of Geosciences Wuhan 430074 China

ISBN: (纸本)9780769531618

Peer-to-peer (P2P) has become an important computing model because of its adaptation, selforganization and autonomy. But how to organize dynamic nodes in P2P networks efficiently for gaming message passing services is still a challenge. This paper present an approach, named D-overlay, a delay-aware overlay for gaming services, to implement node clustering based on link delay of nodes communications in the P2P network. This approach measures the delays among peers, explores the node connectivity together with the connection quality. Then, it builds a service ring for each peer according to its latency status, and keeps the low latency among neighbors by periodical adjustments. D-overlay improves the extensibility and reliability. One system, called PKTown, has been deployed based on D-overlay in CERNET of China. © 2008 IEEE.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Mobile ATM for developing countries

Mobile ATM for developing countries

引用

3rd International Workshop on Mobility in the Evolving Internet Architecture, MobiArch'08

作者： Karunanayake, Amila De Zoysa, Kasun Muftic, Sead Department of Computer Science School of Computing University of Colombo Sri Lanka Department of Computer and System Science Royal Institute of Technology Stockholm Sweden

ISBN: (纸本)9781605581781

Society benefits from M-Commerce applications to a greater extent. The most attractive benefit of M-Commerce applications is the mobility. Even though users have a poor computer literacy, they will be able to use the M-Commerce applications easily. Additionally, the M-Commerce applications have the potential of reducing the distance barriers. In developing countries, especially in rural areas, accessing financial and banking services is a critical issue. This paper proposes a system called Mobile-ATM to address this problem by incorporating the mobile technology. Also it discusses the limitations of traditional ATM systems, the need of a new M-Commerce application to overcome the limitations and security related issues. In the proposed solution, people can withdraw money from a Mobile-ATM without going to a traditional ATM. The Mobile-ATM system uses even cheap mobile phones, functioning as payment terminals. It will reduce the limitations of traditional ATM and enables confidential and secured ATM transactions. Copyright 2008 ACM.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

XenLR: Xen-based Logging for Deterministic Replay

XenLR: Xen-based Logging for Deterministic Replay

引用

Japan-China Joint Workshop on Frontier of computer science and technology (FCST)

作者： Haikun Liu Hai Jin Xiaofei Liao Zhengqiu Pan Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Virtual machine (VM) based logging-and-replay technology has attracted much attention for system security, fault tolerance, and debugging. However, so far there is not a replay system designed on virtual machine monitor Xen. In this paper, XenLR presents the design and implementation of a logging tool for full system replay on Xen. To reduce the design complexity, XenLR is achieved on a lightweight VM mini OS. Our preliminary work dedicates to identify architectural non-deterministic events and record them compactly. XenLR does not modify the guest OS and only need to record the external inputs (keyboard input and time update on mini OS). The log data are saved in the privileged domain¿s file system through transmission channels. The experiments indicate that XenLR results in low time and space overhead. Overhead due to logging is imperceptible for interactive use. The log files grow at 1.4 MByte/day, so it causes litter space consumption for today¿s large capacity disk storage.

关键词： Space technology Virtual machining Operating systems computer science Virtual manufacturing Debugging Virtual machine monitors Counting circuits Kernel Grid computing

来源：评论

学校读者我要写书评

暂无评论

A New Proxy Scheme for Large-Scale P2P VoD system

A New Proxy Scheme for Large-Scale P2P VoD System

引用

IEEE/IFIP International Conference on Embedded and Ubiquitous computing, EUC

作者： Wenbin Jiang Chong Huang Hai Jin Xiaofei Liao Services Computing Technology and System Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Large-scale stream media delivery over Internet is one hot and hard problem. Three main solutions have been developed for this purpose. Content delivery network (CDN) can provide high quality streaming service with high cost. Server-based proxies are cost-effective but not scalable due to the limited proxy capacity and its centralized control. Peer-to-peer (P2P) network is scalable but does not guarantee high quality streaming service due to its self-restrained characteristic. This paper proposes a new chunk-based scalable and reliable proxy scheme for P2P network. Clients are self-organized in unstructured P2P VoD system GridCast and requests for media contents that are not found in P2P overlay from proxy servers. This scheme can address the limitations of server-based proxy model and client-based P2P model. The proposed scheme is evaluated by trace-driven simulations from logs collected in GridCast. The results show that the approach proposed significantly improves the quality of media streaming and the system scalability.

关键词： Large-scale systems Streaming media Network servers Bandwidth Scalability Peer to peer computing Web and internet services Costs Centralized control Cache storage

来源：评论

学校读者我要写书评

暂无评论

A Method of Estimating Traffic Status in Urban Road Network Based on Grid technology

A Method of Estimating Traffic Status in Urban Road Network ...

引用

International Symposium on Intelligent Information technology Application, IITA

作者： Xinhong Wu Hai Jin Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

This paper describes a method using grid technology to improve traffic algorithm efficiency. The method cooperates traffic status estimation algorithm with grid technology. It collects and preprocesses massive real-time data of taxi global positioning system (GPS) as floating car data as well as geographic Information systems (GIS) data of Shanghai urban road network. Then, it adopts grid technology to deal with computation for the shortest time path algorithm on traffic status estimation in real time. The results of experiment prove that the grid technology can greatly improve the computing efficiency of traffic status estimation model.

关键词： Telecommunication traffic Traffic control Grid computing Roads Global Positioning system Distributed computing Clustering algorithms computer networks Application software Geographic Information systems

来源：评论

学校读者我要写书评

暂无评论

UNBOUNDED BATCH SCHEDULING WITH A COMMON DUE WINDOW ON A SINGLE MACHINE

引用

Journal of systems science & Complexity 2008年第2期21卷 296-303页

作者： Hongluan ZHAO Guojun LI School of Computer Science and Technology Shandong Jianzhu University Jinan 250101 China School of Mathematics and System Science Shandong University Jinan 250100 China Computational Systems and Biology Laboratory Department of Biochemistry and Molecular Biology the University of Georgia Anthens 3060 USA.

The common due window scheduling problem with batching on a single machine is dealt with to minimize the total penalty of weighted earliness and tardiness. In this paper it is assumed that a job incurs no penalty as long as it is completed within the common due window. It is the first time for the due window scheduling to be extended to this situation so that jobs can be processed in batches. An unbounded version of batch scheduling is also considered. Hence, jobs, no matter how many there are, can be processed in a batch once the machine is free. For two cases that the location of due window is either a decision variable or a given parameter, polynomial algorithms are proposed based on several optimal properties.

关键词： Batch due window earliness scheduling tardiness.

来源：评论

学校读者我要写书评

暂无评论

TCPBridge: A software approach to establish direct communications for NAT hosts

TCPBridge: A software approach to establish direct communica...

引用

ACS/IEEE International Conference on computer systems and Applications

作者： Sanmin Liu Hai Jin Xiaofei Liao Hong Yao Deze Zeng Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Traversing network address translation (NAT) for peer-to-peer (P2P) communication has become a hot topic recently. Compared to UDP, establishing TCP connections for hosts behind different NATs is more complex. Thus, many TCP-based applications do not address TCP traversal through NATs. Some solutions suggest using delegates to relay all communications, or tunneling TCP over UDP. However, they require a big reform to network architecture, or using a nonstandard TCP/IP stack. In this paper, we present a novel idea called TCPBridge. TCPBridge converts TCP traversal to UDP traversal without modifying any binaries of the TCP-based applications. Our design can be integrated with those P2P applications which have not solved TCP traversal problem, and extends them to support direct communications between NAT hosts. It deals with the problem of TCP traversal, so as to improve the usability of applications. We have implemented TCPBridge in several existing P2P systems. Statistics prove that TCPBridge is scalable and robust, and we believe it will benefit many other existing P2P applications.

关键词： Network address translation TCPIP Application software Punching Robustness Protocols Communication system software Grid computing computer science Peer to peer computing

来源：评论

学校读者我要写书评

暂无评论

Ripple: Toward a substrate middleware for peer-to-peer applications

Ripple: Toward a substrate middleware for peer-to-peer appli...

引用

3rd International Conference on Innovative computing Information and Control, ICICIC'08

作者： Yao, Hong Yu, Linchen Jin, Hai Yang, Sirui Huang, Qi Jiang, Wenjian School of Computer Science and Technology China University of Geosciences Wuhan 430074 China Cluster and Grid Computing Lab. Services Computing Technology and System Lab. Huazhong University of Science and Technology Wuhan 430074 China France Telecom R and D China Beijing 100190 China

ISBN: (纸本)9780769531618

Peers in multiple P2P applications execute overlapped operations with different implementation, like neighbour management, resource publish/lookup, delay investigation, which leads to poor interoperability and unnecessary network load. Peers contribute their resources only when they stay in same application. We propose a P2P middleware, called Ripple, to accomplish common functions in a layered architecture. Ripple manages all peers running various applications in a uniform substrate overlay network. The substrate overlay is designed with a hybrid topology. This hybrid topology does not aim at only a particular type of applications, but also enables the flexibility for various applications. Our work is an attempt to address common needs of P2P applications, which may simplify the development and improve the performance of P2P networks, as well as mitigate the sampling stress to physical networks. © 2008 IEEE.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

Diva: A dataflow programming model and its runtime support in java virtual machine

Diva: A dataflow programming model and its runtime support i...

引用

13th IEEE Asia-Pacific computer systems Architecture Conference, ACSAC 2008

作者： Yang, Chen Bin, Fan Lujie, Zhong Chengyong, Wu Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Science Beijing China Graduate School of the Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781424426836

Microprocessors have turned to multicore, i.e. multiple processor cores, along with some levels of on-chip caches and interconnection networks, integrated on a singe chip. However, it brings challenges on how to program these processors effectively and efficiently, which is known as the "Programming Wall". This paper proposes a systematic approach to attack the problem. We describe an extension of Java programming language with dataflow paradigm and transactional memory. Our approach alleviates the difficulties of parallel programming by providing a higher level of abstraction and relieving programmers of low-level threading and locking details. We also describe the design of a runtime system to support and optimize for the extension. We have implemented a prototype based on Apache Harmony DRL Virtual Machine. Preliminary experimental results on a 16-core SMP machine show that our approach achieves reasonable scalability and can adapt to the variance of available hardware resources. © 2008 IEEE.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：