• International Journal of Computer Science & Network Security
• /
• 제21권1호
• /
• pp.119-124
• /
• 2021

Elastic Optical Networks (EONs) allow to solve the high demand for bandwidth due to the increase in the number of internet users and the explosion of multicast applications. To support multicast applications, network operator computes a tree-shaped path, which is a set of optical channels. Generally, the demand for bandwidth on an optical channel is enormous so that, if there is a single fiber failure, it could cause a serious interruption in data transmission and a huge loss of data. To avoid serious interruption in data transmission, the tree-shaped path of a multicast connection may be protected. Several works have been proposed methods to do this. But these works may cause the duplication of some resources after recovery due to a link failure. Therefore, this duplication can lead to inefficient use of network resources. Our work consists to propose a method of protection that eliminates the link that causes duplication so that, the final backup path structure after link failure is a tree. Evaluations and analyses have shown that our method uses less backup resources than methods for protection of a multicast connection.

• Current Optics and Photonics
• /
• 제1권4호
• /
• pp.315-324
• /
• 2017

In recent years, multicast services such as high-definition television (HDTV), video conferencing, interactive distance learning, and distributed games have increased exponentially, and wavelength-division multiplexing (WDM) networks are considered to be a promising technology due to their support for multicast applications. Multicast survivability in WDM networks has been the focus of extensive attention since a single-link failure in an optical network may result in a massive loss of data. But the improvement of network survivability increases energy consumption due to more resource allocation for protection. In this paper, an energy-efficient multicast algorithm (EEMA) is proposed to reduce energy consumption in WDM networks. Two cost functions are defined based on the link state to determine both working and protection paths for a multicast request in WDM networks. To increase the number of sleeping links, the link cost function of the working path aims to integrate new working path into the links with more working paths. Sleeping links indicate the links in sleep mode, which do not have any working path. To increase bandwidth utilization by sharing spare capacity, the cost function of the protection path is defined to use sleeping fibers for establishing new protection paths. Finally, the performance of the proposed algorithm is evaluated in terms of energy consumption, and also the blocking probability is evaluated under various traffic environments through OPNET. Simulation results show that our algorithm reduces energy consumption while maintaining the quality of service.

• ETRI Journal
• /
• 제27권5호
• /
• pp.595-607
• /
• 2005

The widespread use of the Internet has led to the problem of intellectual property and copyright infringement. Digital rights management (DRM) technologies have been developed to protect digital content items. Digital content can be classified into static content (for example, text or media files) and dynamic content (for example, VOD or multicast streams). This paper deals with the protection of a multicast stream on set-top boxes connected to an IP network. In this paper, we examine the following design and architectural issues to be considered when applying DRM functions to multicast streaming service environments: transparent streaming service and large-scale user environments. To address the transparency issue, we introduce a 'selective encryption scheme'. To address the second issue, a 'key packet insertion scheme' and 'hierarchical key management scheme' are introduced. Based on the above design and architecture, we developed a prototype of a multicasting DRM system. The analysis of our implementation shows that it supports transparent and scalable DRM multicasting service in a large-scale user environment.

• ETRI Journal
• /
• 제28권4호
• /
• pp.517-520
• /
• 2006

In this letter, a new sharing mechanism, SRLG sharing, is proposed, which allows the links of the same shared risk link group (SRLG) in a primary light tree to share protections in WDM optical networks. In previous studies, how to share spare resources with SRLG constraints has not been studied in multicast optical networks. In this letter, considering SRLG sharing, we propose a novel algorithm -multicast with SRLG sharing (MSS)- to establish a protection light tree. Finally, the algorithm MSS and the algorithm multicast with no SRLG sharing (MNSS) are compared through a simulation to show that our new sharing scheme of SRLG sharing is more efficient than that of no SRLG sharing in terms of spare resource utilization and blocking probability.

• ETRI Journal
• /
• 제28권3호
• /
• pp.329-336
• /
• 2006

This paper investigates the problem of protecting multicast sessions in mesh wavelength-division multiplexing (WDM) networks against single link failures, for example, a fiber cut in optical networks. First, we study the two characteristics of multicast sessions in mesh WDM networks with sparse light splitter configuration. Traditionally, a multicast tree does not contain any circles, and the first characteristic is that a multicast tree has better performance if it contains some circles. Note that a multicast tree has several branches. If a path is added between the leave nodes on different branches, the segment between them on the multicast tree is protected. Based the two characteristics, the survivable multicast sessions routing problem is formulated into an Integer Linear Programming (ILP). Then, a heuristic algorithm, named the adaptive shared segment protection (ASSP) algorithm, is proposed for multicast sessions. The ASSP algorithm need not previously identify the segments for a multicast tree. The segments are determined during the algorithm process. Comparisons are made between the ASSP and two other reported schemes, link disjoint trees (LDT) and shared disjoint paths (SDP), in terms of blocking probability and resource cost on CERNET and USNET topologies. Simulations show that the ASSP algorithm has better performance than other existing schemes.

