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

2011 IEEE 9th International Conference on Web Services, ICWS 2011

作者： Zhu, Jie Gao, Bo Wang, Zhihu Reinwald, Berthold Guo, Changjie Li, Xiaoping Sun, Wei School of Computer Science and Engineering Southeast University 210096 Nanjing China Key Laboratory of Computer Network and Information Integration Ministry of Education China IBM Research-China 100193 Beijing China IBM Almaden Research Center 650 Harry Road San Jose CA 95120 United States

ISBN: (纸本)9780769544632

In Database-as-a-Service (DBaaS), a large number of tenants share DBaaS resources (CPU, I/O and Memory). While the DBaaS provider runs DBaaS to "share" resources across the entire tenant population to maximize resource utilization and minimize cost, the tenants subscribe to DBaaS at a low price point while still having resources conceptually "isolated" according to service level agreements (SLAs). To optimize this dichotomy of goals, we propose a dynamic resource allocation framework that periodically re-allocates resources to tenants to maximize resource utilization while tolerating a low risk of SLA violations. We model the resource allocation problem as a modified unbounded knapsack problem. The model introduces an additional fairness constraint to assign residual resources to active tenants, while avoiding that few tenants consume all residual resources. Performed experiments demonstrate the effectiveness and efficiency of the proposed allocation algorithm for a synthetic workload with burstiness and predicted tenant behavior. © 2011 IEEE.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Collaborative Approaches to Complementing Qualitative Preferences of Agents for Effective Service Selection

Collaborative Approaches to Complementing Qualitative Prefer...

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Hongbing Wang Jie Zhang Yangyu Tang Shizhi Shao Key Laboratory of Computer Network and Information Integration School of Computer Science and Engineering South East University China School of Computer Engineering Nanyang Technological University Singapore

Incomplete preferences of agents may render service selection ineffective. We address this problem by proposing a set of collaborative approaches to complementing agents' incomplete preferences in a qualitative way. For an agent, the approaches first find its similar agents, and then base the similar agents' qualitative preferences to complement this agent's missing preferences. We analyze and compare these approaches and provide experimental results to justify our arguments. We also compare our approach with the classic collaborative filtering and show the competitive advantages of our approach in service selection. Our work thus serves as an important step towards effective service selection.

关键词： Collaboration Clustering algorithms Mathematical model Equations Complexity theory Humans Educational institutions

来源：评论

学校读者我要写书评

暂无评论

不确定图最可靠最大流算法研究

不确定图最可靠最大流算法研究

引用

第29届中国数据库学术会议

作者： CAI Wei 蔡伟 ZHANG Bai-Li 张柏礼 LV Jian-Hua 吕建华 School of Computer Science and Engineering Southeast University Nanjing 210096 东南大学计算机科学与工程学院南京 210096 Key Laboratory of Computer Network and Information Integration of Ministry of Education Southeast U 东南大学计算机网络和信息集成教育部重点实验室南京 210096

文中首先基于可能世界模型提出了不确定图的最可靠最大流问题和可靠性计算模型,这对于构建可靠性网络、可靠传输路径选择以及系统薄弱环节分析等一系列实际问题具有重要意义;然后基于简单路径组合思想提出了一种求解最可靠最大流的算法S... 详细信息

文中首先基于可能世界模型提出了不确定图的最可靠最大流问题和可靠性计算模型,这对于构建可靠性网络、可靠传输路径选择以及系统薄弱环节分析等一系列实际问题具有重要意义;然后基于简单路径组合思想提出了一种求解最可靠最大流的算法SPCA,通过简单路径流量的组合,在无需求得所有最大流分布的情况下获得最可靠最大流,并在组合过程中引入概率剪枝与约束剪枝策略,对无效组合进行过滤,从而显著地提高了算法效率;接着文中针对SPCA算法易受路径数量及瓶颈容量影响的问题,又提出一种基于状态空间划分的最可靠最大流算法SDBA,该算法的主要思想是将不确定图所蕴含的子图空间划分为互不相交且满足最大流值的闭合区间集合,进而寻找所有闭合区间中概率最大的下界状态,经证明这个下界状态对应子图中的最大流分布为最可靠最大流;最后通过实验,比较了两种算法的性能。实验结果表明SDBA算法相对于SPCA算法其空间复杂度有一定的增加,但时间复杂度方面具有较大的优势,能够很好地解决SPCA算法性能受制于容量的问题,具有更好的性能与适用性。

关键词：数据集不确定图可靠性计算方法复杂度

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Resource Allocation Algorithm for Database-as-a-Service

A Dynamic Resource Allocation Algorithm for Database-as-a-Se...

引用

IEEE International Conference on Web Services (ICWS)

作者： Jie Zhu Bo Gao Zhihu Wang Berthold Reinwald Changjie Guo Xiaoping Li Wei Sun School of Computer Science & Engineering South-East University Nanjing China Key Laboratory of Computer Network and Information Integration Ministry of Education China IBM Research China Beijing China IBM Almaden Research Center San Jose CA USA

关键词： Resource management Monitoring Dynamic scheduling Heuristic algorithms Servers Noise Time series analysis

来源：评论

学校读者我要写书评

暂无评论

Research of routing techniques on delay tolerant networks

引用

Nanjing Li Gong Daxue Xuebao/Journal of Nanjing University of Science and Technology 2011年第SUPPL. 1期35卷 215-222页

作者： Xu, Jia Wang, Ru-Chuan Sun, Li-Juan Xiao, Fu Computer Institute Nanjing University of Posts and Telecommunications Nanjing 210003 China Key Laboratory for Computer Network and Information Integration of Ministry of Education Southeast University Nanjing 211189 China State Key Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China

