从“质量—价格—服务”向“服务—价格—质量”转变

概述了PCB企业经营理念的转变,即由“质量-价格-服务”到“服务-价格-质量”的理念更新。

海尔电脑获“质量服务双满意”大奖

日前．在国家电子计算机外部设备质量监督检验中心、浙江省商贸信息网、浙江日报社联合开展的“质量服务双满意电脑产品”宣传活动中．海尔电脑被评为“质量服务双满意电脑产品”。这是消费者对海尔电脑的再次充分肯定，同时也显示了海尔电脑在消费者心目中极高的美誉度。

汇聚品牌力量 共推双优承诺——电动自行车下乡“质量+服务”双承诺峰会将举行

第28届中国江苏国际自行车、电动车及零部件交易会招展工作已经接近尾声（以下简称＂南京展＂）,预定展台与去年同期相比已超过30%之多。为顺应电动自行车下乡这一惠民政策给电动自行车行业带来的利好局面，

基于服务包的服务管理竞争行为分析

企业通过服务差异化来塑造竞争优势。本文主要阐述服务包的重要概念,深度剖析企业竞争行为的属性及特点,并通过”质量可靠性-服务个性化”矩阵来探讨企业竞争行为战略的决策方法。

Web services composition with QoS bound based on simulated annealing algorithm

In order to enable quality-aware web services selection in the process of service composition,this paper first describes the non-functional requirements of service consumers and the quality of elementary service or composite service as a quality vector,and then models the QoS（quality of service）-aware composition as a multiple criteria optimization problem in extending directed graph.A novel simulated annealing algorithm for QoS-aware web services composition is presented.A normalizing for composite service QoS values is made,and a secondary iterative optimization is used in the algorithm.Experimental results show that the simulated annealing algorithm can satisfy the multiple criteria and global QoS requirements of service consumers.The algorithm produces near optimum solution with much less computation cost.

MULTI-CLASS TRAFFIC QOS ROUTING FOR LEO SATELLITE NETWORKS

Due to the diversified demands of quality of service（QoS） in volume multimedia application, QoS routings for multiservice are becoming a research hotspot in low earth orbit（LEO） satellite networks. A novel QoS satellite routing algorithm for multi-class traffic is proposed. The goal of the routing algorithm is to provide the distinct QoS for different traffic classes and improve the utilization of network resources. Traffic is classified into three classes and allocated priorities based on their QoS requirements, respectively. A priority queuing mechanism guarantees the algorithm to work better for high-priority classes. In order to control the congestion, a blocking probability analysis model is built up based on the Markov process theory. Finally, according to the classification link-cost metrics, routings for different classes are calculated with the distinct QoS requirments and the status of network resource. Simulations verify the performance of the routing algorithm at different time and in different regions, and results demonstrate that the algorithm has great advantages in terms of the average delay and the blocking probability. Meanwhile, the robustness issue is also discussed.

QoS-based MAC protocol for cognitive radio networks

In order to improve the throughput performance of the secondary users （SUs） in the cognitive radio （CR） environment, a quality of service （QoS） based media access control （MAC） protocol is proposed. In this protocol, the CR node maps the channel state as a vector, and the transmitter and the receiver obtain the final channel map through an AND operation to prepare for an optional channel set. Data from the upper application layer are classified into two priority levels according to the QoS requirement. The data of each level relate to different contention windows so that the priority of real time data can be guaranteed. A two-dimensional discrete-time Markov chain is utilized to evaluate the system performance, and mathematical expressions of the system throughput are derived. Simulation results show that compared with the IEEE 802. 11 distributed coordination function （DCF）, the proposed MAC protocol can achieve higher throughput.

SI-INSPIRED ENERGY AWARE QoS ROUTING TREE FOR WSN

A heuristic theoretical optimal routing algorithm （TORA） is presented to achieve the data-gathering structure of location-aided quality of service （QoS） in wireless sensor networks （WSNs）. The construction of TORA is based on a kind of swarm intelligence （SI） mechanism, i. e. , ant colony optimization. Firstly, the ener- gy-efficient weight is designed based on flow distribution to divide WSNs into different functional regions, so the routing selection can self-adapt asymmetric power configurations with lower latency. Then, the designs of the novel heuristic factor and the pheromone updating rule can endow ant-like agents with the ability of detecting the local networks energy status and approaching the theoretical optimal tree, thus improving the adaptability and en- ergy-efficiency in route building. Simulation results show that compared with some classic routing algorithms, TORA can further minimize the total communication energy cost and enhance the QoS performance with low-de- lay effect under the data-gathering condition.

