• Title/Summary/Keyword: QoS differentiation

Search Result 62, Processing Time 0.024 seconds

Service Differentiation Scheme Based on Burst Size Controlling Algorithm in Optical Internet (광 인터넷에서 버스트 크기 제어 알고리즘 기반 서비스 차등화 기법)

  • Lee, Yonggyu
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.4
    • /
    • pp.562-570
    • /
    • 2022
  • The supply expansion of 5G services and personal smart devices has caused the sharp increase of data traffic and the demand of various services. Again, these facts have resulted in the huge demand of network bandwidth. However, existing network technologies using electronic signal have reached the limit to accommodate the demand. Therefore, in order to accept this request, optical internet has been studied actively. However, optical internet still has a lot of problems to solve, and among these barriers a very urgent issue is to develop QoS technologies. Hence, in order to achieve service differentiation between classes in optical internet, especially in OBS network, a new QoS method automatically tuning the size of data bursts is proposed in this article. Especially, the algorithm suggested in this article is based on fiber delay line.

Tactical Service Mesh for Intelligent Traffic QoS Coordination over Future Tactical Network (미래 전술망의 지능적 트래픽 QoS 조율을 위한 전술 서비스 메쉬)

  • Kang, Moonjoong;Shin, Jun-Sik;Park, Juman;Park, Chan Yi;Kim, JongWon
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.22 no.3
    • /
    • pp.369-381
    • /
    • 2019
  • As tactical networks are gradually shifting toward IP-based flexible operation for diversified battlefield services, QoS(Quality-of-Service) coordination for service differentiation becomes essential to overcome the heterogeneous and scarce networking resources limitations. QoS coordination for tactical network traffic should be able to monitor and react the dynamic changes in underlying network topology and service priorities. In this paper, by adopting the emerging cloud-native service mesh concept into tactical network context, we study the feasibility of intelligent QoS coordination by employing tactical service mesh(TSM) as an additional layer to support enhanced traffic quality monitoring and control. The additional TSM layer can leverage distributed service-mesh proxies at tactical mesh WAN(Wide Area Network) nodes so that service-aware differentiated QoS coordination can be effectively designed and integrated with TSM-assisted traffic monitoring and control. Also, by validating the feasibility of TSM layer for QoS coordination with miniaturized experimental setup, we show the potential of the proposed approach with several approximated battlefield traffics over a simulated TSM-enabled tactical network.

MMMP: A MAC Protocol to Ensure QoS for Multimedia Traffic over Multi-hop Ad Hoc Networks

  • Kumar, Sunil;Sarkar, Mahasweta;Gurajala, Supraja;Matyjas, John D.
    • Journal of Information Processing Systems
    • /
    • v.4 no.2
    • /
    • pp.41-52
    • /
    • 2008
  • In this paper, we discuss a novel reservation-based, asynchronous MAC protocol called 'Multi-rate Multi-hop MAC Protocol' (MMMP) for multi-hop ad hoc networks that provides QoS guarantees for multimedia traffic. MMMP achieves this by providing service differentiation for multirate real-time traffic (both constant and variable bit rate traffic) and guaranteeing a bounded end-to-end delay for the same while still catering to the throughput requirements of non real time traffic. In addition, it administers bandwidth preservation via a feature called 'Smart Drop' and implements efficient bandwidth usage through a mechanism called 'Release Bandwidth'. Simulation results on the QualNet simulator indicate that MMMP outperforms IEEE 802.11 on all performance metrics and can efficiently handle a large range of traffic intensity. It also outperforms other similar state-of-the-art MAC protocols.

A Weighted Fair Queuing Scheduler Guaranteeing Differentiated Packet Loss Rates (차별화된 패킷 손실률을 보장하는 가중치 기반 공정 큐잉 스케줄러)

  • Kim, Tae Joon
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.12
    • /
    • pp.1453-1460
    • /
    • 2014
  • WFQ (Weighted Fair Queuing) provides not only fairness among traffic flows in using bandwidth but also guarantees the Quality of Service (QoS) that individual flow requires, which is why it has been applied to the resource reservation protocol (RSVP)-capable router. The RSVP allocates an enough resource to satisfy both the rate and end-to-end delay requirements of the flow in the condition of no packet loss, and the WFQ scheduler guarantees those QoS requirements with the allocated resource. In practice, however, most QoS-guaranteed services allow a degree of packet loss, especially from 0.1% to 3% for Voice over IP. This paper discovers that the packet loss rate of each traffic flow is determined by only its time-stamp adjustment value, and then enhances the WFQ to provide a differentiated packet loss guarantee under general traffic conditions in terms of both traffic characteristics and QoS requirements. The performance evaluation showed that the proposed WFQ could increase the utilization of bandwidth by 8~11%.

