• Journal of Communications and Networks
• /
• 제14권3호
• /
• pp.319-335
• /
• 2012

In this study, we design an applicable model enabling internet protocol television (IPTV) service providers to use a virtual network (VN) for IPTV service delivery. The model addresses the guaranteed service delivery, cost effectiveness, flexible control, and scalable network infrastructure limitations of backbone or IP overlay-based content networks. There are two major challenges involved in this research: i) The design of an efficient, cost effective, and reliable virtual network topology (VNT) for IPTV service delivery and the handling of a VN allocation failure by infrastructure providers (InPs) and ii) the proper approach to reduce the cost of VNT recontruction and reallocation caused by VNT allocation failure. Therefore, in this study, we design a more reliable virtual network topology for solving a single virtual node, virtual link, or video server failure. We develop a novel optimization objective and an efficient VN construction algorithm for building the proposed topology. In addition, we address the VN allocation failure problem by proposing VNT decomposition and reconstruction algorithms. Various simulations are conducted to verify the effectiveness of the proposed VNT, as well as that of the associated construction, decomposition, and reconstruction algorithms in terms of reliability and efficiency. The simulation results are compared with the findings of existing works, and an improvement in performance is observed.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2011년도 한국컴퓨터종합학술대회논문집 Vol.38 No.1(D)
• /
• pp.315-318
• /
• 2011

In this work, a VN-based IPTV service delivery network containing a novel VNT was designed, This VN-based IPTV service delivery network utilizes current resources that can be easily obtained by IPTV providers and organizes these resources in a more efficient manner, We also developed a three-stage VN allocation scheme to reduce the complexity of topology design and allocation.

• 한국통신학회논문지
• /
• 제41권6호
• /
• pp.672-677
• /
• 2016

인터넷의 발전은 네트워크 기술과 응용의 확장적 배치와 더불어 성공적으로 고무되어 왔다. 하지만, 요즘에는 인터넷의 사용은 심각한 트래픽 과부하를 야기 시킨다. 따라서, 우리는 효율적인 자원 할당을 위해 네트워크 가상화의 지속적인 연구와 발전이 필요하다. 본 논문은 Piecewise Linear 비용함수를 이용한 비용 최소화 가상 네트워크 매핑 알고리즘을 제안 한다. 노드 매핑에는 선형 프로그래밍을 이용한 알고리즘과 D-VINE을 이용하였고, 링크 매핑에는 선형 프로그래밍 솔루션을 기반으로 최단 경로 알고리즘을 이용하였다. 이와 같은 방법으로 네트워크상에서 Linear와 Tree 구조로 형성된 VN request의 도착률에 따른 평균 비용을 ViNEYard와 비교 분석하였다. 시뮬레이션 구현을 통해 우리의 알고리즘이 ViNEYard 을 사용할 때 보다 발생하는 평균 비용이 낮음을 확인할 수 있었다.