• Title/Summary/Keyword: QoS-guaranteed

Search Result 251, Processing Time 0.026 seconds

An Adaptive Fast Expansion, Loading Statistics with Dynamic Swapping Algorithm to Support Real Time Services over CATV Networks

  • Lo Chih-Chen, g;Lai Hung-Chang;Chen, Wen-Shyen E.
    • Journal of Communications and Networks
    • /
    • v.8 no.4
    • /
    • pp.432-441
    • /
    • 2006
  • As the community antenna television (CATV) networks becomes ubiquitous, instead of constructing an entirely new broadband network infrastructure, it has emerged as one of the rapid and economic technologies to interconnecting heterogeneous network to provide broadband access to subscribers. How to support ubiquitous real-time multimedia applications, especially in a heavy traffic environment, becomes a critical issue in modern CATV networks. In this paper, we propose a time guaranteed and efficient upstream minislots allocation algorithm for supporting quality-of-service (QoS) traffic over data over cable service interface specification (DOCSIS) CATV networks to fulfill the needs of realtime interactive services, such as video telephony, video on demand (VOD), distance learning, and so on. The proposed adaptive fast expansion algorithm and the loading statistics with dynamic swapping algorithm have been shown to perform better than that of the multimedia cable network system (MCNS) DOCSIS.

Performance Analysis of Circuit Switched Satellite Network Guaranteed QoS(Quality of Service) (서비스 질을 보장하는 회선 교환 위성 망의 성능 분석)

  • 배태웅;이정규
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.10c
    • /
    • pp.248-250
    • /
    • 2000
  • 본 논문은 망에 대한 유연성과 망의 성능의 효율성을 개선하기 위해서 기존의 회선 교환 위성 망에서 데이터 트래픽을 다루는 시스템을 제안하고 성능을 분석한다. 제안한 시스템은 각 연결의 용량 변경 요구를 동적으로 허락하기 때문에, 그 연결 자체의 초기화 설정 및 연결을 해제하는 다른 별도의 알고리즘이 필요 없어 기존의 회선 교환 위성 망보다 효율적이다. 또, 서비스 질을 결정적으로 보장함으로 망의 유연성 및 신뢰성을 높인다. 트래픽 소스는 Dual Leaky Bucket에 의해 일정하게 조정된 트래픽을 사용하며, 이러한 트래픽을 이용하여 제안한 시스템의 성능을 수학적으로 분석하였고, 이를 시뮬레이션을 통해 검증하였다. 이러한 분석 결과는 앞으로 회선 교환 시스템에서 프로토콜의 설계 및 구현 시 유용하게 사용될 수 있을 것으로 사료된다.

  • PDF

A RSVP Integration Method with Hierarchical Mobile IPv6 Networks

  • Nie, Fang;Cha, Woo-Suk;Cho, Gi-Hwan
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.10c
    • /
    • pp.577-579
    • /
    • 2004
  • Because the Resource reservation Protocol (RSVP) was originally designed fur stationary networks, it is insufficient to accommodate Mobile Nodes (MNs) which frequently change their points of attachment.7his paper deals with how to integrate the RSVP and Hierarchical MHv6 (HMIPv6), in order to quickly establish the QoS guaranteed path and minimize the service disruption when the MN moves around. That can be achieved with the utilization of the common path between the new and old path. Therefore a new method is proposed in detail to find out an anchor node and re-establish a new reservation path.

  • PDF