GMPLS based Functional Models and Connection Admission Control Algorithms for Optical Burst Switched Networks (광 버스트 교환 망을 위한 GMPLS 기반 기능 모델과 연결 수락 제어 알고리즘)

  • 소원호;노선식;김영천
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7B
    • /
    • pp.585-597
    • /
    • 2004
  • In this paper, we propose the functional models of optical burst switching (OBS) routers to apply GMPLS (Generalized Multiprotocol Label Switching) to optical networks based on OBS. In addition, we introduce a connection admission control (CAC) algorithms which are operated in this models and can accommodate the required QoS. Firstly, the characteristics of current GMPLS and OBS for the optical Internet are basically considered. With this consideration, the models are proposed to accept OBS features which include the recognition of data boundary with control information and the statistical multiplexing in terms of bursts. Secondly, we use an offset time decision (OTD) algorithm on behalf of controlling the connection admission with taking QoS parameters such as burst loss rate(BLR) and service-differentiation ratio(SDR) into consideration. The proposed CAC algorithms use the offered load of LSP (Label Switched Path), wavelength information, and QoS parameters as inputs of OTD algorithm. A call setup request will be accepted when the offset time decided by OTD algorithm is reasonable for guaranteeing its requested QoS. Simulation is used for performance evaluation. Results show the proposed schemes can guarantee the required QoS and those are better than the previous one in terms of channel utilization.

GMPLS based Functional Models and Connection Admission Control Algorithms for Optical Burst Switched Networks (광 버스트 교환 망을 위한 GMPLS 기반 기능 모델과 연결 수락 제어 알고리즘)

  • So, Won-Ho;Roh, Sun-Sik;Kim, Young-Chon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.9B
    • /
    • pp.778-790
    • /
    • 2004
  • In this paper, we propose the functional models of optical burst switching (OBS) routers to apply GMPLS (Generalized Multiprotocol Label Switching) to optical networks based on OBS. In addition, we introduce a connection admission control (CAC) algorithms which are operated in this models and can accommodate the required QoS. Firstly, the characteristics of current GMPLS and OBS for the optical Internet are basically considered. With this consideration, the models are proposed to accept OBS features which include the recognition of data bounda η with control information and the statistical multiplexing in terms of bursts. Secondly, we use an offset time decision (OTD) algorithm on behalf of controlling the connection admission with taking QoS parameters such as burst loss rate(BLR) and service-differentiation ratio(SDR) into consideration. The proposed CAC algorithms use the offered load of LSP (Label Switched Path), wavelength information, and QoS parame ‘ ers as inputs of OTD algorithm. A call setup request will be accepted when the offset time decided by OTD algorithm is reasonable for guaranteeing its requested QoS. Simulation is used for performance evaluation Results show the proposed schemes can guarantee the required QoS and those are better than the previous one in terms of channel utilization.

QoS Enhancement Scheme through Service Differentiation in IEEE 802.11e Wireless Networks (IEEE 802.11e 무선랜에서 서비스 차별화를 통한 QoS 향상 방법)

  • Kim, Sun-Myeng;Cho, Young-Jong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.4
    • /
    • pp.17-27
    • /
    • 2007
  • The enhanced distributed channel access (EDCA) of IEEE 802.11e has been standardized for supporting Quality of Service (QoS) in wireless LANs. In the EDCA, support of QoS can be achieved statistically by reducing the probability of medium access for lower priority traffics. In other words, it provides statistical channel access rather than deterministically prioritized access to high priority traffic. Therefore, lower priority traffics affect the performance of higher priority traffics. Consequently, at the high loads, the EDCA does not guarantee the QoS of multimedia applications such as voice and video even though it provides higher priority. In this paper, we propose a simple and effective scheme, called deterministic priority channel access (DPCA), for improving the QoS performance of the EDCA mechanism. In order to provide guaranteed priority channel access to multimedia applications, the proposed scheme uses a busy tone for limiting the transmissions of lower priority traffics when higher priority traffic has data packets to send. Performance of the proposed scheme is investigated by numerical analysis and simulation. Our results show that the proposed scheme outperforms the EDCA in terms of throughput, delay, jitter, and drop under a wide range of contention levels.

