• Title/Summary/Keyword: QoS (Qualify of Service)

Search Result 42, Processing Time 0.024 seconds

A Scalable Dynamic QoS Support Protocol (확장성 있는 동적 QoS 지원 프로토콜)

  • 문새롬;이미정
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.6
    • /
    • pp.722-737
    • /
    • 2002
  • As the number of multimedia applications increases, various protocols and architectures have been proposed to provide QoS(Quality of Service) guarantees in the Internet. Most of these techniques, though, bear inherent contradiction between the scalability and the capability of providing QoS guarantees. In this paper, we propose a protocol, named DQSP(Dynamic QoS Support Protocol), which provides the dynamic resource allocation and admission control for QoS guarantees in a scalable way. In DQSP, the core routers only maintain the per source-edge router resource allocation state information. Each of the source-edge routers maintains the usage information for the resources allocated to itself on each of the network links. Based on this information, the source edge routers perform admission control for the incoming flows. For the resource reservation and admission control, DQSP does not incur per flow signaling at the core network, and the amount of state information at the core routers depends on the scale of the topology instead of the number of user flows. Simulation results show that DQSP achieves efficient resource utilization without incurring the number of user flow related scalability problems as with IntServ, which is one of the representative architectures providing end-to-end QoS guarantees.

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.

UDDI Broker System Supporting Web Services QoS Monitoring (웹 서비스 품질 모니터링을 제공하는 UDDI 중개자 시스템)

  • Yeom, Gwy-Duk;Min, Dug-Ki
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.4 s.36
    • /
    • pp.337-344
    • /
    • 2005
  • UDDI server is the web services registry enabling users to register and search for web services. However, the existing UDDI servers do not provide any information about web services qualify. We designed and developed a UDDI broker system which actively monitors and analyses the qualify of web services. The analysis results are presented to users in statistical figures and graphs. With this information a user can select a web service that meets his/her needs. Availability, performance, and stability were the metrics used for the service qualify measurement and analysis.

  • PDF

Analysis of a Wireless Transmitter Model Considering Retransmission for Real Time Traffic (재전송을 고려한 무선 전송 단에서 실시간 데이터 전송 모델의 분석)

  • Kim, Tae-Yong;Kim, Young-Yong
    • Proceedings of the KIEE Conference
    • /
    • 2005.05a
    • /
    • pp.215-217
    • /
    • 2005
  • There are two types of packet loss probabilities used in both the network layer and the physical layer within the wireless transmitter such as a queueing discard probability and transmission loss probability. We analyze these loss performances in order to guarantee Quality of Service (QoS) which is the basic of the future network. The queuing loss probability is caused by a maximum allowable delay time and the transmission loss probability is caused by a wireless channel error. These two types of packet loss probabilities are not easily analyzed due to recursive feedback which, originates as a result at a queueing delay and a number of retransmission attempts. We consider a wireless transmitter to a M/D/1 queueing model. We configurate the model to have a finite-size FIFO buffer in order to analyze the real-time traffic streams. Then we present the approaches used for evaluating the loss probabilities of this M/D/1/K queueing model. To analyze the two types of probabilities which have mutual feedbacks with each other, we drive the solutions recursively. The validity and accuracy of the analysis are confirmed by the computer simulation. From the following solutions, we suggest a minimum of 'a Maximum Allowable Delay Time' for real-time traffic in order to initially guarantee the QoS. Finally, we analyze the required service rate for each type utilizing real-time traffic and we apply our valuable analysis to a N-user's wireless network in order to get the fundamental information (types of supportable real-type traffics, types of supportable QoS, supportable maximum number of users) for network design.

  • PDF

The open API for reconfiguration in 4G network (4G network에서 재구성성을 위한 개방형 API)

  • Hong Sung-June;Lee Young-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.6 s.38
    • /
    • pp.219-226
    • /
    • 2005
  • This paper describes the open API with integration of semantic web service with PARLAY X based open API in 4G mobile network. It can be expected that the intelligence such as the context-awareness, adaptation and personalization in 4G mobile network will be deployed. But the existing PARLAY based network lacks in considering context-awareness, adaptation and personalization. Therefore, the object of this paper is to support the architecture and the Application Programming Interface (API) of the network service for the context-awareness, adaptation and Personalization in 4G mobile network The open API is to provide users with the adaptive network service to the changing context constraints as well as detecting the changing context and user's Preference. For instance, the open API can Provide users with QoS in network according to the detected context and user's preference, after detecting the context such as location and speed and user's preference.

  • PDF

