Time allocation scheme in IEEE 802.15.3 TDMA mechanism

In network with a shared channel in TDMA mechanism, it is a core issue to effectively allocate channel time to provide service guarantees for flows with QoS requirements. This paper proposes a simple and efficient time allocation scheme called MES-ESRPT (MCTA at the End of Superframe-Enhanced Shortest Remaining Processing Time) for delay-sensitive VBR traffic in accordance with IEEE 802.15.3 standard. In this algorithm, PNC (piconet coordinator) allocates one MCTA (Management Channel Time Allocation) for each stream which is the process of communication at the end of superframe. During the MCTA period, each transmitter should report current fragments number of the first MSDU (MAC Service Data Unit) and the fragments number of the remainder MSDUs to PNC. In the next superframe, PNC firstly allocates part CTAs (Channel Time Allocation) for each stream based on the remainder fragments number of the first MSDU by SRPT rule, then allocates remainder CTAs for each stream based on all fragments number of remainder MSDUs by the same SRPT rule. Simulation results showed that our proposed MES-ESRPT method achieves significantly better performance in QoS for multimedia streams compared to the existing schemes.     

Adaptive service configuration approach for quality of service management in ubiquitous computing environments

Mobility and resource-limitedness pose challenging issues to service configuration for quality of service （QoS） management in ubiquitous computing environments. Previous configuration approaches, such as static resource reservation, dynamic resource allocation and single service composition are not valid in the environments. In this study, we present an adaptive service configuration approach. Firstly, we reduce the dynamic configuration process to a control model which aims to achieve the variation of critical QoS on minimal level with less resource cost. Secondly, to deal with different QoS variations, we design two configuration strategies--service chain reconfiguration and QoS parameter adjustment--and implement them based on fuzzy logic control theory. Finally, a configuration algorithm is developed to flexibly employ the two configuration strategies in tune with the error of critical QoS in configuration process. The results of simulation experiments suggest that our approach outperforms existing configuration approaches in both QoS improvement and resource utilization.     

A cross-layer design approach on spectrum allocation and resource scheduling in cognitive PMP networks

We propose the spectrum allocation and resource scheduling algorithms in cognitive point to multipoint （PMP） networks with rapid changes of spectrum opportunities and present a media access control （MAC） protocol based on these algorithms. The objective of spectrum allocation is to make efficient use of the spectrum while maintaining the transceiver synchronization on frequency and time in the network. The objective of resource scheduling is to guarantee the quality of service （QoS） requirements of different kinds of connections and to minimize the total energy consumption in the network as well. By sensing only a small set of possible channels in each slot based on the state transition probability of each channel, our spectrum allocation algorithm achieves high spectrum efficiency in the network. The resource scheduling problem is divided into three sub problems and we derive optimal solutions to these problems by greedy algorithm and convex optimization. The simulation results show that our algorithm can make efficient use of the spectrum and the network resources at a cost of low computational complexity.     

Unequal decoding power allocation for efficient video transmission

We present an unequal decoding power allocation （UDPA） approach for minimization of the receiver power consumption subject to a given quality of service （QoS）, by exploiting data partitioning and turbo decoding. We assign unequal decoding power of forward error correction （FEC） to data partitions with different priority by jointly considering the source coding, channel coding and receiver power consumption. The proposed scheme is applied to H.264 video over additive white Gaussion noise （AWGN） channel, and achieves excellent tradeoff between video delivery quality and power consumption, and yields significant power saving compared with the conventional equal decoding power allocation （EDPA） approach in wireless video transmission.     

Weighted time-based global hierarchical path planning in dynamic environment

A weighted time-based global hierarchical path planning method is proposed to obtain the global optimal path from the starting point to the destination with time optimal control. First, the grid- or graph-based modeling is performed and the environment is divided into a set of grids or nodes. Then two time-based features of time interval and time cost are presented. The time intervals for each grid are built, during each interval the condition of the grid remains stable, and a time cost of passing through the grid is defined and assigned to each interval. Furthermore, the weight is introduced for taking both time and distance into consideration, and thus a sequence ofmultiscale paths with total time cost can be achieved. Experimental results show that the proposed method can handle the complex dynamic environment, obtain the global time optimal path and has the potential to be applied to the autonomous robot naviga- tion and traffic environment.     

Extending attributes page: a scheme for enhancing the reliability of storage system metadata

In an object-based storage system, a novel scheme named EAP （extending attributes page） is presented to enhance the metadata reliability of the system by adding the user object file information attributes page for each user object and storing the file-related attributes of each user object in object-based storage devices. The EAP scheme requires no additional hardware equipments compared to a general method which uses backup metadata servers to improve the metadata reliability. Leveraging a Markov chain, this paper compares the metadata reliability of the system using the EAP scheme with that using only metadata servers to offer the file metadata service. Our results demonstrate that the EAP scheme can dramatically enhance the reliability of storage system metadata.     

Research on fast real-time adaptive audio mixing in multimedia conference

INTRODUCTION As one of the main applications in Packet-based network (PBN) environment, multimedia communi-cation is developing rapidly, with many service pro-viders starting to offer new services. Audio interactive operation is one of the most basic components in multimedia conference. Because of absence of QoS mechanism in most application environments of PBN, network blocking will cause problems such as data loss and audio jitter in end-to-end communication (Yang et al., 2001). Th…     

Quality of service estimation based on maximum bottleneck algorithm for domain aggregation in backbone networks