Admission Control Based on QoS for Third Generation Broadband Mobile Communication Systems

In this paper, a novel admission scheme is proposed which provides high degrees of quality of service (QoS) guarantees for multimedia traffic carried in mobile networks. The proposed scheme combines the admission control and bandwidth reservation to guarantee QoS requirements. It considers both local information and remote information to determine whether to accept or reject a connection. In order to embody the characteristics of the algorithms proposed in the article, two traditional algorithms of admission control are used for comparison. In the end of the paper the simulation analyses are given and the results show that the proposed algorithm can adjust the bandwidth according to the current status of networks and decrease the probability of connections forcibly dropped. The most important thing is that the algorithm is based on the multimedia communications and can guarantee the QoS of real time connections through decreasing the bandwidth of non real time connections.

Modeling and performance evaluation of QoS-aware job scheduling of computational grids

To achieve high quality of service （QoS） on computational grids, the QoS-aware job scheduling is investigated for a hierarchical decentralized grid architecture that consists of multilevel schedulers. An integrated QoS-aware job dispatching policy is proposed, which correlates priorities of incoming jobs used for job selecting at the local scheduler of the grid node with the job dispatching policies at the global scheduler for computational grids. The stochastic high-level Petri net （SHLPN） model of a two-level hierarchy computational grid architecture is presented, and a model refinement is made to reduce the complexity of the model solution. A performance analysis technique based on the SHLPN is proposed to investigate the QoS-aware job scheduling policy. Numerical results show that the QoS-aware job dispatching policy outperforms the QoS-unaware job dispatching policy in balancing the high-priority jobs, and thus enables priority-based QoS.

Multi-attribute group decision making algorithm for web services selection based on QoS

To address the problem of web services selection based on quality, an approach of multi-attribute group decision making algorithm is proposed. Based on the Borda social choice function, the group decision making algorithm aggregates the results of multiple methods with different principles which are used to obtain constantly changing quality of service, thus increasing the confidence to select the most appropriate web service for a special task. The experimental results indicate that the proposed approach has better scalability and can be applied to large-scale distributed service computing environments. It is also shown that the proposed group decision making approach can effectively optimize the services selection and outperforms the random and robin policies. By using this approach, it can extend a method to obtain constantly changing quality of service and construct a synthetic information entity with multi-level knowledge, which guarantees the accuracy of services selection.

Approach of service recovery decision-making based on Bellman dynamic programming

Based on service-oriented architecture（SOA）,a Bellman-dynamic-programming-based approach of service recovery decision-making is proposed to make valid recovery decisions.Both the attribute and the process of services in the controllable distributed information system are analyzed as the preparatory work.Using the idea of service composition as a reference,the approach translates the recovery decision-making into a planning problem regarding artificial intelligence （AI） through two steps.The first is the self-organization based on a logical view of the network,and the second is the definition of evaluation standards.Applying Bellman dynamic programming to solve the planning problem,the approach offers timely emergency response and optimal recovery source selection,meeting multiple QoS （quality of service）requirements.Experimental results demonstrate the rationality and optimality of the approach,and the theoretical analysis of its computational complexity and the comparison with conventional methods exhibit its high efficiency.

Exploratory study of logistics service quality scale based on online shopping malls

Online shopping has already become the new mode that a lot of customers try to adopt. At the same time, the online shopping could not be successfully completed without logistics service. Logistics service quality (LSQ) has significant impact on revenue and profitability. This paper presents the issue from the perspective of the customer, and explores the initial factors of LSQ based on the online shopping through in-depth interview and the Delphi method. The survey uses a standard 7-point Likert-type scale to measure the LSQ. Empirical research results are shown in detail to confirm seven LSQ dimensions with Chinese characteristics, including timeliness quality, personal contact quality, order quality, order discrepancy handling, order condition and convenience. Statistical analyses of the investigation were conducted to test the reliability and validity of the LSQ evaluation model.

A Distributed Optimal Scheme Based on Local QoS for Web Service Composition