Wavelength Division Multiplexing-Passive Optical Network Based FTTH Field Trial Test

  • Kim, Geun-Young;Kim, Jin-Hee
    • Journal of the Optical Society of Korea
    • /
    • v.11 no.3
    • /
    • pp.101-107
    • /
    • 2007
  • In this paper, we have presented the results of Wavelength Division Multiplexing-Passive Optical Network (WDM-PON) based fiber-to-the-home (FTTH) field trial test which was held in the city of Gwangju. We have implemented an injection locked Fabry-Perot Laser Diode (FP-LD) based WDM-PON system and reliably delivered Internet Protocol TV (IP-TV), networked Personal Video Recorder (N-PVR), High-Definition Video on Demand (HD-VoD), Education on Demand (EoD) and Internet service as FTTH service through the system during the field trial test. We have also verified that the WDM-PON system worked well to provide quality of service (QoS) guaranteed 100Mbps bandwidth per subscriber. Furthermore, we have presented network designing issues in Outside Plant (OSP) and Customer Premises Network (CPN) that should be overcome to efficiently deploy FTTH service. Finally, based on the field trial test results, we proposed FTTH service deployment strategies.

Design and Performance of Linear Clock Fair Queueing Algorithm (LCFQ ( Linear Clock Fair Queueing ) 알고리즘의 설계와 성능 분석)

  • Kim, Young-Han;Lee, Jae-Yong
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.1
    • /
    • pp.1-8
    • /
    • 1999
  • In order to provide appropriate Quality of Service(QoS) guarantee to each traffic flow in intergrated service networks, an efficient traffic scheduling algorithm as well as resource reservation must be adopted in host and transit routers. In this paper, a new efficient fair queueing algorithm which adopts a linearly increasing virtual time is presented. The proposed algorithm is fair and the maximum and mean delay guaranteed of each flow are less than those of the SCFQ(self clocked fair queueing) algorithm which is one of the most promising traffic scheduling algorithm, while providing low implementation complexity as the SCFQ scheme. And, it has the better isolation provided than SCFQ, which means that each flow is much less influenced by the violating traffic flows provided its allocated bandwidth gurantee. The fairness of the proposed algorithm is proved and simulation results of maximum and mean delay presented.

  • PDF

Algorithm of GTS Time Slots Allocation Based on Weighted Fair Queuing in Environments of WBAN (WBAN 환경에서 Weighted Fair Queuing 기반의 GTS 타임 슬롯 할당 알고리즘)

  • Kim, Kyoung-Mok;Jung, Won-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.11
    • /
    • pp.45-56
    • /
    • 2011
  • WBAN is short range wireless communication technology which is consists of several small devices close to, attached to or implanted into the human body. WBAN is classified into between medical and non-medical by applications based on technology and medical data with periodic characteristics is used the GTS method for transmitting data to guarantee the QoS. In this paper we proposed algorithm that resolve lack of GTSs while data transmit GTS method in superframe structure of WBAN. Coordinator dynamically allocates GTSs according to the data rate of devices and make devices share GTSs when lack of GTSs. We compared delay bounds, throughput for performance evaluation of the proposed algorithm. In other words, we proposed algorithm adaptive WFQ scheduling that GTS allocation support differential data rate in environments of WBAN. The experiment results show the throughput increased and the maximum delay decreased compared with Round Robin scheduling.

Enhancing the Quality of Service by GBSO Splay Tree Routing Framework in Wireless Sensor Network

  • Majidha Fathima K. M.;M. Suganthi;N. Santhiyakumari
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.8
    • /
    • pp.2188-2208
    • /
    • 2023
  • Quality of Service (QoS) is a critical feature of Wireless Sensor Networks (WSNs) with routing algorithms. Data packets are moved between cluster heads with QoS using a number of energy-efficient routing techniques. However, sustaining high scalability while increasing the life of a WSN's networks scenario remains a challenging task. Thus, this research aims to develop an energy-balancing component that ensures equal energy consumption for all network sensors while offering flexible routing without congestion, even at peak hours. This research work proposes a Gravitational Blackhole Search Optimised splay tree routing framework. Based on the splay tree topology, the routing procedure is carried out by the suggested method using three distinct steps. Initially, the proposed GBSO decides the optimal route at initiation phases by choosing the root node with optimum energy in the splay tree. In the selection stage, the steps for energy update and trust update are completed by evaluating a novel reliance function utilising the Parent Reliance (PR) and Grand Parent Reliance (GPR). Finally, in the routing phase, using the fitness measure and the minimal distance, the GBSO algorithm determines the best route for data broadcast. The model results demonstrated the efficacy of the suggested technique with 99.52% packet delivery ratio, a minimum delay of 0.19 s, and a network lifetime of 1750 rounds with 200 nodes. Also, the comparative analysis ensured that the suggested algorithm surpasses the effectiveness of the existing algorithm in all aspects and guaranteed end-to-end delivery of packets.