This paper investigates the routing among autonomous systems (ASs) with quality of service (QoS) requirements. To avoid the intractability of the problem, abstract QoS capability must be informed among ASs, because the routhing which constrained QoS has been proved to be nondeterministic polynomial-time (NP) hard even inside an AS. This paper employs the modified Dijkstra algorithm to compute the maximum bottleneck bandwidth inside an AS. This approach lays a basis for the AS-level switching capability on which interdomain advertisement can be performed. Furthermore, the paper models the aggregated traffic in backbone network with fractional Brownian motion (FBM), and by integrating along the time axis in short intervals, a good estimation of the distribution of queue length in the next short intervals can be obtained. The proposed advertisement mechanism can be easily implemented with the current interdomain routing protocols. Numerical study indicates that the presented scheme is effective and feasible.     

Simulation of Airblast Load and Its Effect on RC Structures

In the analysis of a structure subjected to an explosion event, the determination of the blast load constitutes a crucial step. The effect of the blast load on the structure depends not only on the peak shock overpressure, but also the impulse (hence the duration). For structures with a regular geometry, the blast load may be fairly well estimated using appropriate empirical formulae; however, for more complex situations, a direct simulation using appropriate computational techniques is necessary. This paper presents a numerical simulation study on the prediction of the blast load in free air using a hydrocode, with focus on the sensitivity of the simulated blast load to the mesh grid size. The simulation results are compared with empirical predictions. It is found that the simulated blast load is sensitive to the mesh size, especially in the close-in range, and with a practically affordable mesh grid density, the blast load tends to be systematically underestimated. The study is extended to internal blast cases. An example concrete slab under internal explosion is analyzed using a coupled analysis scheme. The internal blast load from the simulation is examined and the response of the RC slab is commented.     

QoS指导下的网格资源选择方法

在高性能并行分布式网格计算环境下,计算节点具有动态、异构、分布和多管理域特性,这使得网格资源的发现及管理变得比较困难。在对网格调度模型分析的基础上,使用模糊聚类的相关理论提出在任务调度之前对资源进行预处理,依据用户QoS需求权重对机器性能进行聚类,得到和用户QoS需求最匹配的较优资源子集。这样既合理地减少了映射的目标资源,又实现了目标资源子集与用户QoS需求的最优匹配。在一定程度上提高了整个系统的性能,满足了不同用户的特殊需求。     

Interactive Web service choice-making based on extended QoS model

INTRODUCTION Web service technologies are immerging as a powerful vehicle for organizations that participate in Web based dynamic collaborations. An organization can publish its business processes as Web services to the Internet for potential customers to discover and use them. Compared with traditional fixed inter-orga- nization collaboration relationship, the Web-based dynamic collaboration brings service providers more customers and more profits, and enables consumers to search in a w…     

基于公平性和QoS保障的OFDMA-WLAN系统资源分配(英文)

为了满足OFDMA-WLAN系统下行通信中多用户的不同业务需求,提出一种基于公平性和QoS服务保障的资源分配算法.不同的QoS要求被转换成不同的速率要求来计算QoS满意等级;优化目标被修改为公平性驱动的优化函数以提供公平性保障;复杂的资源分配问题被划分为信道分配和功率分配问题,并通过二分图匹配和注水法得到分配结果.与其他算法相比,所提出的算法牺牲了较少的数据速率换取更高的公平性和QoS满意度.仿真结果表明所提算法具有保障QoS和公平性的能力,且在QoS、公平性和速率之间权衡折中时表现更好.     

基于UDDI分类架构实现Web服务的QoS

服务质量(QoS)描述了服务满足消费者需求的能力,提供有保证的QoS是Web服务在商业应用中获得成功的关键。本文利用UDDI的外部分类架构,建立了描述Web服务QoS的一组分类tModel,并给出了服务提供者QoS指标的量化定理和Web服务QoS的实现过程。该方法不改变UDDI内部结构,能更好地与Web服务标准协议兼容,并易于实现。     

基于网格的支持合预约与合分配的Globus体系结构研究

提出了一个Globus提前预约与分配的体系结构(即GARA)，一个由应用程序、合预约代理和合分配代理、资源分配管理器(即GRAM)、资源层四层构成的体系结构，使用目录服务访问协议(LDAP)来实现资源信息服务，最后在UNIX环境下运行了GARA模型。     

毕节Web服务发现技术研究

传统的Web(网络)服务发现只是简单的基于关键字的匹配,查询得到的服务包含了大量用户需求以外的垃圾服务,导致搜索的用户体验很差等问题。以毕节网络服务环境作为背景,从用户的QoS(服务质量)需求出发,提出一种面向QoS评估的Web服务发现模型。引入用户评价机制,通过服务请求者反馈QoS信息的方式来监督服务提供者所提供的服务可信度,同时,服务提供者也可利用反馈的QoS信息来改进Web服务的服务质量。     

基于DiffServ的UMTS端到端QoS保证机制研究

3G多媒体业务的发展给UMTS的QoS保证机制提出更高的要求.从QoS需求出发,描述了无线接入网的网络结构以及3G核心网的承载业务类型,分析了网络组件、业务类型与协议栈之间的对应关系,讨论了UMTS QoS管理机制在各组件中的功能实现,引入因特网的区分服务模型在核心网中构建基于DiffServ的网络模型为不同业务提供QoS保证,最后指出UMTS端到端QoS机制有待发展的研究方向.