Home About us Contact
|
Home About us Contact | ||
|
|
||
QoS
Kinds of QoS Terms modified by QoS Selected AbstractsA large-scale monitoring and measurement campaign for web services-based applicationsCONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE, Issue 10 2010Riadh Ben Halima Abstract Web Services (WS) can be considered as the most influent enabling technology for the next generation of web applications. WS-based application providers will face challenging features related to nonfunctional properties in general and to performance and QoS in particular. Moreover, WS-based developers have to provide solutions to extend such applications with self-healing (SH) mechanisms as required for autonomic computing to face the complexity of interactions and to improve availability. Such solutions should be applicable when the components implementing SH mechanisms are deployed on both or only one platform on the WS providers and requesters sides depending on the deployment constraints. Associating application-specific performance requirements and monitoring-specific constraints will lead to complex configurations where fine tuning is needed to provide SH solutions. To contribute to enhancing the design and the assessment of such solutions for WS technology, we designed and implemented a monitoring and measurement framework, which is part of a larger Self-Healing Architectures (SHA) developed during the European WS-DIAMOND project. We implemented the Conference Management System (CMS), a real WS-based complex application. We achieved a large-scale experimentation campaign by deploying CMS on top of SHA on the French grid Grid5000. We experienced the problem as if we were a service provider who has to tune reconfiguration strategies. Our results are available on the web in a structured database for external use by the WS community. Copyright © 2010 John Wiley & Sons, Ltd. [source] A formalized approach for designing a P2P-based dynamic load balancing schemeCONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE, Issue 10 2010Hengheng Xie Abstract Quality of service (QoS) is attracting more and more attention in many areas, including entertainment, emergency services, transaction services, and so on. Therefore, the study of QoS-aware systems is becoming an important research topic in the area of distributed systems. In terms of load balancing, most of the existing QoS-related load balancing algorithms focus on Routing Mechanism and Traffic Engineering. However, research on QoS-aware task scheduling and service migration is very limited. In this paper, we propose a task scheduling algorithm using dynamic QoS properties, and we develop a Genetic Algorithm-based Services Migration scheme aiming to optimize the performance of our proposed QoS-aware distributed service-based system. In order to verify the efficiency of our scheme, we implement a prototype of our algorithm using a P2P-based JXTA technique, and do an emulation test and a simulation test in order to analyze our proposed solution. We compare our service-migration-based algorithm with non-migration and non-load-balancing approaches, and find that our solution is much better than the other two in terms of QoS success rate. Furthermore, in order to provide more solid proofs of our research, we use DEVS to validate our system design. Copyright © 2010 John Wiley & Sons, Ltd. [source] Service selection and workflow mapping for Grids: an approach exploiting quality-of-service informationCONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE, Issue 6 2009Dimosthenis Kyriazis Abstract The advent of heterogeneous and distributed environments, such as Grid environments, made feasible the solution to computational-intensive problems in a reliable and cost-effective manner. In parallel, workflows with increased complexity that require specialized systems to deal with them are emerging, so as to carry out more composite and mission-critical applications. In that rationale, quality-of-service (QoS) issues need to be tackled in order to ensure that each application satisfies the corresponding user requirements. Therefore, considering the quality provision aspect as fundamental for enabling Grid applications to become QoS compliant, we present an approach for service selection using QoS criteria. The latter is achieved with a suite of components that allow the different mappings of application workflow processes to Grid services that not only meet the user goals and requirements but also maximize his/her benefit in terms of the offered QoS level. We also demonstrate the operation of the aforementioned suite of components and evaluate its performance and effectiveness using a Grid scenario, based on a 3D image rendering application. Copyright © 2008 John Wiley & Sons, Ltd. [source] Specification, planning, and execution of QoS-aware Grid workflows within the Amadeus environmentCONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE, Issue 4 2008Ivona Brandic Abstract Commonly, at a high level of abstraction Grid applications are specified based on the workflow paradigm. However, majority of Grid workflow systems either do not support Quality of Service (QoS), or provide only partial QoS support for certain phases of the workflow lifecycle. In this paper we present Amadeus, which is a holistic service-oriented environment for QoS-aware Grid workflows. Amadeus considers user requirements, in terms of QoS constraints, during workflow specification, planning, and execution. Within the Amadeus environment workflows and the associated QoS constraints are specified at a high level using an intuitive graphical notation. A distinguishing feature of our system is the support of a comprehensive set of QoS requirements, which considers in addition to performance and economical aspects also legal and security aspects. A set of QoS-aware service-oriented components is provided for workflow planning to support automatic constraint-based service negotiation and workflow optimization. For improving the efficiency of workflow planning we introduce a QoS-aware workflow reduction technique. Furthermore, we present our static and dynamic planning strategies for workflow execution in accordance with user-specified requirements. For each phase of the workflow lifecycle we experimentally evaluate the corresponding Amadeus components. Copyright © 2007 John Wiley & Sons, Ltd. [source] Threshold-based admission control for a multimedia Grid: analysis and performance evaluationCONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE, Issue 14 2006Yang Zhang Abstract In a Grid-based services system facing a large number of requests with different services and profits significance, there is always a trade-off between the system profits and the Quality of Service (QoS). In such systems, admission control plays an important role: the system has to employ a proper strategy to make admission control decisions and reserve resources for the coming requests thus to achieve greater profits without violating the QoS of the requests already admitted. In this paper, we introduce three essential admission control strategies with threshold on resource reservation and a newly proposed strategy with layered threshold. Through comprehensive theoretical analyses and extensive simulations, we demonstrate that the strategy with layered threshold is more efficient and flexible than the existing strategies for Grid-based multimedia services systems. Copyright © 2006 John Wiley & Sons, Ltd. [source] HLA real-time extensionCONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE, Issue 15 2004Hui Zhao Abstract The IEEE 1516 Standard ,High Level Architecture (HLA)' and its implementation ,Run-Time Infra-structure (RTI)' defines a general-purpose network communication mechanism for Distributed Interactive Simulation (DIS). However, it does not address real-time requirements of DIS. Current operating system technologies can provide real-time processing through some real-time operating systems (RTOSs) and the Internet is also moving to an age of Quality of Service (QoS), providing delay and jitter bounded services. With the availability of RTOSs and IP QoS, it is possible for HLA to be extended to take advantage of these technologies in order to construct an architecture for Real-Time DIS (RT-DIS). This extension will be a critical aspect of applications in virtual medicine, distributed virtual environments, weapon simulation, aerospace simulation and others. This paper outlines the current real-time technology with respect to operating systems and at the network infrastructure level. After summarizing the requirements and our experiences with RT-DIS, we present a proposal for HLA real-time extension and architecture for real-time RTI. Similar to the growth of real-time CORBA (Common Object Request Broker) after the mature based CORBA standard suite, Real-Time HLA is a natural extension following the standardization of HLA into IEEE 1516 in September 2000. Copyright © 2004 John Wiley & Sons, Ltd. [source] An approach for quality of service adaptation in service-oriented GridsCONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE, Issue 5 2004Rashid Al-Ali Abstract Some applications utilizing Grid computing infrastructure require the simultaneous allocation of resources, such as compute servers, networks, memory, disk storage and other specialized resources. Collaborative working and visualization is one example of such applications. In this context, quality of service (QoS) is related to Grid services, and not just to the network connecting these services. With the emerging interest in service-oriented Grids, resources may be advertised and traded as services based on a service level agreement (SLA). Such a SLA must include both general and technical specifications, including pricing policy and properties of the resources required to execute the service, to ensure QoS requirements are satisfied. An approach for QoS adaptation is presented to enable the dynamic adjustment of behavior of an application based on changes in the pre-defined SLA. The approach is particularly useful if workload or network traffic changes in unpredictable ways during an active session. Copyright © 2004 John Wiley & Sons, Ltd. [source] A quality-of-service-based framework for creating distributed heterogeneous software componentsCONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE, Issue 12 2002Rajeev R. Raje Abstract Component-based software development offers a promising solution for taming the complexity found in today's distributed applications. Today's and future distributed software systems will certainly require combining heterogeneous software components that are geographically dispersed. For the successful deployment of such a software system, it is necessary that its realization, based on assembling heterogeneous components, not only meets the functional requirements, but also satisfies the non-functional criteria such as the desired quality of service (QoS). In this paper, a framework based on the notions of a meta-component model, a generative domain model and QoS parameters is described. A formal specification based on two-level grammar is used to represent these notions in a tightly integrated way so that QoS becomes a part of the generative domain model. A simple case study is described in the context of this framework. Copyright © 2002 John Wiley & Sons, Ltd. [source] Novel DLC model for QoS enhancement of bursty VBR traffic in wireless ATM networksEUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, Issue 8 2008Hosam El-Ocla Several data-link control (DLC) protocol procedures have been proposed in order to provide reliable data transmission over powerless radio links. However, many quality of service (QoS) issues still need to be achieved such as balance between cell transfer delay (CTD) and cell loss rate (CLR), absence of cell delay variation (CDV) and network traffic utilisation. The main problem with wireless ATM is how to overcome the unreliability of the wireless link in order to maintain QoS requirements especially for variable bit rate (VBR) application. Here, we propose a model that provides QoS support for ATM virtual connections (VC) and solves the unreliability problem of the wireless ATM through an efficient DLC protocol for bursty VBR traffic. This model mainly concerns with enhancing QoS to gain error-free wireless transmission and regulating VBR Traffic. Copyright © 2008 John Wiley & Sons, Ltd. [source] IntServ6: an approach to support QoS over IPv6 wired and wireless networksEUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, Issue 6 2008Jhon J. Padilla In this paper we propose a new approach for Quality of Service (QoS) support on Internet. This approach, named IntServ6, is based on the Integrated Services Architecture (ISA). It takes advantage of the IPv6 header flow label field to improve a set of the standard ISA properties such as reservations within tunnels, flows aggregation and interconnection with MPLS transport networks. IntServ6 can be used for QoS support in IPv6 wired and wireless networks. This paper describes the IntServ6 operation and performance evaluation over both environments. Evaluation results show that this approach has a better router performance with respect to the standard IntServ. Thus, IntServ6 reduces the mean packet delay and reduces the packet delay dependence with the mobility. Copyright © 2007 John Wiley & Sons, Ltd. [source] Comparison between objective and subjective measurements of quality of service over an Optical Wide Area networkEUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, Issue 3 2008Francesco Matera The introduction of intelligence for management and control of the quality of service (QoS) are key issues for the evolution of the next generation IP optical network based on Ethernet technology. A test bed of a core-access network was implemented to investigate such issues and in this paper, the authors report measurements concerning the QoS of multimedia services for different traffic conditions. The network was implemented with a differentiated service over Multi-Protocol Label Switch (MPLS) architecture; it consists of a real optical network based on core routers with optical Gigabit Ethernet (GBE) interfaces connected by means of long single mode fibres (about 50\,km), contained in an installed cable between Rome and Pomezia. The network is based on different access devices, but in this paper we only refer to an access based on Fibre To The building (FTTB) architecture. The QoS was investigated both in terms of network (or objective) tests that include packet loss, jitter, one way delay and throughput measurements and perceptive (or subjective) tests that conversely are based on the evaluation of user perception. The services under test mainly consisted of video streams that circulated in the network according to the switching operations based in the IP differentiated service over MPLS technique that allowed us to guarantee the QoS for some class of service, also in the presence of network overload. Particular attention was given to the correlation between objective and subjective measurements. Furthermore, in order to have a complete analysis about QoS of real networks, measurements were performed also in the presence of restoration operations for link failures; in particular we compare the results in the case of conventional IP network restoration with a procedure proposed by us and based on a link switching activated by the loss of signal command coming from the routers. Copyright © 2007 John Wiley & Sons, Ltd. [source] CAC and routing for multi-service networks with blocked wide-band calls delayed, Part II: approximative link MDP frameworkEUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, Issue 1 2007Ernst Nordström In this paper, we study the call admission control (CAC) and routing issue in multi-service networks. Two categories of calls are considered: a narrow-band with blocked calls cleared and a wide-band with blocked calls delayed. The optimisation is subject to several quality of service (QoS) constraints, either on the packet or call level. The objective function is formulated as reward maximisation with penalty for delay. A suboptimal solution is achieved by applying Markov decision process (MDP) theory together with a three-level approximation. First, the network is decomposed into a set of links assumed to have independent Markov and reward processes respectively. Second, the dimensions of the link Markov and reward processes are reduced by aggregation of the call classes into call categories. Third, by applying decomposition of the link Markov process, the link MDP tasks are simplified considerably. The CAC and routing policy is computed by the policy iteration algorithm from MDP theory. The numerical results show that the proposed CAC and routing method, based on the approximate link MDP framework, is able to find an efficient trade-off between reward loss and average call set-up delay, outperforming conventional methods such as least loaded routing (LLR). Copyright © 2006 AEIT. [source] An adaptive min,max fair bandwidth allocation scheme for cellular multimedia networksEUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, Issue 5 2006Mohammad Mahfuzul Islam Depending on the flexibility in controlling the transmission rate and the differences between on-line (real time) and off-line transmission modes, multimedia applications can potentially include a wide range of services, with the traditional stringent quality-of-service (QoS) requirement at the extreme to the highly adaptive ones that can tolerate or smartly adapt to the transient fluctuations in the QoS parameters. Keeping the cellular multimedia networks efficient with low call dropping and blocking rates and high bandwidth utilisation while maintaining a fair distribution of bandwidth by synergistically addressing the differences among these services remains a significant challenge. This paper addresses this issue by developing a novel min,max fairness scheme where bandwidth is distributed with equal share only after ensuring the minimum requirements. Besides borrowing in-use bandwidth through redistribution, this scheme also allows for using the reserved bandwidth for the offline services. Simulation results confirm the superiority of this scheme against the rate-based borrowing and the max,min fairness schemes, the two most recent works addressing similar issues. Copyright © 2005 AEIT. [source] CAC and routing for multi-service networks with blocked wide-band calls delayed, part I: exact link MDP frameworkEUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, Issue 1 2006Ernst Nordström In this paper, we study the call admission control (CAC) and routing issue in multi-service networks. Two categories of calls are considered: a narrow-band (NB) with blocked calls cleared and a wide-band (WB) with blocked calls delayed. The objective function is formulated as reward maximisation with penalty for delay. The optimisation is subject to quality of service (QoS) constraints and, possibly, grade of service (GoS) constraints. A suboptimal solution is achieved by applying Markov decision process (MDP) theory together with a two-level approximation. First, the network is decomposed into a set of links assumed to have independent Markov and reward processes respectively. Second, the dimensions of the link Markov and reward processes are reduced by aggregation of the call classes into call categories. The CAC and routing policy is computed by the policy iteration algorithm from MDP theory. The numerical results show that the proposed CAC and routing method, based on the exact link MDP framework, is able to find an efficient trade-off between reward loss and average call set-up delay, outperforming conventional methods such as the least loaded routing (LLR). Copyright © 2005 AEIT. [source] End-to-end network delay model for heavy-tailed environmentsEUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, Issue 5 2003David Muñoz-Rodríguez Adequate quality of Internet Protocol (IP) services demand low transmission delays. However, packets traveling in a network are subject to a variety of delays that degrade severely the quality of service in real-time applications. This paper presents a general packet jitter-assessment methodology for a multi-node path in the presence of heavy-tailed traffic. Using the extreme-value theory, it is shown that delay performance is governed by a proposed networking-processing factor |T|lambda dependent on the traffic characteristics, the processing time along the path segments and the number of nodes in a route. |T|lambda allows the establishment of design constraints and the definition of a feasibility space for a routing algorithm in order to guarantee a quality of service (QoS). Copyright © 2003 AEI. [source] QoS in IntServ-based IP networks: the peak rate policingEUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, Issue 4 2003Lorenzo Battaglia In the last few years, IP has moved towards resource reservation, with the task to guarantee in the future Quality of Service (QoS). This has led to flow admission control algorithms based on the negotiation of standardised traffic parameters. QoS can be guaranteed in any network, a priori from the used technology, only if the used admission control algorithm wisely shares the network's resources among the users. Any admission control algorithm on its turn can do so, only if every user respects the negotiated traffic parameters. Since any user could, maliciously or not, send at a higher rate than negotiated, i.e. use a higher share of resources than the negotiated one, in every network in which admission control is performed, a policing algorithm is used. An ideal policer should guarantee to reject no packet of a well-behaved user and police contract violation as rigidly as possible. All this independently of the characteristics of the monitored stream and of the background traffic. This holds also for Integrated Services (IS) based IP networks. In these networks, every user negotiates a peak and an average rate. In this paper we present the solution to the peak rate policing issue. We adapt the Generic Cell Rate Algorithm (GCRA), well-known policer used in ATM networks, to police the peak rate of flows of packets with variable length. We intuitively call this modified GCRA Generic Packet Rate Algorithm (GPRA) and dimension its parameters so that independently of the characteristics of the policed flow and of the background traffic, no packets of a well-behaved user are rejected and that the flows of any misbehaving user are rigidly policed. Copyright © 2003 AEI. [source] TCP-friendly transmission of voice over IPEUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, Issue 3 2003F. Beritelli In the last few years an increasing amount of attention has been paid to technologies for the transmission of voice over IP (VoIP). At present, the UDP transport protocol is used to provide this service. However, when the same bottleneck link is shared with TCP flows, and in the presence of a high network load and congestion, UDP sources capture most of the bandwidth, strongly penalizing TCP sources. To solve this problem some congestion control should be introduced for UDP traffic as well, in such a way that this traffic becomes TCP-friendly. In this perspective, several TCP-friendly algorithms have been proposed in the literature. Among them, the most promising candidates for the immediate future are RAP and TFRC. However, although these algorithms were introduced to support real-time applications on the Internet, up to now the only target in optimizing them has been that of achieving fairness with TCP flows in the network. No attention has been paid to the applications using them, and in particular, to the quality of service (QoS) perceived by their users. The target of this paper is to analyze the problem of transmitting voice over IP when voice sources use one of these TCP-friendly algorithms. With this aim, a VoIP system architecture is introduced and the characteristics of each its elements are discussed. To optimize the system, a multirate voice encoder is used so as to be feasible to work over a TCP layer, and a modification of both RAP and TFRC is proposed. Finally, in order to analyze the performance of the proposed system architecture and to compare the modified RAP and TFRC with the original algorithms, the sources have been modeled with an arrival process modulated by a Markov chain, and the model has been used to generate traffic in a simulation study performed with the ns-2 network simulator. Copyright © 2003 AEI. [source] QoS-aware fair packet scheduling in IEEE 802.16 wireless mesh networksINTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 6-7 2010Yajun Li Abstract In this paper, we address the problem of heterogeneous quality-of-service (QoS) provisioning in IEEE 802.16-based wireless mesh networks. Our objective is to provide a novel service differentiation scheme based on distributed scheduling in the IEEE 802.16-based mesh mode, thereby offering QoS guarantees. We first devise a novel scheme for the traffic class differentiation, which can be implemented at the medium access control layer. We then present a QoS-aware fair packet scheduling (QFPS) algorithm to fulfill the QoS provisioning. With QFPS, a traffic flow with urgent QoS demand is guaranteed to be given priority in wireless resource allocation over those ones with mild QoS requirements. A shorter end-to-end delay is therefore expected to be offered for the traffic flows with time-urgent requirements. Moreover, we propose a new fairness model among different traffic flows traversing the same node. All traffic flows passing through a node are served by the Deficit Round-Robin scheduling algorithm to achieve fairness within the same priority group. The experimental results of the QFPS demonstrate that various traffic flows are provided with a differentiated service that offers QoS guarantees. Copyright © 2009 John Wiley & Sons, Ltd. [source] A terminal-controlled vertical handover decision scheme in IEEE 802.21-enabled heterogeneous wireless networksINTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 7 2009Jung-Shyr Wu Abstract The seamless internetworking among heterogeneous networks is in great demand to provide ,always-on' connectivity services with quality of service (QoS) provision, anywhere at anytime. The integration of wireless-fidelity (Wi-Fi) and wireless metropolitan area networks (WiMAX) networks can combine their best features to provide ubiquitous access, while mediating the weakness of both networks. While it is challenging to obtain optimized handover decision-based dynamic QoS information, users can improve their perceived QoS by using the terminal-controlled handover decision in a single device equipped with multiple radio interfaces. The IEEE 802.21 aims at providing a framework that defines media-independent handover (MIH) mechanism that supports seamless handover across heterogeneous networks. In this paper, an multiple attributes decision making-based terminal-controlled vertical handover decision scheme using MIH services is proposed in the integrated Wi-Fi and WiMAX networks to provide ,always-on' connectivity QoS services. The simulation results show that the proposed scheme provides smaller handover times and lower dropping rate than the RSS-based and cost function-based vertical handover schemes. Copyright © 2009 John Wiley & Sons, Ltd. [source] Expedited forwarding end-to-end delay and jitter in DiffServINTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 8 2008Hamada Alshaer Abstract The scheduling disciplines and active buffer management represent the main components employed in the differentiated services (DiffServ) data plane, which provide qualitative per-hop behaviors corresponding to the QoS required by supported traffic classes. In the first part of this paper, we compute the per-hop delay bound that should be guaranteed by the different multiservice scheduling disciplines, so that the end-to-end (e2e) delay required by expedited forwarding (EF) traffic can be guaranteed. Consequently, we derive the e2e delay bound of EF traffic served by priority queuing,weighted fair queuing (PQ,WFQ) at every hop along its routing path. Although real-time flows are principally offered EF service class, some simulations on DiffServ-enabled network show that these flows suffer from delay jitter and they are negatively impacted by lower priority traffic. In the second part of this paper, we clarify the passive impact of delay jitter on EF traffic, where EF flows are represented by renewal periodic ON,OFF flows, and the background (BG) flows are characterized by the Poisson process. We analyze through different scenarios the jitter effects of these BG flows on EF flow patterns when they are served by a single class scheduling discipline, such as first-input first-output, and a multiclass or multiservice scheduling discipline, such as static priority service discipline. As a result, we have found out that the EF per-hop behaviors (PHBs) configuration according to RFCs 2598 and 3246 (IETF RFC 2598, June 1999; RFC 3246, IETF, March 2002) cannot stand alone in guaranteeing the delay jitter required by EF flows. Therefore, playout buffers must be added to DiffServ-enabled networks for handling delay jitter problem that suffers from EF flows. Copyright © 2008 John Wiley & Sons, Ltd. [source] Design and evaluation of inter-bandwidth broker signalingINTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 8 2008Haci A. Mantar Abstract Bandwidth brokers (BBs) have been proposed for providing end-to-end quality of services (QoS) in differentiated services (Diffserv) networks. As a single entity in each domain, a BB aims at performing both intra- and inter-domain resource management on behalf of its domain. There have been plenty of BB studies for intra-domain resource management. However, how a BB can perform inter-domain resource management in a scalable and deployable manner is still an open issue. In this work, we present the design, implementation and evaluation of an inter-BB communication protocol that is used by each BB to communicate with its neighboring BBs for inter-domain QoS resource management. The proposed model uses a destination-based aggregation scheme in which reservations are aggregated as they merge through the destination region. The destination-based aggregation improves inter-domain state and signaling scalability. The protocol also performs traffic engineering to increase inter-domain resource utilization. The implementation and simulation results verify the achievements of our model. Copyright © 2008 John Wiley & Sons, Ltd. [source] Resource allocation for statistical quality of service provision in buffered crossbar switches,INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 6 2008Qiang Duan Abstract The buffered crossbar switch is a promising switching architecture that plays a crucial role for providing quality of service (QoS) in computer networks. Sufficient amount of resources,bandwidth and buffer space,must be allocated in buffered crossbar switches for QoS provision. Resource allocation based on deterministic QoS objectives might be too conservative in practical network operations. To improve resource utilization in buffered crossbar switches, we study the problem of resource allocation for statistical QoS provision in this paper. First, we develop a model and techniques for analyzing the probabilistic delay performance of buffered crossbar switches, which is described by the delay upper bound with a prescribed violation probability. Then, we determine the required amounts of bandwidth and buffer space to achieve the probabilistic delay objectives for different traffic classes in buffered crossbar switches. In our analysis, we apply the effective arrival envelope to specify traffic load in a statistical manner and characterize switch service capacity by using the service curve technique. Instead of just focusing on one specific type of scheduler, the model and techniques developed in this paper are very flexible and can be used for analyzing buffered crossbar switches with a wide variety of scheduling algorithms. Copyright © 2007 John Wiley & Sons, Ltd. [source] A network-centric approach for access and interface selection in heterogeneous wireless environmentsINTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 5 2008George Koundourakis Abstract In this paper, we introduce a network-based approach for access and interface selection (AIS) in the context of resource management in heterogeneous wireless environments (UMTS, WLAN and DVB-T). We focus on the optimization of resource utilization, while ensuring acceptable quality of service (QoS) provision to the end users. Our objective is to optimally manage the overall system resources and minimize the possibility of QoS handovers (non-mobility handovers). The adopted architecture applies to typical heterogeneous environments and network entities (Access Routers) are enhanced with extra functionalities. We propose an AIS algorithm that exploits the multihoming concept and globally manages network resources at both radio access and IP backbone networks. The algorithm can estimate near-optimal solutions in real time and we also introduce a novel triggering policy. We present simulation results of typical scenarios that demonstrate the advantages of our approach. System performance metrics, derived from the simulations, show minimum degradations in high load and congestion situations. Copyright © 2007 John Wiley & Sons, Ltd. [source] Online end-to-end quality of service monitoring for service level agreement managementINTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 4 2008Xiaoyuan Ta Abstract A major challenge in network and service level agreement (SLA) management is to provide Quality of Service (QoS) demanded by heterogeneous network applications. Online QoS monitoring plays an important role in the process by providing objective measurements that can be used for improving network design, troubleshooting and management. Online QoS monitoring becomes increasingly difficult and complex due to the rapid expansion of the Internet and the dramatic increase in the speed of network. Sampling techniques have been explored as a means to reduce the difficulty and complexity of measurement. In this paper, we investigate several major sampling techniques, i.e. systematic sampling, simple random sampling and stratified sampling. Performance analysis is conducted on these techniques. It is shown that stratified sampling with optimum allocation has the best performance. However, stratified sampling with optimum allocation requires additional statistics usually not available for real-time applications. An adaptive stratified sampling algorithm is proposed to solve the problem. Both theoretical analysis and simulation show that the proposed adaptive stratified sampling algorithm outperforms other sampling techniques and achieves a performance comparable to stratified sampling with optimum allocation. A QoS monitoring software using the aforementioned sampling techniques is designed and tested in various real networks. Copyright © 2007 John Wiley & Sons, Ltd. [source] Performance of delay-sensitive traffic in multi-layered satellite IP networks with on-board processing capabilityINTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 12 2007Suzan Bayhan Abstract In this article, performance of delay-sensitive traffic in multi-layered satellite Internet Protocol (IP) networks with on-board processing (OBP) capability is investigated. With OBP, a satellite can process the received data, and according to the nature of application, it can decide on the transmission properties. First, we present a concise overview of relevant aspects of satellite networks to delay-sensitive traffic and routing. Then, in order to improve the system performance for delay-sensitive traffic, specifically Voice over Internet Protocol (VoIP), a novel adaptive routing mechanism in two-layered satellite network considering the network's real-time information is introduced and evaluated. Adaptive Routing Protocol for Quality of Service (ARPQ) utilizes OBP and avoids congestion by distributing traffic load between medium-Earth orbit and low-Earth orbit layers. We utilize a prioritized queueing policy to satisfy quality-of-service (QoS) requirements of delay-sensitive applications while evading non-real-time traffic suffer low performance level. The simulation results verify that multi-layered satellite networks with OBP capabilities and QoS mechanisms are essential for feasibility of packet-based high-quality delay-sensitive services which are expected to be the vital components of next-generation communications networks. Copyright © 2007 John Wiley & Sons, Ltd. [source] A distributed adaptive guard channel reservation scheme for cellular networksINTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 9 2007H.K. Pati Abstract In this paper, a distributed adaptive guard channel reservation (DAGCR) scheme is proposed to give priority to handoff calls. This scheme is built upon the concept of guard channels and it uses an adaptive algorithm to search automatically the optimal number of guard channels to be reserved at each base station. The quality-of-service (QoS) parameters used are the new and handoff call blockings. Simulation studies are performed to compare the present algorithm with the static guard channel policy. Simulation results show that this proposed algorithm guarantees the handoff call blocking probability to remain below the targeted threshold up to a substantially high offered load with a minimal blocking to new calls up to a moderate offered load and also shows significantly high channel utilization in all offered load conditions. This scheme is examined over a wide range of offered load. Thus, it seems the proposed scheme is very useful in controlling the blocking performances in wireless cellular networks. Copyright © 2006 John Wiley & Sons, Ltd. [source] Neural bandwidth allocation function (NBAF) control scheme at WiMAX MAC layer interfaceINTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 9 2007Mario Marchese Abstract The paper proposes a bandwidth allocation scheme to be applied at the interface between upper layers (IP, in this paper) and Medium Access Control (MAC) layer over IEEE 802.16 protocol stack. The aim is to optimally tune the resource allocation to match objective QoS (Quality of Service) requirements. Traffic flows characterized by different performance requirements at the IP layer are conveyed to the IEEE 802.16 MAC layer. This process leads to the need for providing the necessary bandwidth at the MAC layer so that the traffic flow can receive the requested QoS. The proposed control algorithm is based on real measures processed by a neural network and it is studied within the framework of optimal bandwidth allocation and Call Admission Control in the presence of statistically heterogeneous flows. Specific implementation details are provided to match the application of the control algorithm by using the existing features of 802.16 request,grant protocol acting at MAC layer. The performance evaluation reported in the paper shows the quick reaction of the bandwidth allocation scheme to traffic variations and the advantage provided in the number of accepted calls. Copyright © 2006 John Wiley & Sons, Ltd. [source] Dynamic buffer management using per-queue thresholdsINTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 5 2007B. Gazi Abstract Shared buffer switches consist of a memory pool completely shared among output ports of a switch. Shared buffer switches achieve low packet loss performance as buffer space is allocated in a flexible manner. However, this type of buffered switches suffers from high packet losses when the input traffic is imbalanced and bursty. Heavily loaded output ports dominate the usage of shared memory and lightly loaded ports cannot have access to these buffers. To regulate the lengths of very active queues and avoid performance degradations, threshold-based dynamic buffer management policy, decay function threshold, is proposed in this paper. Decay function threshold is a per-queue threshold scheme that uses a tailored threshold for each output port queue. This scheme suggests that buffer space occupied by an output port decays as the queue size of this port increases and/or empty buffer space decreases. Results have shown that decay function threshold policy is as good as well-known dynamic thresholds scheme, and more robust when multicast traffic is used. The main advantage of using this policy is that besides best-effort traffic it provides support to quality of service (QoS) traffic by using an integrated buffer management and scheduling framework. Copyright © 2006 John Wiley & Sons, Ltd. [source] Mathematical framework towards the analysis of a generic traffic markerINTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 4 2007Nasser-Eddine Rikli Abstract DiffServ architecture has been widely adopted for the provision of QoS over the Internet. This makes the full understanding of its operation imperative. We believe that only mathematical analysis may have the power of such goal. As the heart of a DiffServ router is the token bucket algorithm, a generic one, with two-colours marking, is to be considered here. A mathematical framework will be first developed for its analysis. Then, assuming an input traffic with Poisson arrivals and Exponential packet lengths, and a memoryless token bucket system, the two types of generated streams will be statistically characterized through their distributions and averages. This analysis will be carried out for two types of buckets, one with infinite size and a second with finite size. It will be shown how the derived equations will allow the prediction of the output traffic streams for given bucket and input traffic stream parameters. The paper will be then complemented by conclusions and suggestions. Copyright © 2006 John Wiley & Sons, Ltd. [source] Performance analysis of a channel allocation scheme for multi-service mobile cellular networksINTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 2 2007Shensheng Tang Abstract This paper presents a new channel allocation scheme, namely the dynamic partition with pre-emptive priority (DPPP) scheme, for multi-service mobile cellular networks. The system is modelled by a two-dimensional Markov process and analysed by the matrix-analytic method. A pre-emptive priority (PP) mechanism is employed to guarantee the quality of service (QoS) requirement of the real-time (RT) traffic at the expense of some degradation of non-real-time (NRT) traffic, while the victim buffer compensates the degradation and has no negative impact on the RT traffic. The complete service differentiation between new calls and handoff calls from different traffic classes is achieved by using the dynamic partition (DP) concept with the help of related design parameters. The performance analysis and numerical results show that the DPPP scheme, compared with the existing schemes, is effective and practical in multi-service environments. Copyright © 2006 John Wiley & Sons, Ltd. [source] | ||||||||||||||||