• Title/Summary/Keyword: 손실 복구

Search Result 320, Processing Time 0.024 seconds

A Study of Effective x.264 Coding Method Considering Packet Loss in WLAN (무선랜에서 패킷 손실을 고려한 효율적인 x.264 코딩 기법 연구)

  • Kim, Dong Hyun;Seo, Hyung Yoon;Kim, Jong Deok
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2012.07a
    • /
    • pp.459-461
    • /
    • 2012
  • 스마트폰과 같은 휴대용 멀티미디어 장치의 보급으로 사용자들은 고용량의 멀티미디어 데이터를 끊김없이 서비스 받길 원한다. 무선랜 기반 방송시스템은 한정적인 무선자원을 다수의 사용자들에게 원활하게 서비스하기 위해 유니캐스트 패킷이 아닌 방송 패킷을 이용한다. 하나의 패킷을 다수의 사용자들에게 한번에 전송할 수 있는 방송패킷은 효율적이지만, 손실복구가 어렵다는 단점을 가지고 있다. 이러한 단점을 극복하기 위해 일반적으로 FEC와 같은 방법으로 손실을 복구한다. 그러나 이러한 FEC와 같은 방법은 원본 데이터를 전송하기 위해 추가적인 데이터를 같이 전송해야한다. 이러한 전송은 대역폭의 증가를 가져온다. 그래서 본 연구진은 FEC와 같은 방법대신 전송의 특징을 고려한 x.264코딩 기법만으로 코딩된 동영상 데이터를 전송하여 동영상 품질수준에서 제안한 방법의 우수성을 검증하려한다.

  • PDF

An Adaptive I-frame Tramsmission Control using Quality the Receiver side based on RTP (RTP 기반에서 수신측 품질을 이용한 적응적 I-프레임 전송 제어)

  • Kim, Cheong-Yu;Mun, Young-Song
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2000.10b
    • /
    • pp.1161-1164
    • /
    • 2000
  • 손실된 패킷에 대해 재전송이 곤란한 실시간 멀티미디어 전송에서 패킷 손실이 발생하였다면 하이브리드 압축 방식의 시간적, 공간적 의존성 때문에 에러가 한 프레임 내(공간)와 여러 프레임(시간)간에 전파되는 현상을 보인다. 이러한 현상으로 인해 저하된 수신품질을 복구하기 위해 주기적으로 INTRA 모드인 I-프레임을 삽입해야 한다. 본 논문에서는 RTP 기반의 실시간 멀티미디어 전송에서 위와 같은 패킷 손실 이후 에러의 축적 때문에 발생하는 수신측 품질 저하를 복구하기 위한 I-프레임을 단순히 고정 주기적으로 삽입하는 대신 네트워크 상황과 수신측 피드백 정보인 FMB를 이용하여 적응적으로 삽입하는 방법을 제안한다.

  • PDF

A Study on the Performance of Multicast Transmission Protocol using FEC Method and Local Recovery Method based on Receiver in Mobile Host (이동 호스트에서 FEC기법과 수신자 기반 지역복극 방식의 멀티캐스트 전송 프로토콜 연구)

  • 김회옥;위승정;이웅기
    • Journal of Korea Multimedia Society
    • /
    • v.5 no.1
    • /
    • pp.68-76
    • /
    • 2002
  • Multicast in mobile host has the problem of hast mobility, multicast decision, triangle routing, tunnel convergence, implosion of retransmission, and bandwidth waste. In particular, the bandwidth waste in radio is a definite factor that decreases transmission rate. To solve the problems, this paper proposes a new multicast transmission protocol called FIM(Forward Error Correction Integrated Multicast), which supports reliable packet recovery mechanism by integrating If Mobility Support for the host mobility, IGMP(Interned Group Management Protocol) for the group management, and DVMRP(Distance Vector Multicast Routing Protocol) for the multicast routing, and it also uses FEC and the local recovery method based on receiver. The performance measurement is performed by dividing the losses into the homogeneous independent loss, the heterogeneous independent loss, and the shared source link loss model.. The result shows that the performances improves in proportion to the size of local areal group when the size of transmission group exceeds designated size. This indicates FIM is effective in the environment where there are much of data and many receivers in the mobile host.

  • PDF

