• Title/Summary/Keyword: Delay Bounds

Search Result 73, Processing Time 0.02 seconds

An Extended SIP-based Network Architecture and Session Management Methods for Internet QoS (QoS를 지원하는 확장 SIP 기반 네트워크 구조 및 세션 제어 방법)

  • Shin Kang-Sik;Lee Jong-Hoon;Hong Kyung-Pyo;Yoo Sang-Jo;Cho Eun-Hee
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.1
    • /
    • pp.73-88
    • /
    • 2006
  • With the development of Next Generation convergence Network, the current Internet needs a new network architecture and new session establishment methods, which can support various applications requiring differentiated traffic processing and high quality of service instead of the conventional best-effort service. It is expected that, in next generation network based on All-IP. SIP will play an important role in the session establishment between the end to end user terminals. In this paper, we propose a new network architecture that can provide quality of service based on SIP using the QoS enabled SIP servers and policy servers, and we also propose a new session establishment method that apply the user's demands participating the session establishment when setting up the session using the SIP. Through simulations under various environments, we show the parameter ranges in terms of server capacity and the number of users in access networks to achieve reasonable delay bounds.

  • PDF

Provisioning of QoS Adaptability in Wired-Wireless Integrated Networks

  • Guo, Mian;Jiang, Shengming;Guan, Quansheng;Mao, Huachao
    • Journal of Communications and Networks
    • /
    • v.15 no.1
    • /
    • pp.61-70
    • /
    • 2013
  • The increasing number of mobile users and the popularity of real-time applications make wired-wireless integrated network extremely attractive. In this case, quality of service (QoS) adaptability is particularly important since some important features of the integrated network call for QoS adaptability, such as mobility, bursty applications and so on. Traditional QoS schemes include integrated service (IntServ) and differentiated service (DiffSev) as well as their variants. However, they are not able to balance well between scalability and QoS granularity. For example, IntServ faces the scalability problem, while DiffServ can only provide coarse granular QoS. In addition, they are also unable to efficiently support QoS adaptability. Therefore, a per-packet differentiated queueing service (DQS) was proposed. DQS was originally proposed to balance between scalability and QoS granularity in wired networks and then extended to wireless networks. This paper mainly discusses how to use DQS to support QoS adaptability in wired-wireless integrated networks. To this end, we propose a scheme to determine dynamic delay bounds, which is the key step to implement DQS to support QoS adaptability. Simulation studies along with some discussions are further conducted to investigate the QoS adaptability of the proposed scheme, especially in terms of its support of QoS adaptability to mobility and to bursty real-time applications.

Service Curve Allocation Schemes for High Network Utilization with a Constant Deadline Computation Cost (상수의 데드라인 계산 비용으로 높은 네트웍 유용도를 얻는 서비스 곡선 할당 방식)

  • 편기현;송준화;이흥규
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.4
    • /
    • pp.535-544
    • /
    • 2003
  • Integrated services networks should guarantee end-to-end delay bounds for real-time applications to provide high quality services. A real-time scheduler is installed on all the output ports to provide such guaranteed service. However, scheduling algorithms studied so far have problems with either network utilization or scalability. Here, network utilization indicates how many real-time sessions can be admitted. In this paper, we propose service curve allocation schemes that result in both high network utilization and scalability in a service curve algorithm. In service curve algorithm, an adopted service curve allocation scheme determines both network utilization and scalability. Contrary to the common belief, we have proved that only a part of a service curve is used to compute deadlines, not the entire curve. From this fact, we propose service curve allocation schemes that result in a constant time for computing deadlines. We through a simulation study that our proposed schemes can achieve better network utilizations than Generalized processor Sharing (GPS) algorithms including the multirate algorithm. To our knowledge, the service curve algorithm adopting our schemes can achieve the widest network utilization among existing scheduling algorithms that have the same scalability.