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

International Conference on computer Supported Cooperative Work in Design

作者： Yingchun Yuan Xiaoping Li Qian Wang Xia Zhu School of Computer Science and Engineering South-East University Nanjing China Faculty of Information Science Agricultural University of Hebei Baoding China Key Laboratory of Computer Network and Information Integration Ministry of Education South-East University Nanjing China School of Computer Science and Engineering Southeast University Nanjing 210096 P.R. China Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education Nanjing 210096 P.R. China. qwang@*** Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education Nanjing 210096 P.R. China

ISBN: (纸本)1424409624

Cost optimization for workflow applications with deadline constraints is fundamental and intractable in grids. In this paper, early tree is introduced to find an early feasible schedule for a workflow application. According to the early tree, a cost optimization algorithm is proposed. Taking into account the workflow total float, the workflow deadline is segmented to activity deadlines while keeping precedence constraints. Costs of all activities are locally optimized, so does the workflow cost. Experimental results show that the proposal that this approach can dramatically decrease workflow cost with different deadlines. Moreover, it outperforms other two leveling algorithms in performance on average.

关键词： Cost function Optimization methods Quality of service Delay Partitioning algorithms Constraint optimization Grid computing Collaborative work Design methodology computer science

来源：评论

学校读者我要写书评

暂无评论

Hybrid Heuristic for Total Flowtime Minimization in No-wait Flow Shops

Hybrid Heuristic for Total Flowtime Minimization in No-wait ...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Xia Zhu Xiaoping Li Qian Wang School of Computer Science and Engineering Key Laboratory of Computer Network and Information Integration Ministry of Education South-East University Nanjing China

ISBN: (纸本)1424409624

In this paper, no-wait flow shop scheduling problem with total flowtime minimization is considered. A hybrid heuristic is proposed, which is based on PHI (p) (presented by Aldowaisan and Allahverdi, OMEGA, 2004). A composite algorithm is adopted to generate the initial seed. Job insertion in PHI (p) is replaced with an existing constructive heuristic. Experimental results show that the proposal outperforms PHI (p), especially for large scale instances.

关键词： Job shop scheduling Large-scale systems Manufacturing Chemical technology Collaborative work Design engineering Laboratories computer networks Processor scheduling Proposals

来源：评论

学校读者我要写书评

暂无评论

Design and Analysis of a Multiscale Active Queue Management Scheme

引用

Journal of computer Science & Technology 2006年第6期21卷 1022-1030页

作者：纪其进董永强 School of Computer Science and Engineering Southeast University Nanjing 210096 P.R. China Key Laboratory of Computer Network and Information Integration of Ministry of Education Southeast University Nanjing 210096 P.R China

Since Internet is dominated by TCP-based applications, active queue management （AQM） is considered as an effective way for congestion control. However, most AQM schemes suffer obvious performance degradation with dynamic traffic. Extensive measurements found that Internet traffic is extremely bursty and possibly self-similar. We propose in this paper a new AQM scheme called multiscale controller （MSC） based on the understanding of traffic burstiness in multiple time scale. Different from most of other AQM schemes, MSC combines rate-based and queue-based control in two time scales. While the rate-based dropping on burst level （large time scales） determines the packet drop aggressiveness and is responsible for low and stable queuing delay, good robustness and responsiveness, the queue-based modulation of the packet drop probability on packet level （small time scales） will bring low loss and high throughput. Stability analysis is performed based on a fluid-flow model of the TCP/MSC congestion control system and simulation results show that MSC outperforms many of the current AQM schemes.

关键词： active queue management multiscale traffic burstiness fluid-flow model stability analysis

来源：评论

学校读者我要写书评

暂无评论

Dynamic Bandwidth Allocation and Rate Coordination for DiffServ Environment

引用

Wuhan university Journal of Natural Sciences 2006年第1期11卷 248-252页

作者： CHEN Gang WU Guo-xin ZHANG San-feng YOU Feng-qin Department of Computer Science and Engineering Southeast University Nanjing 210096 Jiangsu China Key Laboratory of Computer Network and Information Integration of MOE Southeast University Nanjing 210096Jiangsu China

This paper presents a novel model for dynamic bandwidth allocation and rate coordination based on DiffServ and a bandwidth broker（BB）. In this model, assignment of bandwidth was made according to a periodic trace of network characteristics per application. And adjustment of transfer rate was accomplished through negotiation with applications by a bandwidth agent. This model was evaluated using network simulator 2 （NS-2）, and distinct improvements were found in respects of delay and packet loss of overall network and single flow. Finally, the model was suggested to be leveraged to multimedia applications with properties of lower delay and lower packet loss.

关键词： QoS bandwidth broker（BB） dynamic bandwidth allocation rate coordination

来源：评论

学校读者我要写书评

暂无评论

A structured P2P system with match path and probability balance tree

A structured P2P system with match path and probability bala...

引用

First International Multi- Symposiums on computer and Computational Sciences, IMSCCS'06

作者： Xu, L.B. Wu, G.X. You, F.Q. Key Laboratory of Computer Network and Information Integration Southeast University Nanjing 210096 China

ISBN: (纸本)0769525814

Excellent P2P network infrastructure should support scalability and efficient search simultaneity. The intelligent routing mechanisms have flexible query expression but hold low scalability and recall rate. Contrastively, DHTs are scalable but either difficult to organize or too expensive for maintenance. A new structured P2P model is proposed in which resource storages are organized by match path and random access method. When an approximately balance distributed character is obtained, nodes will keep high search efficiency and low maintenance cost. The system supports various query models, has load balancing capability and high scalability, and ensures search range of each node can cover entire network. The system runs without any center service while all nodes simultaneously take index storage, data storage and routing task to drive network by only maintaining a little local information. © 2006 IEEE.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Some Issues on computer networks:Architecture and key Technologies

