• 제목/요약/키워드: network dimensioning

검색결과 33건 처리시간 0.027초

A Practical Network Design for VoD Services

  • Lee, Hoon
    • 한국통신학회논문지
    • /
    • 제34권3B호
    • /
    • pp.225-234
    • /
    • 2009
  • Recently IPTV service is penetrating to the ordinary home users very swiftly. One of the first phase of IPTV service is considered to be VoD, and a nationwide availability of the VoD service imposes tremendous pressure to the network resource due to its requirements for the broad bandwidth, the inherent nature of unicast technology, and the large scalability, etc. This work suggests a novel and practical method to the design of network resource for the VoD service. Especially, we explore the distributed content storage problem that takes into account the popularity of the video contents and its corresponding link dimensioning problem that takes into account the grade of service for the flow level quality of service about the VoD service. By assuming a realistic topology for the nationwide IP backbone network of Korea, which is a typical tree topology, we suggest an analytic method for the design of VoD service.

An optimal dimensioning of ISDN and simulation

  • Lee, Sang-Il;Kim, Sang-Baeg;Lee, Myeong-Yong
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 1991년도 춘계공동학술대회 발표논문 및 초록집; 전북대학교, 전주; 26-27 Apr. 1991
    • /
    • pp.200-204
    • /
    • 1991
  • When various types of traffic streams are offered to a common trunk group, we develop an optimal dimensioning procedure using the alternate routing principle and verify our model by a simulation model. Our method reduces the total network cost by about 10%, compared with the full-mesh system.

  • PDF

The Power of Power Law: A View from VoD Service

  • Lee, Hoon
    • 한국통신학회논문지
    • /
    • 제38B권8호
    • /
    • pp.607-614
    • /
    • 2013
  • In this work we investigate the power of power law in the VoD service over IP network. Especially, we show that the power of power law is strong in the location of the contents storage for the VoD service and its impact on the link dimensioning. This work first shows the instance of the power law in the popularity of the video contents from the real data for the IPTV service. After that we propose an analytic model that characterizes the behavior of customers in accessing the video servers as well as the power law in the viewing pattern. Finally, we show the impact of the power law by proposing a model for the cost as well as link dimensioning. Via numerical experiment we show the implication of the proposition.

Link Dimensioning for Multiplexed M2M Traffic

  • Lee, Hoon
    • 한국통신학회논문지
    • /
    • 제39C권1호
    • /
    • pp.106-113
    • /
    • 2014
  • This work proposes an analytic framework to estimate the capacity of the link in an M2M gateway that multiplexes a massive number of machine type communication devices. First, we specify the network architecture for M2M communications. Next, we summarize the characteristics of M2M traffic, from which we extract an area about the problem that has to be resolved in the dimensioning of the link capacity. After that we propose a new method to determine the capacity of the link in an M2M gateway. Via numerical experiment reflecting the realistic environment of M2M traffic, we illustrate the validity of the proposed model.

Joint routing, link capacity dimensioning, and switch port optimization for dynamic traffic in optical networks

  • Khan, Akhtar Nawaz;Khan, Zawar H.;Khattak, Khurram S.;Hafeez, Abdul
    • ETRI Journal
    • /
    • 제43권5호
    • /
    • pp.799-811
    • /
    • 2021
  • This paper considers a challenging problem: to simultaneously optimize the cost and the quality of service in opaque wavelength division multiplexing (WDM) networks. An optimization problem is proposed that takes the information including network topology, traffic between end nodes, and the target level of congestion at each link/ node in WDM networks. The outputs of this problem include routing, link channel capacities, and the optimum number of switch ports locally added/dropped at all switch nodes. The total network cost is reduced to maintain a minimum congestion level on all links, which provides an efficient trade-off solution for the network design problem. The optimal information is utilized for dynamic traffic in WDM networks, which is shown to achieve the desired performance with the guaranteed quality of service in different networks. It was found that for an average link blocking probability equal to 0.015, the proposed model achieves a net channel gain in terms of wavelength channels (𝛾w) equal to 35.72 %, 39.09 %, and 36.93 % compared to shortest path first routing and 𝛾w equal to 29.41 %, 37.35 %, and 27.47 % compared to alternate routing in three different networks.