QoS-based P2P Streaming Protocol (QoS 기반이 P2P 스트리밍 프로토콜)

  • Park, Seung-Chul
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.8
    • /
    • pp.1571-1579
    • /
    • 2009
  • This paper proposes a P2P(Peer-to-Peer) streaming protocol which allows various QoS(Qualify of Service) requirements of video streaming to be supported for various personal IPTV applications in ubiquitous Internet environments. The proposed P2P streaming protocol takes fairly short startup delay, guarantees end-to-end delay bound and bandwidth requirements, and supports reliability level of video streaming for an IPTV application. The QoS-based P2P streaming protocol can properly use not only the advantages of scalability, availability, and ubiquity of P2P streaming but also complement its disadvantages of performance and reliability so that various types of personal IPTV applications can be properly implemented in the existing broadband Internet environments.

QoS Routing Protocol using multi path in Unidirectional Mobile Ad Hoc Networks (단방향 이동 Ad Hoc 망에서의 다중경로를 이용한 QoS 라우팅 프로토콜)

  • Kang, Kyeong-In;Park, Kyong-Bae;Yoo, Choong-Yul;Jung, Chan-Hyeok;Lee, Kwang-Bae;Kim, Hyun-Ug
    • The KIPS Transactions:PartC
    • /
    • v.9C no.6
    • /
    • pp.935-944
    • /
    • 2002
  • It is the Mobile Ad Hoc Networks that constituted with serveral mobile node that can communicate with other mobile nodes. Until now, there were no routing protocols considering such as Multimediadata, VOD (Video On Demand), which is required of lots of bandwidth in Mobile Ad Hoc Network, io we are in the need of QoS (Quality of Service)routing protocol to transmit the data packets faster and more accurate. Also, there are an unidirectional links due to asymmetric property of mobile terminals or current wireless environments on practical mobile ad hoc networks. However, at present, the existing mobile ad hoc routing protocols are implemented to support only bidirectional links. In this paper, we propose the Advanced Routing routing protocol in order to implement a new routing protocol, which is fit to mobile ad hoc networks containing unidirectional links and to support QoS service. For the performance evaluation, we use NS-2 simulator of U.C. Berkeley. We could get not only increased received data rate and decreased average route discovery time, but also network load decreases with compared Best effort service.

Prefetching Methods with User's Preference in Mobile Computing Environment (이동컴퓨팅 환경에서 사용자의 선호도를 고려한 프리페칭)

  • Choi, In-Seon;Cho, Gi-Hwan
    • The KIPS Transactions:PartC
    • /
    • v.13C no.5 s.108
    • /
    • pp.651-658
    • /
    • 2006
  • Mobile computing environment is known to be quite difficult to provide user with a stable QoS(Qualify of Service) due to its mobility nature. In order to protect the inherent characteristics of wireless network such as low bandwidth and high transmission delay along with the user's mobility, many works are conducted to apply caching and prefetching methods. This paper presents a novel prefetching technique which is based on user's preference, that is, interest and Uuかity. It tries to improves the effectiveness of prefetching by separating and appling the interest with personal tendency of a given information, and the popularity with general tendency of the information. The proposed scheme shown relatively superior performance in terms of the utilization ratio of prefetched information and the failure ratio of information retrieval than the existing methods.

Network Efficient Multi-metric Routing Algorithm for QoS Requiring Application (QoS 응용 서비스를 위한 효율적인 다중 메트릭 라우팅 방안)

  • 전한얼;김성대;이재용;김동연;김영준
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.11C
    • /
    • pp.1055-1063
    • /
    • 2002
  • In this paper, we have studied path selection problem using multiple metric. Current Internet selects a path using only one metric. The path selected by one metric is a best-effort service that can satisfy one requirements. In order to satisfy a call with various Qualify-of-Service(QoS) requirements, the path must satisfy multiple constraints. In many cases, path selection is NP-complete. The proposed algorithm is widest-least cost routing algorithm that selects a path based on cost metric which is basically a delay metric influenced by the network status. The proposed algorithm is a multiple metric path selection algorithm that has traffic distribution ability to select shortest path when network load is light and move traffic to other alternate path when the link load is high. We have compared the results with other routing algorithms.

UQoS Management Middleware Framework for Internet-Based Multimedia Application (인터넷 기반 멀티미디어 응용을 위한 UQoS 관리 미들웨어 프레임워크)

  • Yoon, Eun-Young;Ghim, Soo-Joong;Yoon, Yong-Ik;Kim, Sung-Hoon;Chang, Chul-Soo
    • The KIPS Transactions:PartB
    • /
    • v.9B no.5
    • /
    • pp.549-554
    • /
    • 2002
  • This paper proposes a UQoSM (User Qualify of Service Middleware) framework for multimedia application systems. UQoSM system is extended the existing event service model added to the event monitoring, reflective event filtering and event dispatcher for supporting multimedia application systems. Especially, this paper is concentrated on providing suitable reflective event filtering function for multimedia application service system in order to meet various user requirements under inter-based environment. It means this system provides high QoS to users. In addition, it results in decreasing network traffic as unnecessary event information is filtered from network.