• Title/Summary/Keyword: requirements to QoS

Search Result 391, Processing Time 0.026 seconds

Publish/Subscribe Protocol in Wireless Sensor Networks: Improved Reliability and Timeliness

  • Davis, Ernesto Garcia;Auge, Anna Calveras
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.4
    • /
    • pp.1527-1552
    • /
    • 2018
  • The rapidly-evolving demand of applications using wireless sensor networks in several areas such as building and industrial automation or smart cities, among other, makes it necessary to determine and provide QoS support mechanisms which can satisfy the requirements of applications. In this paper we propose a mechanism that establishes different QoS levels, based on Publish/Subscribe model for wireless networks to meet application requirements, to provide reliable delivery of packet and timeliness. The first level delivers packets in a best effort way. The second one intends to provide reliable packet delivery with a novel approach for Retransmission Timeout (RTO) calculation, which adjusts the RTO depending on the subscriber Packet Delivery Ratio (PDR). The third one provides the same reliable packet delivery as the second one, but in addition, it provides data aggregation trying to be efficient in terms of energy consumption and the use of network bandwidth. The last one provides timeliness in the packet delivery. We evaluate each QoS Level with several performance metrics such as PDR, Message Delivery Ratio, Duplicated and Retransmitted Packet Ratio and Packet Timeliness Ratio to demonstrate that our proposal provides significant improvements based on the increase of the PDR obtained.

QoS- and Revenue Aware Adaptive Scheduling Algorithm

  • Joutsensalo, Jyrki;Hamalainen, Timo;Sayenko, Alexander;Paakkonen, Mikko
    • Journal of Communications and Networks
    • /
    • v.6 no.1
    • /
    • pp.68-77
    • /
    • 2004
  • In the near future packet networks should support applications which can not predict their traffic requirements in advance, but still have tight quality of service requirements, e.g., guaranteed bandwidth, jitter, and packet loss. These dynamic characteristics mean that the sources can be made to modify their data transfer rates according to network conditions. Depending on the customer&; needs, network operator can differentiate incoming connections and handle those in the buffers and the interfaces in different ways. In this paper, dynamic QoS-aware scheduling algorithm is presented and investigated in the single node case. The purpose of the algorithm is in addition to fair resource sharing to different types of traffic classes with different priorities ?to maximize revenue of the service provider. It is derived from the linear type of revenue target function, and closed form globally optimal formula is presented. The method is computationally inexpensive, while still producing maximal revenue. Due to the simplicity of the algorithm, it can operate in the highly nonstationary environments. In addition, it is nonparametric and deterministic in the sense that it uses only the information about the number of users and their traffic classes, not about call density functions or duration distributions. Also, Call Admission Control (CAC) mechanism is used by hypothesis testing.

A study on a packet scheduler for wireless access networks (무선 가입자 액세스 망에서 QoS 패킷 스케줄러에 관한 연구)

  • Jang Jae Shin;Choi Jin Seek;Kwak Dong Yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.12A
    • /
    • pp.1380-1386
    • /
    • 2004
  • Future communication networks would consist of wired and wireless access networks where there would be various types of traffic services. To meet the QoS requirements of those various traffic services simultaneously, new QoS control schemes are required. Since they are simple to deploy, cheep to manage, and easy to support subscriber mobility, wireless access networks are considered here. In this paper, a wireless joint buffer management and scheduling (W-JoBS) scheme, which is a modified version of the original JoBS algorithm at error-prone wireless access networks, is proposed. W-JoBS scheme is for providing service fairness among traffic classes with service compensation and channel-state dependent packet scheduling schemes. With computer simulation, this proposed W-JoBS scheme is evaluated and the performance of W-JoBS is compared with that of the original JoBS.

Adaptive Online Bandwidth Management Algorithms for Multimedia Cellular Networks (멀티미디어 셀룰러 네트워크 상에서의 효율적인 온라인 대역폭 관리기법에 대한 연구)

  • Kim Sung-Wook
    • The KIPS Transactions:PartC
    • /
    • v.13C no.2 s.105
    • /
    • pp.171-176
    • /
    • 2006
  • Bandwidth is an extremely valuable and scarce resource in a wireless network. Therefore, efficient bandwidth management is necessary in order to provide high qualify service to users with different requirements in a multimedia wireless/mobile network. In this paper, we propose an on-line bandwidth reservation algorithm that adjusts bandwidth reservations adaptively based on existing network conditions. The most important contribution of our work is an adaptive algorithm that is able to resolve conflicting performance criteria - bandwidth utilization, call dropping and call blocking probabilities. Our algorithm is quite flexible, is responsive to current traffic conditions in cellular networks, and tries to strike the appropriate performance balance between contradictory requirements for QoS sensitive multimedia services.

A User Class-based Service Filtering Policy for QoS Assurance (QoS 보장을 위한 사용자 등급 기반 서비스 수락 정책)

  • Park, Hea-Sook;Ha, Yan;Lee, Soon-Mi
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.4
    • /
    • pp.293-298
    • /
    • 2004
  • To satisfy the requirements for QoS and acceptance ratio of the users using multimedia content service, it is required to control mechanism for QoS assurance and allocation of the stream server' resources based on CoS(Class of Service). To compare performance of the algorithm, we have classified the user by two classes (super class, base class) and control the acceptance ratio of user's requests by user's class information. We have experimented the test of network resources and test of processing time under server/client environment and agent environment. MA-URFA based on agent increases the acceptance ratio of super class and utilization ratio of network resources.