Delay tolerant networks(DTNs) can interconnect highly heterogeneous networks among extreme environments even between nodes without end-to-end path. As a new evolution of Mobile Ad hoc network(MANET)and wireless sensor network(WSN), the DTN is an important technique in ubiquitous networking when the time-space range of data collection and service is greatly expanded. As the key components of DTN, routing technique is a challenge and promising research field. While a lot of DTN routing protocols have been proposed, there is no comprehensive classification system for DTN routing protocols. Review for various protocols in respect of principles, characteristics, comparisons is also needed. This paper introduces the architecture, challenges, theoretical basis, evaluation metrics and classification of DTN routing protocols. The basic principles and features of representative routing algorithms are analyzed and compared for each class, intending to motivate new research and development in this area.

关键词： Delay tolerant networks

来源：评论

学校读者我要写书评

暂无评论

A robust and secure overlay storage scheme based on erasure coding

A robust and secure overlay storage scheme based on erasure ...

引用

5th International Conference on Pervasive Computing and Applications, ICPCA10

作者： Li, Chuanyou Wang, Yun School of Computer Science and Engineering Southeast University Key Lab of Computer Network and Information Integration Nanjing 210096 China

ISBN: (纸本)9781424491421

Recently, in classical P2P overlay networks, with applying replication technique, a single peer is replaced by a cluster of peers in order to tolerant Byzantine failures. In this paper, a novel robust and secure scheme for storage overlay networks is proposed by applying erasure coding technique to reduce redundancy and enhance privacy protection. For achieving a lightweight data privacy protection, encoded strips are stored and dual distinct hash functions are deployed to construct hash chains to protect location information for encoded strips. Simulation results show that with different percentage of malicious peers, by adjusting encoding parameters, the scheme is available to provide durable data storage service. ©2010 IEEE.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Static channel assignment with the physical interference model for maximum capacity in multi-radio multi-channel wireless mesh networks

Static channel assignment with the physical interference mod...

引用

International Conference on Grid and Cloud Computing

作者： Shao, Birui Tao, Jun Wang, Fangfang Key Laboratory of Computer Network and Information Integration of Ministry of Education Southeast University Nanjing 210096 China

ISBN: (纸本)9780769543130

In this paper, a model for the static channel assignment in multi-radio multi-channel wireless mesh networks is proposed. We describe an interference model in wireless communication environment. The degree of detail in the model determines the accuracy of channel assignment. In many wireless mesh networks studies, the simplistic protocol interference model is adopted, but the model is usually not realistic and practical. Therefore, we construct a physical interference model and put forward a pure integer quadratic programming (PIQP) model to solve the channel assignment problem and maximize the capacity of wireless mesh networks. The feasibility and effectivity of the channel assignment solution are suggested by the results of simulation. © 2010 IEEE.

关键词： Quadratic programming

来源：评论

学校读者我要写书评

暂无评论

An energy-balanced multicast routing algorithm in wireless sensor networks

An energy-balanced multicast routing algorithm in wireless s...

引用

International Conference on Grid and Cooperative Computing (GCC)

作者： Wang, Fangfang Tao, Jun Shao, Birui Key Laboratory of Computer Network and Information Integration of Ministry of Education Southeast University Nanjing 210096 China

ISBN: (纸本)9780769543130

An energy-balanced multicast routing algorithm EBMR in wireless sensor networks (WSNs) is proposed. The objective of EMBR algorithm is to improve the energy efficiency and extend the network lifetime in multicast. To achieve this goal, the energy consumption model in WSNs is analyzed and an energy-constrained metric for multicast forwarder selecting is studied. Then the framework of EBMR algorithm is discussed. Simulation results show that EBMR algorithm is able to reduce energy consumption of the whole network evenly. Compared with shortest path tree (SPT) multicast routing algorithm, EMBR algorithm will extend the network lifetime. © 2010 IEEE.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

An improved header compression scheme for 6LoWPAN networks

An improved header compression scheme for 6LoWPAN networks

引用

International Conference on Grid and Cooperative Computing (GCC)

作者： Wang, Huiqin Dong, Yongqiang School of Computer Science and Engineering Southeast University Key Laboratory of Computer Network and Information Integration Ministry of Education Nanjing China

ISBN: (纸本)9780769543130

To apply IPv6 to IEEE 802.15.4-based low-power wireless personal area networks, efficient packet header compression is essential to adapt to limited bandwidth, memory and energy resources of such networks. While the existing header compression solutions are yet to be perfected, an improved header compression scheme is proposed which has the capability to better support the compression on IPv6 multicast address, UDP, ICMP headers and routing extension headers as well. © 2010 IEEE.

关键词： Energy resources

来源：评论

学校读者我要写书评

暂无评论

SOA-based method for cooperative tasks distribution in large-scale optimization environments

SOA-based method for cooperative tasks distribution in large...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Cui, Qiuxiang Zhu, Xia Zhang, Yi Li, Xiaoping School of Computer Science and Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University Nanjing China

ISBN: (纸本)9781424467631

In this paper, operators are encapsulated by services in algorithms for large-scale optimization problems and the services are deployed in distributed systems. Response time is an important factor for the performance of cooperative services. The message parse time is analyzed. Initial service accessing time is the main overhead for service calling. To decrease both the initial time and the response time, SBP (Service Buffering Pool based Scheduling Algorithm) is proposed by integrating a resource pool with a cache. Appropriate number of computing resources can be determined for large-scale optimization problems after analyzing the influence of the number of computing resources on algorithms. The proposed algorithm is compared with a centralized algorithm and a distributed algorithm without cache. Experimental results show that the proposed algorithm has a lower overhead than the other two algorithms. © 2010 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：