• Title/Summary/Keyword: Priority service networks

Search Result 168, Processing Time 0.025 seconds

Adaptive Online Network Management for QoS Sensitive Multimedia Services (멀티미디어 서비스의 품질 보장을 위한 적응적 자원관리 기법에 대한 연구)

  • Kim, Sung-Wook;Kim, Sung-Chun
    • The KIPS Transactions:PartC
    • /
    • v.13C no.7 s.110
    • /
    • pp.933-938
    • /
    • 2006
  • Different multimedia services over networks not only require different amounts of bandwidth but also have different Qualify of Service (QoS) requirements. For example, QoS guarantees for higher priority calls is an important issue in multimedia communication networks. In this paper, we develop an adaptive bandwidth management algorithm, which is able to provide QoS guarantees for higher priority calls while accommodating as many heterogeneous multimedia call connections as possible. Our scheme, based on reservation and bandwidth adaptation, manages bandwidth based on real time estimates of current network conditions. Simulation results indicate the superior performance of our scheme providing excellent trade off between contradictory requirements.

A Cell Loss Constraint Method of Bandwidth Renegotiation for Prioritized MPEG Video Data Transmission in ATM Networks (ATM망에서 우선 순위가 주어진 MPEG 비디오 데이터 전송시 대역폭 재협상을 통한 셀 손실 방지 기법)

  • Yun, Byoung-An;Kim, Eun-Hwan;Jun, Moon-Seog
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.7
    • /
    • pp.1770-1780
    • /
    • 1997
  • Our problem is improvement of image quality because it is inevitable cell loss of image data when traffic congestion occurs. If cells are discarded indiscriminately in transmission of MPEG video data, it occurs severe degradation in quality of service(QOS). In this paper, to solve this problem, we propose two method. The first, we analyze the traffic characteristics of an MPEG encoder and generate high priority and low priority data stream. During network congestion, only the least low priority cells are dropped, and this ensures that the high priority cells are successfully transmitted, which, in turn, guarantees satisfactory QoS. In this case, the prioritization scheme for the encoder assigns components of the data stream to each priority level based on the value of a parameter ${\beta}$. The second, Number of high priority cells are increased when value of ${\beta}$ is large. It occurs the loss of high priority cell in the congestion. To prevent it, this paper is regulated to data stream rate as buffer occupancy with UPC controller. Therefore, encoder's bandwidth can be calculated renegotiation of the encoder and networks. In this paper, the encoder's bandwidth requirements are characterized by a usage parameter control (UPC) set consisting of peak rate, burstness, and sustained rate. An adaptive encoder rate control algorithm at the Networks Interface Card(NIC) computes the necessary UPC parameter to maintain the user specified quality of service. Simulation results are given for a rate-controlled VBR video encoder operating through an ATM network interface which supports dynamic UPC. These results show that dynamic bandwidth renegotiation of prioritized data stream could provided bandwidth saving and significant quality gains which guarantee high priority data stream.

  • PDF

Distributed Control Algorithms for QoS in Wireless Networks Using Wireless Token Ring Protocol (무선토큰링 프로토콜을 사용한 무선 네트워크에서 QoS를 지원하는 분산 제어 알고리즘)

  • 김성철
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.2
    • /
    • pp.187-193
    • /
    • 2004
  • Wireless networks play a very important role in communications today. For example, wireless networks today provide from the basic services like e-mail and FTP to the multimedia applications like Web service. It is obvious that QoS requirements to these diverse applications over wireless networks will continue as in wired networks. Much research has been done to develop QoS supporting algorithms on Internet. But due to the limited bandwidth and varying channel states of the wireless networks, it is difficult to support differentiated service over wireless networks. In this paper we propose the modified wireless token ring protocol supporting QoS to the real-time traffic service node over Internet environments in which non-real-time and real-time traffic service nodes coexist. In the proposed algorithm, the real-time traffic service node gets the priority to take token over the non-real-time traffic service node. So the proposed algorithm support quick transmission of the real-time traffic service node. And this advantage can be obtained with minor modification of the legacy wireless token ing protocol to support QoS. We also consider the lost token recovery mechanism.

  • PDF

