一种网络服务自动部署方法

为满足网络服务使用者对网络服务部署的功能性和非功能性需求,运用Petri网的方法进行了互联网动态多变环境下的网络服务自动部署的研究,建立了一种基于Petri网的网络服务部署网模型,从形式化的角度描述了网络服务功能的部署情况,提出了一种按照服务质量来选择最优网络服务部署的算法。仿真的结果表明,与目前常用的固定部署算法和随机部署算法相比,按照该方法得到的网络服务部署能最好地满足服务使用者对服务的非功能性方面的需求。     

Name‐Based Autoconfiguration for Mobile Ad hoc Networks

In a mobile ad hoc network, difficulties exist in supporting address autoconfiguration and naming resolution due to the lack of centralized servers. This letter presents a novel approach, called name‐based autoconfiguration (NBA), which uses host names to determine IP addresses and provides address autoconfiguration and name resolution as a single protocol.     

Integration of batching and scheduling for hot rolling production in the steel industry

This paper investigates the hot rolling production scheduling problem in the steel industry and proposes a new mixed integer programming model for this problem based on the monolithic modeling strategy that integrates batching and scheduling. Using this strategy, the new model can simultaneously schedule multiple turns and simultaneously determine the production timetable of these turns in a global optimal view. A long-term tabu search heuristic using frequency-based memory is developed to obtain near-optimal solutions for this problem. Three kinds of speed-up strategies are developed to accelerate the search procedure of the proposed tabu search. A practical scheduling system combining the proposed mathematical model and the tabu search heuristic has been developed and tested on instances collected from practical production data. The experimental results show that the proposed mathematical model and the tabu search heuristic outperform both the current manual scheduling method and the traditional serial method.     

Impact of QOS requirements on video coding for ATM networks

The broadband integrated services digital networks (B-ISDN) based on asynchronous transfer mode (ATM) technology can support a wide range of applications such as voice, video, still images, and data. Compression techniques increase the effective bandwidth utilization, but the bursty and asynchronous nature of the traffic can still lead to congestion in the network, and degradation of image quality and quality of service (QOS). Some of the features to provide better coding schemes for ATM networks are layered coding, resynchronization, buffering, interleaved schemes, constrained bit rate due to buffers, encapsulation with the RTP or AAL1 for clock recovery, lapped transforms, motion compensation, and optimal bit allocation for coders based on wavelet transforms. We review various techniques forimage and video coding such as transforms, motion compensation, vector quantization, and subband coding. We outline the impact of the cell loss ratio (CLR), delay and cell delay variation (CDV) on video coding: blocking effects, loss of frame synchronization, motion vectors, and vector quantization codewords. The open problems include tuning coding parameters to the available QOS provided by the network.     

话音ATM交换的实现─—ATM论坛电路仿真系列建议

近年来，随着ATM主干网络的建设和发展，研究ATM对现有通信业务的支持方式和适配技术是目前ATM技术研究的热点之一。话音ATM交换在降低话音通信成本和简化网络操作环境等方面提供了大量的技术手段，并且支持在单一网络环境中的多种综合业务传输。ATM论坛制定了电路仿真系列建议，话音ATM交换的技术已经基本成熟。文章通过对话音ATM交换在实现和优化方面的技术进行分析，并提出一种基于NativeModeATM的话音通信方式。     

A Practical Cross-Layer Mechanism For Fairness in 802.11 Networks