Modelling of Differentiated Bandwidth Requests in IEEE 802.16m Systems

  • Yoon, Kang Jin;Kim, Ronny Yongho;Kim, Young Yong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.4
    • /
    • pp.726-747
    • /
    • 2013
  • In order to support a large number of mobile stations (MSs) with statistical multiplexing in cellular networks, a random access scheme is widely used for uplink (UL) bandwidth request (BR). In the design of a random access based BR scheme, there are two important requirements: short connection delay and diverse Quality of Services (QoSs) support. Such requirements are crucial for IMT-Advanced systems like IEEE 802.16m to provide various types of fourth generation (4G) data services. IEEE 802.16m provides advanced UL BR schemes for non-real time polling service (nrtPS) and best-effort (BE) service to meet the requirements of short connection time and multiple QoS level support. In order to provide short connection time and multiple QoS support, three-step and differentiated BR procedures are adopted. In this paper, a novel modelling of IEEE 802.16m contention based BR scheme is proposed that uses a 2-dimensional discrete time Markov chain. Both the short access delay three-step BR procedures and normal five-step BR procedure are considered in the model. Our proposed model also incorporates the IEEE 802.16m differentiated BR procedure. With the proposed model, we extensively evaluate the performance of IEEE 802.16m BR for two different service classes by changing QoS parameters, such as backoff window size and BR timer. Computer simulations are performed to corroborate the accuracy of the proposed model for various operation scenarios. With the proposed model, accurate QoS parameter values can be derived for the IEEE 802.16m contention-based BR scheme.

An Implementation of Bandwidth Broker Based on COPS for Resource Management in Diffserv Network (차별화 서비스 망에서 COPS 기반 대역 브로커 설계 및 구현)

  • 한태만;김동원;정유현;이준화;김상하
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.4
    • /
    • pp.518-531
    • /
    • 2004
  • This paper discusses a testbed architecture for implementing scalable service differentiation in the Internet. The differentiated services (DiffServ) testbed architecture is based on a model in which a bandwidth broker (BB) can control network resources, and the ALTQ can reserve resources in a router to guarantee a Quality of Service (QoS) for incoming traffic to the testbed. The reservation and releasemessage for the ALTQ is contingent upon a decision message in the BE. The BB has all the information in advance, which is required for a decision message, in the form of PIB. A signaling protocol between the BB and the routers is the COPS protocol proposed at the IETF. In terms of service differentiation, a user should make an SLA in advance, and reserve required bandwidth through an RAR procedure. The SLA and RAR message between a user and the BB has implemented with the COPS extension which was used between a router and the BB. We evaluates the service differentiation for the video streaming in that the EF class traffic shows superb performance than the BE class traffic where is a network congestion. We also present the differentiated service showing a better packet receiving rate, low packet loss, and low delay for the EF class video service.

  • PDF

Study on TCP ECN's Capability of Improving the Performance of Differentiated Services Architecture (Differentiated Services에서 TCP의 ECN을 이용한 성능향상에 관한 연구)

  • 오종채;정재일
    • Proceedings of the IEEK Conference
    • /
    • 2000.11a
    • /
    • pp.9-12
    • /
    • 2000
  • Today, QoS is one of the most critical issues in the network research area and Differentiated Services (DiffServ) is considered as the most prominent solution to provide some kinds of service differentiation without introducing any scalability problem. Among DiffServ's approaches, Assured Service (AS) provides some minimal level of QoS guarantee by treating more preferably than traditional Best Effort (BE) traffic and by using different level of drop probabilities within the same AS classes. In this paper, we investigate the ECN's capability of improving overall goodput of the flows and the possibility of resolving the fairness problem among the flows belonging to same class in Differentiated Services architecture.

  • PDF