• ETRI Journal
• /
• 제29권4호
• /
• pp.524-526
• /
• 2007

In this letter, we study the multicast protection problem in sparse-splitting wavelength-division multiplexing (WDM) optical network, and propose a novel multicast protection algorithm called the shared source-leaf path-based protection (SLPP) algorithm. Unlike the proposals in previous studies, the backup paths derived by SLPP can share wavelength with the primary tree in sparse-splitting WDM networks. Simulations are used to evaluate the effectiveness of the SLPP algorithm.

• 한국통신학회논문지
• /
• 제35권4B호
• /
• pp.713-720
• /
• 2010

최근 IPTV는 초고속 통신망을 이용하여 가입자에게 정보 서비스, 동영상 콘텐츠 및 방송 등을 제공하는 서비스로 상용화 및 활성화되며 각광을 받고 있다. 현재 IPTV 시스템은 전송되는 콘텐츠 보호 및 인증을 위하여 CAS와 VOD 콘텐츠용 DRM 시스템을 결합하여 사용하고 있으나 시스템이 복잡하고 구축비용이 높다는 단점을 가지고 있다. 이를 개선하기 위하여 멀티캐스트 방식의 DRM 시스템이 대두되었으나 이 역시 악의적인 사용자에 의해 키가 유출될 경우 시청권한이 없는 사용자가 불법적인 방송시청을 할 수 있다는 문제점이 존재한다. 본 논문에서는 멀티캐스트 DRM 시스템에 사용자 인증 기법을 적용함으로써 악의적인 사용자로부터 콘텐츠를 보호할수 있는 기법을 제안한다.

• Journal of Communications and Networks
• /
• 제17권3호
• /
• pp.221-230
• /
• 2015

Rateless codes have been shown to be able to provide greater flexibility and efficiency than fixed-rate codes for multicast applications. In the following, we optimize rateless codes for unequal error protection (UEP) for multimedia multicasting to a set of heterogeneous users. The proposed designs have the objectives of providing either guaranteed or best-effort quality of service (QoS). A randomly interleaved rateless encoder is proposed whereby users only need to decode symbols up to their own QoS level. The proposed coder is optimized based on measured transmission properties of standardized raptor codes over wireless channels. It is shown that a guaranteed QoS problem formulation can be transformed into a convex optimization problem, yielding a globally optimal solution. Numerical results demonstrate that the proposed optimized random interleaved UEP rateless coder's performance compares favorably with that of other recently proposed UEP rateless codes.

• ETRI Journal
• /
• 제35권6호
• /
• pp.1068-1074
• /
• 2013

This paper proposes an additional forward error correction (FEC) layer to compensate for the defectiveness inherent in the conventional FEC layer in the Long Term Evolution specifications. The proposed additional layer is called a graceful degradation (GD)-FEC layer and maintains desirable service quality even under burst data loss conditions of a few seconds. This paper also proposes a non-delayed decoding (NDD)-GD-FEC layer that is inherent in the decoding process. Computer simulations and device-based tests show a better loss recovery performance with a negligible increase in CPU utilization and occupied memory size.

• 한국정보통신학회논문지
• /
• 제17권7호
• /
• pp.1602-1608
• /
• 2013

PoC (Push-to-Talk over Cellular)는 이동통신망에서 SIP (Session Initiation Protocol) 기반의 VoIP (Voice over Internet Protocol) 기술을 이용하여 일-대-일 또는 일-대-다 통신을 지원하는 특징으로 인하여 재난망에서 이를 적용하기 위한 노력이 현재 시도중이다. 이러한 노력은 그룹 통신 지원이 핵심이며 이를 위한 표준화 제정이 진행중이다. 하지만, 현재 표준의 경우 재난망의 특징을 반영하지 않고 일반 PoC 서비스 중심의 그룹 통신을 지원하기 때문에 재난통신망 적용시 그룹이 특정 지역에 밀집한 경우 PoC 서버에 로드가 집중됨으로써 혼잡 및 이로 인한 지연이 길어지는 문제점이 존재한다. 이러한 문제점을 해결하기 위해서 본 논문에서는 특정 지역의 PoC 서버의 로드를 다수의 PoC 서버가 처리할 수 있도록 분산시킴으로써 강건성 및 전송 지연을 줄이기 위한 새로운 방안을 제안한다. 마지막으로 시뮬레이션을 통하여 성능 평가 결과를 제시한다.