引用

Journal of computer Science & Technology 2006年第5期21卷 708-722页

作者：顾冠群罗军舟 School of Computer Science and Engineering Southeast UniversityNanjing 210096P.R.China Key Laboratory of Computer Network and Information Integration(Sout-heast University) Ministry of Education Nanjing 210096P.R.China

The evolution of computer networks has experienced several major steps, and research focus of each step has been kept changing and evolving, from ARPANET to OSI/RM, then HSN （high speed network） and HPN （high performance network）. During the evolution, computer networks represented by Internet have made great progress and gained unprecedented success. However, with the appearance and intensification of tussle, along with the three difficult problems （service customizing, resource control and user management） of modern network, it is found that traditional Internet and its architecture no longer meet the requirements of next generation network. Therefore, it is the next generation network that current Internet must evolve to. With the mindset of achieving valuable guidance for research on next generation network, this paper firstly analyzes some dilemmas facing current Internet and its architecture, and then surveys some recent influential research work and progresses in computer networks and related areas, including new generation network architecture, network resource control technologies, network management and security, distributed computing and middleware, wireless/mobile network, new generation network services and applications, and foundational theories on network modeling. Finally, this paper concludes that within the research on next generation network, more attention should be paid to the high availability network and corresponding architecture, key theories and supporting technologies.

关键词： computer network tussle resource control network management security middleware wireless/mobile network modeling high availability network

来源：评论

学校读者我要写书评

暂无评论

Improvement of CORBA audio/vided streaming service

引用

Jisuanji Gongcheng/computer Engineering 2006年第5期32卷 207-209+228页

作者： Chu, Zi Feng, Mingzheng Dai, Jiangpeng Department of Computer Science and Engineering Southeast University Nanjing 210096 China Key Laboratory for Computer Network and Information Integration Nanjing 210096 China

The paper makes two contributions to the study of A/V streaming service: (1) introduces a service management mechanism for monitoring and controlling resource utilities to enhance quality of service guarantees;(2) improves the security of A/V streaming service and reduces the complexity of encryption computations by applying CORBA security services in conjunction of the wavelet compression and encryption technology for multimedia data. An improved CORBA A/V streaming service prototype is implemented based on ORBUS which is a real-time CORBA ORB, and its application in networked manufacturing system is also discussed.

关键词： CORBA Multimedia QoS Security services Streaming

来源：评论

学校读者我要写书评

暂无评论

Solving reliable coverage in fault tolerant energy efficient wireless sensor network

引用

Ruan Jian Xue Bao/Journal of Software 2006年第SUPPL.期17卷 184-191页

作者： Xu, Qiang Wang, Yun School of Computer Science and Engineering Southeast University Nanjing 210096 China Laboratory of Computer Network and Information Integration Nanjing 210096 China

Based on the heuristic method used to solve set k cover problem, a scheme namely reliable coverage scheme is proposed to solve reliable coverage problem within the cluster in a hierarchical structured network. A minimum cover is a smallest set of sensor nodes capable of complete monitoring over the entire cluster area. 1-resistant minimum cover topology, applied in reliable coverage scheme, is the combination of two minimum covers. Round robin working of 1-resistant minimum covers prolongs network lifetime significantly. The redundant minimum cover shields nodes' failures from a single minimum cover. In reliable coverage scheme, interaction protocol between cluster head and cluster members is introduced and instant cover replacement algorithm is applied to handle possible members' failures. Simulations show that this scheme is able to efficiently utilize energy to prolong network lifetime while at the same time keeping missed monitoring at a low level.

关键词： Wireless telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

A Structured P2P System with Match Path and Probability Balance Tree

A Structured P2P System with Match Path and Probability Bala...

引用

International Multi-Symposiums on computer and Computational Sciences (IMSCCS)

作者： L. B. Xu G. X. Wu F. Q. You Key Laboratory of Computer Network and Information Integration South-East University Nanjing China

关键词： Peer to peer computing Routing Scalability Databases network topology Costs Memory Intelligent networks Resource management Logic

来源：评论

学校读者我要写书评

暂无评论

Incentive model adapted to self-organizing management mode for resource sharing in P2P networks

引用

Tien Tzu Hsueh Pao/Acta Electronica Sinica 2006年第11期34卷 2081-2084页

作者： Liu, Ye Yang, Peng Liu, Lin-Feng Xia, Qin Key Laboratory of Computer Network and Information Integration Southeast University Nanjing 210096 China

The self-organizing management mode in P2P networks leads to a large amount of selfish behaviors among peers. The corresponding solutions to this problem could hardly keep the merits of P2P network simultaneously, such as self-organization or dynamic scalability. Most of the proposed reputation management models or incentive ones use the flooding mechanism to learn historical behaviour information of other peers, which causes excessive incurred packets, and thus limits the dynamic scalability. A novel incentive framework named as ResP2P based on random matching games theory is given in the paper. Peer reputation and its renewal mechanism, along with some essential social norms are introduced in ResP2P model, which stimulates rational peers to maximize their own utility and contribute their free resource. Experiments have verified the validity and efficiency of the incentive mechanism. The relative distributed algorithm can easily be deployed in a P2P networks and satisfied with self-organization and scalability.

关键词： computer networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：