Wireless LAN with Medical-Grade QoS for E-Healthcare

  • Lee, Hyung-Ho;Park, Kyung-Joon;Ko, Young-Bae;Choi, Chong-Ho
    • Journal of Communications and Networks
    • /
    • v.13 no.2
    • /
    • pp.149-159
    • /
    • 2011
  • In this paper, we study the problem of how to design a medical-grade wireless local area network (WLAN) for healthcare facilities. First, unlike the IEEE 802.11e MAC, which categorizes traffic primarily by their delay constraints, we prioritize medical applications according to their medical urgency. Second, we propose a mechanism that can guarantee absolute priority to each traffic category, which is critical for medical-grade quality of service (QoS), while the conventional 802.11e MAC only provides relative priority to each traffic category. Based on absolute priority, we focus on the performance of real-time patient monitoring applications, and derive the optimal contention window size that can significantly improve the throughput performance. Finally, for proper performance evaluation from a medical viewpoint, we introduce the weighted diagnostic distortion (WDD) as a medical QoS metric to effectively measure the medical diagnosability by extracting the main diagnostic features of medical signal. Our simulation result shows that the proposed mechanism, together with medical categorization using absolute priority, can significantly improve the medical-grade QoS performance over the conventional IEEE 802.11e MAC.

Differentiated Channel Access Scheme for Assuring QoS of Medical Traffic in WLAN-based e-Healthcare Systems (무선랜 기반 e-Healthcare 시스템에서의 의료용 트래픽의 서비스 품질 보장을 위한 채널 접속 차별화 방안)

  • Kim, Young Boo;Park, Eun-Chan
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.20 no.6
    • /
    • pp.676-688
    • /
    • 2014
  • The IEEE 802.11e EDCA (Enhanced Distributed Channel Access) mechanism has been proposed to improve the QoS (Quality of Service) of various services in WLANs (Wireless Local Area Networks). By differentiating the channel access delay depending on ACs (Access Categories), this mechanism can provide the relative service differentiation among ACs. In this paper, we consider that WLAN is deployed in medical environments to transfer medical traffic and we reveal that the quality of the medical traffic (in particular, ECG signals) is significantly deteriorated even with the service differentiation by IEEE 802.11e EDCA. Also, we analyze the reason for performance degradation and show that IEEE 802.11e EDCA has difficulty in protecting the transmission opportunity of high-priority traffic against low-priority traffic. In order to assure medical-grade QoS, we firstly define the service priority of medical traffic based on their characteristics and requirements, and then we propose the enhanced channel access scheme, referred to as DIFF-CW. The proposed scheme differentiates CW (Contention Window) depending on the service priority and modifies the channel access procedure for low-priority traffic. The simulation results confirm that the DIFF-CW scheme not only assures the QoS of medical traffic but also improves the overall channel utilization.

A Fixed Priority Queue Median with Jockeying on a Network

  • Jung, Kyung-Hee
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.15 no.1
    • /
    • pp.117-133
    • /
    • 1990
  • This paper is concerned with determining a minisum location with jockeying for a server on a probabilistic network in which each customer type enters the network system permitting with jockeying through a specified node and a nonpreemptive service policy is in effect. An algorithm to locate a single Fixed Priority Queue Median with Jockeying (FPQMJ) on acyclic networks is developed by using the Generalized Benders' Decomposition technique. The results are then extended to a general network.

  • PDF