NGN에서의 품질보장형 음성서비스 제공을 위한 대역 설계 방법 (Dimensioning Next Generation Networks for QoS Guaranteed Voice Services)

  • Kim, Yoon-Kee;Lee, Hoon;Lee, Kwang-Hui
    • 대한전자공학회논문지TC
    • /
    • 제40권12호
    • /
    • pp.9-17
    • /
    • 2003
  • 본고는 차세대 IP망(NGN)에서의 대역 설계 방법에 관한 것이다. 특히, VoIP 뿐만 아니라 데이터 서비스를 수용하는 에지 라우터에서의 호레벨 및 패킷 레벨 음성 트래픽 대역 설계 방법을 제시하였다. 호레벨 모델은 실제 연결되는 호의 수를 통계적으로 계산하기 위해 평균, 분산과 같은 통계적 기법을 사용하고, 패킷레벨 모델은 M/G/1 큐잉 모델을 활용하여 음성 및 데이터 트래픽의 부하를 나타내었다. 제시된 트래픽 모델을 통해서 계산된, 음성과 데이터 연결을 위한 대역폭을 기반으로 최대 트래픽 부하를 예측할 수 있고, 또한 수치 시험을 통한 이의 결과를 제시하였다.

Performance Assessment of an Access Point for Human Data and Machine Data

  • 이훈
    • 한국통신학회논문지
    • /
    • 제40권6호
    • /
    • pp.1081-1090
    • /
    • 2015
  • This work proposes a theoretic framework for the performance assessment of an access point in the IP network that accommodates MD (Machine Data) and HD (Human Data). First, we investigate typical resource allocation methods in LTE for MD and HD. After that we carry out a Max-Min analysis about the surplus and deficiency of network resource seen from MD and HD. Finally, we evaluate the performance via numerical experiment.

Performance Analysis of LAN Interworking Unit for Capacity Dimensioning of Internet Access Links

  • Park, Chul-geun;Han, Dong-hwan
    • 한국통신학회논문지
    • /
    • 제25권4B호
    • /
    • pp.692-699
    • /
    • 2000
  • We build and analyze some types of queueing model to discuss capacity dimensioning of access links of a LAN interworking unit connected to the Internet backbone network. We assume that the IWU has a FIFO buffer to transmit IP packets to the Internet through the backbone. In order to analyze the system, we use a Poisson process and an MMPP process as input traffic models of IP packets and we use a general service time distribution as a service time model. But we use both an exponential service time and a deterministic service time in numerical examples for simple and efficient performance comparisons. As performance measures, we obtain the packet loss probability and the mean packet delay. We present some numerical results to show the effect of arrival rate, buffer size and link capacity on packet loss and mean delay.

  • PDF

UMTS 패킷 코아 망에서 신호 및 데이터 트래픽 성능 분석 (Performance Evaluation of Signaling and Data Traffic in UMTS Packet Core Networks)

  • Kim, Byung-Chul;Lee, Jae-Yong
    • 대한전자공학회논문지TC
    • /
    • 제41권4호
    • /
    • pp.25-34
    • /
    • 2004
  • GSM에서 발전한 UMTS 망의 경우 SGSN(Serving GPRS Support Node)과 GGSN(Gateway GPRS Support Node)을 중심으로 한 패킷 핵심 망을 포함하고 있다. 이러한 UMTS 망에서는 가입자 이동성, 위치 등록, 가입자 분포 등을 고려하여 망을 설계하고 장비의 제원을 정하여야 한다. 또한 향후 IMT-2000의 주요 트래픽이 데이터이기 때문에 인터넷 데이터 트래픽의 특성인 burstiness를 반영한 SGSN과 GGSN의 설계 기준이 마련되어야 하고 제약적인 시스템 조건 하에서 성능의 변화를 살펴보아야 한다. 이에 본 논문에서는 먼저 패킷 호 가입자의 신호 트래픽을 분석하며 이에 따른 망 성능 변화를 살펴보고, burstiness 특성을 가지는 패킷 데이터가 패킷 코아 망에 미치는 영향을 다양한 환경 하에서 시뮬레이션으로 분석한 뒤 UMTS 망에 새로이 추가하는 두개의 주요 망 요소인 SGSN과 GGSN의 요구 성능을 구하여 그 결과를 바탕으로 새로운 패킷 모드 핵심 망의 설계 기준을 제시하도록 한다.

Broadband Convergence Network 가입자 망 설계 시스템 연구 (A New Optimization System for Designing Broadband Convergence Network Access Networks)

  • 이영호;정진모;김영진;이순석;박노익;강국창
    • 경영과학
    • /
    • 제23권2호
    • /
    • pp.161-174
    • /
    • 2006
  • In this paper, we consider a network optimization problem arising from the deployment of BcN access network. BcN convergence services requires that access networks satisfy QoS meausres. BcN services have two types of traffics : stream traffic and elastic traffic. Stream traffic uses blocking probability as a QoS measure, while elastic traffic uses delay factor as a QoS measure. Incorporating the QoS requirements, we formulate the problem as a nonlinear mixed-integer Programming model. The Proposed model seeks to find a minimum cost dimensioning solution, while satisfying the QoS requirement. We propose two local search heuristic algorithms for solving the problem, and develop a network design system that implements the developed heuristic algorithms. We demonstrate the computational efficacy of the proposed algorithm by solving a realistic network design problem.