A Study on Design Scheme of Mesh-Based Survivable WDM Networks (메쉬 기반의 생존성 WDM망의 설계 기법에 관한 연구)

  • 현기호;정영철
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.40 no.7
    • /
    • pp.507-517
    • /
    • 2003
  • A single fiber failure in mesh-based WDM networks may result in the loss of a large number of data. To remedy this problem, an efficient restoration algorithm for a single fiber failure in the mesh- based WDM network is necessary. We propose a new algorithm for restoration scheme in WDM networks and compare it with previous schemes. Path restoration and link restoration are two representative restoration schemes which deal with only a single link failure. In this paper, we propose two kinds of efficient restoration scheme. In the proposed schemes the restoration path for each link failure is not secured. The mesh network is decomposed into a number of small loops. In one algorithm, any link failure in a certain loop is regarded as the failure of the loop and the restoration lightpath is selected by detouring the failed loop. In another scheme any link failure in a certain loop is restored within the loop. We compare performance of the proposed schemes with conventional path restoration scheme and link restoration scheme. Simulation results show that CPU time in the proposed schemes decreases compared with that in path restoration scheme and link restoration scheme, although total wavelength mileage usage increases by 10% to 50%.

A Study on Improving TCP Performance in Wireless Network (무선 네트워크에서 TCP성능향상을 위한 연구)

  • Kim, Chang-Hee
    • Journal of Digital Contents Society
    • /
    • v.10 no.2
    • /
    • pp.279-289
    • /
    • 2009
  • As the TCP is the protocol designed for the wired network that packet loss probability is very low, because TCP transmitter takes it for granted that the packet loss by the wireless network characteristics is occurred by the network congestion and lowers the transmitter's transmission rate, the performance is degraded. In this article, we suggest the newly improved algorithm using two parameters, the local retransmission time value and the local retransmission critical value to the BS based on the Snoop. This technique adjusts the base stations local retransmission timer effectively according to the wireless link status to recover the wireless packet loss rapidly. We checked that as a result of the suggested algorithm through various simulations, A-Snoop protocol improve more the wireless TCP transmission rate by recovering the packet loss effectively in the wireless link that the continuous packet loss occur than the Snoop protocol.

  • PDF

Binary Locally Repairable Codes from Complete Multipartite Graphs (완전다분할그래프 기반 이진 부분접속복구 부호)

  • Kim, Jung-Hyun;Nam, Mi-Young;Song, Hong-Yeop
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.9
    • /
    • pp.1734-1740
    • /
    • 2015
  • This paper introduces a generalized notion, referred to as joint locality, of the usual locality in distributed storage systems and proposes a code construction of binary locally repairable codes with joint locality ($r_1$=2, $r_2$=3 or 4). Joint locality is a set of numbers of nodes for repairing various failure patterns of nodes. The proposed scheme simplifies the code design problem utilizing complete multipartite graphs. Moreover, our construction can generate binary locally repairable codes achieving (2,t)-availability for any positive integer t. It means that each node can be repaired by t disjoint repair sets of cardinality 2. This property is useful for distributed storage systems since it permits parallel access to hot data.

A Study of Alternative Path Establishment & Restoration for Efficient using in MPLS networks (MPLS자원의 효율적 사용을 위한 우회경로 설정 및 복구에 관한 연구)

  • Park, Jae-Sung;Kim, Jung-Yun;Ryu, In-Tae
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2002.11b
    • /
    • pp.1595-1598
    • /
    • 2002
  • 네트워크 장애로 인한 인터넷 서비스 품질의 저하는 사용자와 서비스 제공자에게 여러 가지 형태로 손실을 가져오므로 망의 우회경로 설정 및 복구방안은 중요한 요소가 되고 있다. 망 복구에 있어서 중요한 과제는 작업 경로(working path)에 대한 복구 경로(restoration path)를 설정하는 것이다. 장애가 발생하더라도 서비스의 중단이 없도록 하기 위해서는 복구 경로를 설정할 때 작업 경로의 대역을 보장할 수 있는 복구 경로를 실정해야 한다. 이를 위해 MPLS망에서는 명시적 Routing기법에 기반을 둔 Constraint-based routing이 제안되었고 또한 망의 경로 복구를 위해 정적 및 동적설정기법이 제안되고 있다. 본 논문에서 제안된 방식은 확장된 OSPF 프로토콜의 TE-LSAs를 이용하여 또 다른 virtual 망을 구성하고 기본경로 중간의 TE-LSR을 새로운 PIL로 설정하여 빠른 대체 LSP를 설정 및 복구하는 기법을 성능 비교를 통해 망 자원의 효율적 사용을 보고자 한다.

  • PDF