Implementation of a Framework for Location-aware Dynamic Network Provisioning (위치인지 능동 네트워크 제공을 위한 프레임워크 구현)

  • Nguyen, Huu-Duy;Nguyen, Van-Quyet;Nguyen, Giang-Truong;Kwon, Taeyong;Yeom, Sungwoong;Kim, Kyungbaek
    • Annual Conference of KIPS
    • /
    • 2018.10a
    • /
    • pp.133-135
    • /
    • 2018
  • In these days, providing flexible and personalized network services subject to customers' requirements becomes an interesting issue for network service providers. Moreover, because each network service provider own finite network resources and infrastructure, dynamic network provisioning is essential to leverage the limited network resources efficiently and effectively for supporting personalized network services. Recently, as the population of mobile devices increases, the location-awareness becomes as important as the QoS-awareness to provision a network service dynamically. In this paper, we propose a framework for providing location-aware dynamic network services. This framework includes the web user interface for obtaining customers' requirements such as locations and QoS, the network generator for mapping the requested locations and network infrastructure, the network path calculator for selecting routes to meet the requested QoS and the network controller for deploying a prepared network services into SDN(Software-Defined Networking) enabled network infrastructure.

Multicast Support in DiffServ Using Mobile Agents

  • El Hachimi, Mohamed;Abouaissa, Abdelhafid;Lorenz, Pascal
    • ETRI Journal
    • /
    • v.27 no.1
    • /
    • pp.13-21
    • /
    • 2005
  • Many multicast applications, such as video-on-demand and video conferencing, desire quality of service (QoS) support from an underlying network. The differentiated services (DiffServ) approach will bring benefits for theses applications. However, difficulties arise while integrating native IP multicasting with DiffServ, such as multicast group states in the core routers and a heterogeneous QoS requirement within the same multicast group. In addition, a missing per-flow reservation in DiffServ and a dynamic join/leave in the group introduce heavier and uncontrollable traffic in a network. In this paper, we propose a distributed and stateless admission control in the edge routers. We also use a mobile agents-based approach for dynamic resource availability checking. In this approach, mobile agents act in a parallel and distributed fashion and cooperate with each other in order to construct the multicast tree satisfying the QoS requirements.

  • PDF

A Study of Flow-based QoS Management in Packet Transport Network (패킷 전송망에서의 플로우 기반 QoS 관리 방안 연구)

  • Choi, Chang-Ho;Kim, Whan-Woo
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.11
    • /
    • pp.73-82
    • /
    • 2011
  • As a demand of IP based packet service is increasing, transport network is evolving from circuit based transport technology using TDM to Ethernet based packet transport technology. In this paper we introduce packet transport network based on PBB-TE and MPLS-TP and propose a quality of service(QoS) management scheme to satisfy various user requirements in packet transport network. The proposed flow-based QoS management scheme guarantees that per-flow bandwidth control satisfies the predefined QoS requirement perfectly under bandwidth congestion condition by using perflow and per-PTL tunnel management. In order to evaluate the proposed scheme we defined flow and PTL tunnel per input frame and configured QoS parameters for each flow and PTL tunnel respectively. Simulation was done by using OPNET modeler 16.0 version.

A New Optimization Model for Designing Broadband Convergence Network Access Networks

  • Lee Young-Ho;Jung Jin-Mo;Kim Young-Jin;Lee Sun-Suk;Park No-Ik;Kang Kuk-Chang
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.05a
    • /
    • pp.1616-1640
    • /
    • 2006
  • In this paper, we deal with a network optimization problem arising from the deployment of Ethernet-based BcN access network. BcN convergence services require that access networks satisfy QoS measures. BcN services have two types of traffics: stream traffic and elastic traffic. Stream traffic uses blocking probability as a QoS measure, while elastic traffic uses delay factor as a QoS measure. Incorporating the QoS requirements, we formulate the problem as a nonlinear mixed-integer programming model. The proposed model seeks to find a minimum cost dimensioning solution, while satisfying the QoS requirement. We propose tabu search heuristic algorithms for solving the problem, and simulate tabu result. We demonstrate the computational efficacy of the proposed algorithm by solving a network design problem.

  • PDF

A Degraded Quality Service Policy for reducing the transcoding loads in a Transcoding Proxy (트랜스코딩 프록시에서 트랜스코딩 부하를 줄이기 위한 낮은 품질 서비스 정책)

  • Park, Yoo-Hyun
    • The KIPS Transactions:PartA
    • /
    • v.16A no.3
    • /
    • pp.181-188
    • /
    • 2009
  • Transcoding is one of core techniques that implement VoD services according to QoS. But it consumes a lot of CPU resource. A transcoding proxy transcodes multimedia objects to meet requirements of various mobile devices and caches them to reuse later. In this paper, we propose a service policy that reduces the load of transcoding multimedia objects by degrading QoS in a transcoding proxy. Due to the tradeoff between QoS and the load of a proxy system, a transcoding proxy provides lower QoS than a client's requirement so that it can accomodate more clients.