Many companies, organizations and communities are providing wireless hotspots that provide networking access using 802.11b wireless networks. Since wireless networks are more sensitive to variations in bandwidth and environmental interference than wired networks, most networks support a number of transmission rates that have different error and bandwidth properties. Access points can communicate with multiple clients running at different rates, but this leads to unfair bandwidth allocation. If an access point communicates with a mix of clients using both 1 Mb/s and 11 Mb/s transmission rates, the faster clients are effectively throttled to 1 Mb/s as well. This happens because the 802.11 MAC protocol approximate “station fairness”, with each station given an equal chance to access the media. We provide a solution to provide “rate proportional fairness”, where the 11 Mb/s stations receive more bandwidth than the 1 Mb/s stations. Unlike previous solutions to this problem, our mechanism is easy to implement, works with common operating systems and requires no change to the MAC protocol or the stations. Joseph Dunn received an M.S. in computer science from the University of Colorado at Boulder in 2003, and B. S. in coputer science and mathematics from the University of Arizona in 2001. His research interests are in the general area of computer systems, primarily focusing on security and scalability in distributed systems. He is currently working on his Ph.D. in computer science from the University of Colorado at Boulder. Michael Neufeld received a Ph.D. in Computer Science from the University of Colorado at Boulder in December of 2004, having previously received an M.S. in Computer Science from the University of Colorado at Boulder in 2000 and an A.B. in Computer Science from Princeton University in 1993. His research interests are in the general area of computer system, specifically concentrating on wireless networking, software defind/cognitive radio, and streerable antennas. He is currently a postdoc in the Computer Science department at the University of Calorado at Boulder pursuing research related to software defined radio and new MAC protocols for steerable phase array antennas. Anmol Sheth is a Ph.D. student in Computer Science at the University of Colorado at Boulder. He received his B.S. in Computer Science from the University of Pune, India in 2001. He has been co-leading the development of the MANTIS operating system. He has co-authored three papers include MAC layer protocol design, energy-efficient wireless communication, and adapting communications to mobility. Dirk Grunwald received his Ph.D. from the University of Illinois in 1989 and joined the University of Colorado the same year. His work addresses research and teaching in the broad area of “computer systems”, which includes computer architecture, operating systems, networks, and storage systems. His interests also include issues in pervasive computing, novel computing models, and enjoying the mountains. He is currently an Associate Professor in the Department of Computer Science and in Electrical and Computer Engineering and is also the Director of the Colorado Center for Information Storage. John Bennett is a Professor of Computer Science with a joint appointment in Electrical and Computer Engineering at the University of Colorado at Boulder. He also serves as Associate Dean for Education in the College of Engineering and Applied Science. He joined the CU-Boulder faculty in 2000, after serving on the faculty of Rice University for 11 years. While at Rice, Bennett pioneered a course in engineering design for both engineering and non-engineering students that has been emulated at several universities and high schools. In addition to other teaching awards, Bennett received the Keck Foundation National Award for Engineering Teaching Excellence for his work on this course. Bennett received his Ph.D. in 1988 from the University of Washington. Prior to completing his doctoral studies, he was a U.S. Naval Officer for several years and founded and served as President of Pacific Mountain Research, Inc., where he supervised the design and development of a number of commercial computing systems. Bennett's primary research interests are broadly focused in the area of distributed systems, and more narrowly in distributed information management and distributed robotic macrosensors.     

Bandwidth allocation algorithms for weighted maximum rate constrained link sharing policy

This paper addresses the problem of bandwidth allocation under the weighted maximum rate constrained link sharing policy and proves a key theory in the condition of allocation termination. We propose several algorithms with various worst-case and average-case time complexities, and evaluate their computation elapse times.     

Intelligent scheduling with tabu search: An application to jobs with linear delay penalties and sequence-dependent setup costs and times

In this article we study thetabu search (TS) method in an application for solving an important class of scheduling problems. Tabu search is characterized by integrating artificial intelligence and optimization principles, with particular emphasis on exploiting flexible memory structures, to yield a highly effective solution procedure. We first discuss the problem of minimizing the sum of the setup costs and linear delay penalties when N jobs, arriving at time zero, are to be scheduled for sequential processing on a continuously available machine. A prototype TS method is developed for this problem using the common approach of exchanging the position of two jobs to transform one schedule into another. A more powerful method is then developed that employs insert moves in combination with swap moves to search the solution space. This method and the best parameters found for it during the preliminary experimentation with the prototype procedure are used to obtain solutions to a more complex problem that considers setup times in addition to setup costs. In this case, our procedure succeeded in finding optimal solutions to all problems for which these solutions are known and a better solution to a larger problem for which optimizing procedures exceeded a specified time limit (branch and bound) or reached a memory overflow (branch and bound/dynamic programming) before normal termination. These experiments confirm not only the effectiveness but also the robustness of the TS method, in terms of the solution quality obtained with a common set of parameter choices for two related but different problems.     

Service life planning and performance requirements

Service life planning comprises a model for the determination of a reasonable expected service life for buildings and components, and it establishes a routine for the assessment of design alternatives. A design option is considered reasonable when it meets or exceeds performance requirements over time that have been drawn up specifically for the specific project. Due to this assessment reference, there is a very evident link to the concept of performance-based building. Any stakeholder involved in the value chain or in the design process of the building, as well as regulators and building users, can express performance requirements. Identified requirements, both in relevance and in quality, will vary with the stakeholder and his/her perspective of interest. As building sector manufacturers develop most products with reference to standards rather than with reference to specific requirements, there is no direct link from user requirements to the product design. Instead, the building designer has the responsibility to ensure performance requirements are met by the performance of products integrated into the design. As these design decisions also have to be made at the material and component level, a performance-based building would benefit from an established rationale that enables the communication of performance requirements across the relevant system levels in the relevant design processes. A path for the connection of the established concepts of service life planning and performance-based building is presented. The aim is to identify key elements that need to be developed for the successful linkage of performance-based building with service life planning.