A research on the possibility of restoring cultural assets of artificial intelligence through the application of artificial neural networks to roof tile(Wadang)

  • Kim, JunO;Lee, Byong-Kwon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.26 no.1
    • /
    • pp.19-26
    • /
    • 2021
  • Cultural assets excavated in historical areas have their own characteristics based on the background of the times, and it can be seen that their patterns and characteristics change little by little according to the history and the flow of the spreading area. Cultural properties excavated in some areas represent the culture of the time and some maintain their intact appearance, but most of them are damaged/lost or divided into parts, and many experts are mobilized to research the composition and repair the damaged parts. The purpose of this research is to learn patterns and characteristics of the past through artificial intelligence neural networks for such restoration research, and to restore the lost parts of the excavated cultural assets based on Generative Adversarial Network(GAN)[1]. The research is a process in which the rest of the damaged/lost parts are restored based on some of the cultural assets excavated based on the GAN. To recover some parts of dammed of cultural asset, through training with the 2D image of a complete cultural asset. This research is focused on how much recovered not only damaged parts but also reproduce colors and materials. Finally, through adopted this trained neural network to real damaged cultural, confirmed area of recovered area and limitation.

A Study on How to Build a Disaster Recovery System that can Minimize Recovery Time Objective(RTO) and Recovery Point Objective(RPO) to Ensure Business Continuity (비즈니스 연속성 보장을 위한 복구 시간 목표(RTO) 및 복구 지점 목표(RPO)를 최소화할 수 있는 재해복구시스템 구축 방안 연구)

  • Kang, Hyun-Sun
    • Journal of Software Assessment and Valuation
    • /
    • v.17 no.2
    • /
    • pp.91-99
    • /
    • 2021
  • In the current business environment where dependence on IT has increased rapidly, the risk from disasters or cyber-attacks is also increasing. Business continuity, the ability to continue to provide service in the event of a business disruption caused by a disaster, is essential. In other words, you need to have a plan in place to keep your core business functions uninterrupted with rapid recovery within a predetermined Recovery Time Objective (RTO) and Recovery Point Objective (RPO) time frame. In this paper, we propose a disaster recovery system construction method that can minimize RTO and RPO to ensure business continuity. The system configuration adopts Tier 7 disaster recovery model, synchronous storage replication, hot disaster recovery site, and operation management automation solution. This ensures continuity of core business with virtually no data loss and minimal RTO and RPO.

(Buffer Management for the Router-based Reliable Multicast) (라우터 기반의 신뢰적 멀티캐스트를 위한 버퍼 관리)

  • 박선옥;안상현
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.3
    • /
    • pp.407-415
    • /
    • 2003
  • As services requesting data transfer from a sender to a multiple number of receivers become popular, efficient group communication mechanisms like multicast get much attention. Since multicast is more efficient than unicast in terms of bandwidth usage and group management for group communication, many multicast protocols providing scalability and reliability have been proposed. Recently, router-supported reliable multicast protocols have been proposed because routers have the knowledge of the physical multicast tree structure and, in this scheme, repliers which retransmit lost packets are selected by routers. Repliers are selected dynamically based on the network situation, therefore, any receiver within a multicast group can become a replier Hence, all receivers within a group maintains a buffer for loss recovery within which received packets are stored. It is an overhead for all group receivers to store unnecessary packets. Therefore, in this paper, we propose a new scheme which reduces resource usage by discarding packets unnecessary for loss recovery from the receiver buffer. Our scheme performs the replier selection and the loss recovery of lost packets based on the LSM [1] model, and discards unnecessary packets determined by ACKs from erasers which represent local groups.