The goal of web service composition is to choose an optimal scheme according to Quantity of Service （QoS） which selects instances in a distributed network. The networks are clustered with some web services such as ontologies, algorithms and rule engines with similar function and interfaces. In this scheme, web services acted as candidate service construct a distributed model which can＇t obtain the global services＇ information. The model is utilized to choose instances according to local QoS information in the progress of service composition. Some QoS matrixes are used to record and compare the instance paths and then choose a better one. Simulation result has proven that our ~pproach has a tradeoff between efficiency and ~quality.

Frame length optimization for multi-antenna downlink systems based on delay-bound violation probability constraints

A flame length optimization scheme is proposed for multi-antenna downlink systems to guarantee diverse delay- bound violation probability constraints. Due to the difficulties of extracting the quality of service （QoS） metrics from the conventional physical-layer channel models, the link-layer models named effective bandwidth and effective capacity are applied to statistically characterize the source traffic patterns and the queuing service dynamics. With these link-layer models, the source traffic process and the channel service process are mapped to certain QoS parameters. The packet delay-bound violation probability constraints are converted into minimum data rate constraints and the optimization problem is thus formulated into simultaneous inequalities. With the assumption of ergodic block-fading channels, the optimal frame lengths of single-user and multiuser systems are calculated respectively by numerical iterative methods. Theoretical analyses and simulation results show that the given delay-bound violation probability constraints are well satisfied with the optimal frame length.

MANAGING HUMAN RESOURCES FOR RETAIL SERVICE QUALITY

This study examines the management of service qua lity in fashion retail operation. The human resources processes leading to external service quality are consolidated into a quality management framework. With reference to the framework, the factors, their importance and relationships within each process are established by the responses of practicing salespersons. A clear picture of the underlying management mechanisms leading to strong sales forces and service quality are produced. Retail management is required to better establish and manage the human resource.

An Improved Genetic Algorithm for Allocation Optimization of Distribution Centers

This paper introduced an integrated allocation model for distribution centers (DCs). The facility cost, inventory cost, transportation cost and service quality were considered in the model. An improved genetic algorithm (IGA) was proposed to solve the problem. The improvement of IGA is based on the idea of adjusting crossover probability and mutation probability. The IGA is supplied by heuristic rules too. The simulation results show that the IGA is better than the standard GA(SGA) in search efficiency and equality.

An approach for QoS measurement and web service selection sureness

Web services have gained popularity m recent years anu prowue a new moue, u~ w^u, w,,,~,, ,^- cilitates interaction of scientific and business applications through the Internet. More often, several services with similar functionality are available from a large and changing number of service provid- ers. Quality of Service （QoS） is the dominant factor in service selection and is of great importance to users. In this paper, we propose a model for QoS measurement and web services selection. The model consists of QoS model, QoS monitoring, QoS comparison and service selection with a QoS feedback mechanism. The most suitable service is to take into account the agreed QoS, monitoring is done during invocation phase and if any deviation is recorded, next suitable service is selected. Fi- nally the model is proved to be feasible and effective by simulation experiments.

A FAST SEAMLESS HANDOVER SCHEME AND ITS CDT OPTIMIZATION FOR PING-PONG TYPE OF MOVEMENT

In mobile IPv6 networks, the ping-pong type of movement brings about frequent handovers and thus increases signaling burden. This letter proposes a fast seamless handover scheme where the access router keeps the mobile node's old reservation till the offline Count Down Timer (CDT) expires in order to reduce handover signaling and delay while the mobile node returns in a very short period of time. Based upon a pois son mobility model, an simple expression for CDT optimization is given out for the scheme to achieve the best cost performance of resource reservation.

HiQoS:An SDN-Based Multipath QoS Solution

Today's Internet architecture provides only "best effort" services,thus it cannot guarantee quality of service(QoS) for applications.Software Defined Network(SDN)is a new approach to computer networking that separates control plane and forwarding planes,and has the advantage of centralized control and programmability.In this paper,we propose HiQoS that provides QoS guarantees using SDN.Moreover,HiQoS makes use of multiple paths between source and destination and queuing mechanisms to guarantee QoS for different types of traffic.Experimental results show that our HiQoS scheme can reduce delay and increase throughput to guarantee QoS.Very importantly,HiQoS recovers from link failure very quickly by rerouting traffic from failed path to other available path.