PERFORMANCE ANALYSIS OF A MULTIPLEXER WITH THE THRESHOLD BASED OVERLOAD CONTROL IN ATM NETWORKS

  • Park, Chul-Geun
    • Journal of applied mathematics & informatics
    • /
    • v.5 no.3
    • /
    • pp.643-658
    • /
    • 1998
  • In this paper we analyze the performance of a statistical ATM multiplexer with bursty input traffic and two thresholds in the buffer by using queueing model. Two priority levels are considered for source traffic which is modeled by Markov Modulated Poisson Process to represent the bursty characteristics. Service time distributions of two priority sources are assumed to be same and deterministic for ATM environment. The partial buffer sharing scheme with one threshold may experience a sensitive state change around the threshold. But the proposed multiplexer with two thresholds avoids this hysterical phenominon to improve the system operation.

Call Admission Schemes for Multimedia Services in CDMA Cellular Systems (셀룰라 시스템에서 멀티미디어 서비스를 위한 호 수락제어 기법 연구)

  • Choi Sung-Gu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.3B
    • /
    • pp.232-238
    • /
    • 2006
  • We propose a novel call admission control scheme which improves the handoff drop and the new call block probabilities of high priority services, minimizing the negative impact on low priority services, in multimedia service cellular networks. This paper proposes three schemes to solve this problem; the packing scheme in which available channels of a cell distributed to each frequency channel are concentrated on one frequency channel and a high transmission rate service is assigned to the frequency channel; the queuing scheme in which the queue is used for high transmission rate calls; and the power reallocation scheme in which the power assigned to calls under service is temporarily reduced and a high transmission rate service is allowed. The simulation results revealed that our scheme improved the drop and the block probabilities of the high priority services compared with the conventional scheme.

QoS Gurantieeing Scheme based on Deflection Routing in the Optical Burst Switching Networks (광 버스트 교환망에서 우회 라우팅을 이용한 QoS 보장 방법)

  • Kim, Jong-Won;Kim, Jung-Youp;Choi, Young-Bok
    • The KIPS Transactions:PartC
    • /
    • v.10C no.4
    • /
    • pp.447-454
    • /
    • 2003
  • Optical burst switching (OBS) has been proposed to reduce the use of fiber delay lines (FDLs) and to realize the optical switching paradigm of the next-generation ail optical networks. The OBS can provide improvements over wavelength routing in terms of bandwidth efficiency and core network scalability via statistical multiplexing of bursts. Recently, another challenging issue is how to upport quality of service (QoS) in the optical burst switching networks. In this paper, we propose a deflection routing scheme to guarantee the QoS for the OBS networks to detour lower priority burst forward to the deflection routing path when congested. A big advantage of the proposed scheme is the simplicity of QoS provision, that comes from the simple QoS provisioning algorithm. Also, the QoS provisioning scheme be able to make efficient networks by fairly traffic distributing with the reduce of the use of FDLs at core routers. The QoS provisioning scheme has been verified to reliably guarantee the QoS of priority 0, 1, 2 burst and to efficiently utilize network resources by computer simulations using OPNET As results, the end-to-end delay of high priority burst is improved, and the network efficiency is also improved.

Scheduling Method to Improve fairness of ABR Service in ATM Network (ATM망에서 ABR서비스의 공평성 향상을 위한 스케줄링 방법)

  • 양형규;이병호
    • Proceedings of the IEEK Conference
    • /
    • 2001.06a
    • /
    • pp.129-132
    • /
    • 2001
  • Broadband Integrated Services Digital Network(B-lSDN) supports multimedia information in real time. This can be accomplished by using Asynchronous Transfer Mode(ATM) technology. In addition, ATM networks can provide not only bandwidth reservation, but also Quality of Service(QoS) guarantees. In this paper, we propose a efficient cell scheduling algorithm considering ABR service in ATM networks. The proposed algorithm can support ABR service more efficiently than existing fixed cell slot allocation method and priority cell slot allocation method algorithm. proposed algorithm dynamically schedules cells in a real time by considering the current traffic buffer conditions. Throughout the computer simulation, evaluates the performance of the proposed algorithm.

  • PDF