A Wireless Traffic Load-Balancing Algorithm based on Adaptive Bandwidth Reservation Scheme in Mobile Cellular Networks (셀룰러 망에서 적응적 대역폭 예약 기법을 이용한 무선 트래픽 부하 균형 알고리즘)

  • 정영석;우매리;김종근
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2001.06a
    • /
    • pp.21-24
    • /
    • 2001
  • For very large multimedia traffic to be supported successfully in wireless network environment, it is necessary to provide Quality-of-Service(QoS) guarantees between mobile hosts(clients). In order to guarantee the Qos, we have to keep the call blocking probability below target value during handoff session. However, the QoS negotiated between the client and the network may not be guaranteed due to lack of available channels for traffic in the new cell, since mobile clients should be able to continue their on-going sessions. In this paper we propose a efficient load-balancing algorithm based on the adaptive bandwidth reservation scheme for enlarging available channels in a cell. We design a new method to predict the mobility of clients using MPT(mobility profile table). This method is then used to reserve a part of bandwidths for handoff calls to its adjacent cells and this reserved bandwidth can be used for handoff call prior to new connection requests. If the number of free channels is also under a low threshold value, our scheme use a load-balancing algorithm with a adaptive bandwidth reservation. In order to evaluate the performance of our algorithm, we measure the metrics such as the blocking probability of new calls and dropping probability of handoff calls, and compare with other existing schemes.

  • PDF

A Performance Improvement of Cognitive User by Using Bandwidth Reallocation in Cognitive Radio Systems (인지 라디오 시스템에서 대역폭 재할당을 이용한 인지 사용자의 성능향상)

  • Lee, Jin-Yi
    • Journal of Advanced Navigation Technology
    • /
    • v.18 no.5
    • /
    • pp.415-420
    • /
    • 2014
  • Another crucial issue is a providing secondary user(SU) with the its guaranteed quality of service(QoS) in cognitive radio systems, from the SU view to be allowed to opportunistically utilize the primary user(PU) spectrum on non-interfering. In this paper, we propose a bandwidth reallocation scheme for reducing SU dropping rate through renegotiation of requested channel numbers when available bandwidth is not enough for accepting the spectrum handoff SUs. We categorize SU calls into two types : the first priority and the second priority SU, and the first SU' service is supported by bandwidth reservation based on ARMA prediction model for PU arrivals, while the second SU's bandwidth demands for spectrum handoff is to be reallocated through their renegotiation. Simulation results show that our scheme can improve SU dropping rate and system resource utilization efficiency by bandwidth reallocation.

A Proposal for Improving Techniques of GTS Utilization Based on WBAN (WBAN 기반의 GTS 채널 이용률 향상기법 제안)

  • Park, Joo-Hee;Jung, Won-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.10
    • /
    • pp.73-81
    • /
    • 2011
  • The WBAN(Wireless Body Area Network) technology is a short distance wireless network which provides each device's interactive communication by connecting devices inside and outside of body located within 3 meters. Standardization on the physical layer, data link layer, network layer and application layer is in progress by IEEE 802.15.6 TG BAN. The The WBAN servides consists of both medical and non-medical applications. The medical application service uses the sensor that transfer the periodic traffic and have different data rates. It uses GTS method to guarantee QoS. In this paper, a new method is proposed, which are suitable design for MAC Protocol. Firstly, MAC frame structure and a primitive based on the WBAN are proposed. Secondly, we proposed the GTS algorithm improved the channel utilization based on the WFQ(Weighted Fair Queuing). The proposed scheduling method is improved channel utilization compared with i-Game(Round Robin scheduling method).