• 한국정보전자통신기술학회논문지
• /
• 제10권3호
• /
• pp.213-219
• /
• 2017

최근, 인터넷 프로토콜 텔레비전 (IPTV) 서비스가 일반화되어 TV시청 뿐만 아니라 다양한 인터넷기반 서비스가 가능하다. 이러한 IPTV 시스템에서 STB(Set-Top Box)는 실시간 멀티미디어 콘텐츠를 송수신 할 수 있도록 지원하는 네트워크 단말 장치로써 작동한다. 이러한 IPTV 네트워크는 일반적으로 FTTH(Fiber-To-The-Home)와 같은 광섬유(Optical Fiber) 기반의 광대역기반 네트워크에 의해 제공되지만 현재 대부분의 IPTV STB는 대역폭(Bandwidth)을 공유하는 이더넷(Ethernet)과 같은 로컬 영역 네트워크(LAN)에 연결된 장치 중 하나로 연결된다. 따라서 HD급 고화질 콘텐츠 및 다양한 서비스 지원을 위한 IPTV STB을 위하서는 1Gbps와 같은 충분한 광섬유 기반의 네트워크 대역폭을 효과적으로 활용할 수 있어야 한다. 이를 위하여 본 논문에서는 광섬유 네트워크에 바로 장착할 수 있는 새로운 FC(Fiber Channel) 내장형 IPTV STB를 제안한다. 그 후 해당 제안된 FC 내장형 IPTV STB의 우수성을 확인하기 위하여 해당 FC 내장형 IPTV STB가 장착된 FC-AL(Fiber Channel-Arbitration Loop) 네트워크를 구성하여 해당 아키텍처의 성능을 검증한다. 우수한 IPTV 아키텍처의 성능을 확인하기 위하여 철저한 시뮬레이션을 통하여 평균 시작지연(Average Start-up Delay) 시간, 평균 거부비율(Average Reject Ratio) 및 동시 사용자수(Number of Concurrent Users)를 측정한다. 놀랍게도, 제안된 FC 내장형 IPTV STB가 장착된 IPTV 네트워크 아키텍처는 10 msec 미만의 우수한 평균 시작지연(Average Start-up Delay) 시간, 3 % 미만의 수용가능한(Acceptable) 평균 거부비율(Average Reject Ratio) 및 아키텍처를 확장 할 때 동시 사용자수의 선형증가(Linear Increase)를 보여준다. 이는 제안된 FC 내장형 STB가 광섬유 기반의 광대역 대역폭을 효과적으로 사용하여 전체 IPTV 네트워크 성능에 우수한 영향을 미치고 있음을 보여준다.

• 한국음향학회지
• /
• 제30권2호
• /
• pp.86-91
• /
• 2011

In the underwater communications, the acoustic channel is in poor communication conditions, such as long propagation delay, narrow bandwidth, and high bit-error rate. For these bad acoustic channels, we propose an efficient automatic repeat request (ARQ) for multi-hop underwater network by using the concepts of concurrent bi-directional transmission, multiple sub-packets, and overhearing data packet instead of the acknowledgement signal. Our results show that the proposed ARQ significantly reduces the transmission latency especially in high BER compared with the existing Stop and Wait ARQ.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권2호
• /
• pp.269-286
• /
• 2011

In this paper, we study a problem that is concerning how to construct a delay-constrained multicast tree on a wireless mesh network (WMN) such that the number of serviced clients is maximized. In order to support high-quality and concurrent interference-free transmission streams, multiple radios are implemented in each mesh node in the WMNs. Instead of only orthogonal channels used for the multicast in the previous works, both orthogonal and partially overlapping channels are considered in this study. As a result, the number of links successfully allocated channels can be expected to be much larger than that of the approaches in which only orthogonal channels are considered. The number of serviced subscribers is then increased dramatically. Hence, the goal of this study is to find interference-free and delay-constrained multicast trees that can lead to the maximal number of serviced subscribers. This problem is referred as the MRDCM problem. Two heuristics, load-based greedy algorithm and load-based MCM algorithm, are developed for constructing multicast trees. Furthermore, two load-based channel assignment procedures are provided to allocate interference-free channels to the multicast trees. A set of experiments is designed to do performance, delay and efficiency comparisons for the multicast trees generated by all the approximation algorithms proposed in this study.

• International Journal of Computer Science & Network Security
• /
• 제22권9호
• /
• pp.414-426
• /
• 2022

Elliptic Curve Cryptography (ECC) is one of the finest cryptographic technique of recent time due to its lower key length and satisfactory performance with different hardware structures. In this paper, a High Throughput Multiplier architecture is introduced for Elliptic Cryptographic applications based on concurrent computations. With the aid of the concurrent computing approach, the High Throughput Concurrent Computation (HTCC) technology that was just presented improves the processing speed as well as the overall efficiency of the point-multiplier architecture. Here, first and second distinct group operation of point multiplier are combined together and synthesised concurrently. The synthesis of proposed HTCC technique is performed in Xilinx Virtex - 5 and Xilinx Virtex - 7 of Field-programmable gate array (FPGA) family. In terms of slices, flip flops, time delay, maximum frequency, and efficiency, the advantages of the proposed HTCC point multiplier architecture are outlined, and a comparison of these advantages with those of existing state-of-the-art point multiplier approaches is provided over GF(2¹⁶³), GF(2²³³) and GF(2²⁸³). The efficiency using proposed HTCC technique is enhanced by 30.22% and 75.31% for Xilinx Virtex-5 and by 25.13% and 47.75% for Xilinx Virtex-7 in comparison according to the LC design as well as the LL design, in their respective fashions. The experimental results for Virtex - 5 and Virtex - 7 over GF(2²³³) and GF(2²⁸³)are also very satisfactory.

• 한국컴퓨터정보학회논문지
• /
• 제6권2호
• /
• pp.84-89
• /
• 2001

본 논문은 근거리 통신망 (LAN)의 종단에서 사용되는 기존의 멀티링크 스위칭 기법이 최대 정규화 전파 지연 값이 커질수록 채널 이용률이 급격히 떨어지는 단점이 있어 이를 보완하고자 병행처리 기능을 추가하여 프로토콜을 개선시킨 다음에 성능을 분석하여 보았다. 개선된 프로토콜의 성능 분석은 채널 이용률 관점에서 이루어졌으며 이것을 기존의 다른 프로토콜과 비교하여 보았다. 그 결과 병행처리 기능이 추가된 프로토콜이 기존의 여러 방식의 프로토콜보다 최대 정규화 전파 지연 값이 커질 경우 더 나은 성능을 보임을 알 수 있었다.

• Journal of Electrical Engineering and information Science
• /
• 제2권6호
• /
• pp.28-35
• /
• 1997

A new approach concurrent transistor sizing and buffer insertion for low power optimization is proposed in this paper. The method considers the tradeoff between upsizing transistors and inserting buffers and chooses the solution with the lowest possible power and area cost. It operates by analyzing the feasible region of the cost-delay curves of the unbuffered and buffered circuits. As such the feasible region of circuits optimized by our method is extended to encompass the envelop of cost-delay curves which represent the union of the feasible regions of all buffered ad unbuffered versions of the circuit. The method is efficient and tunable in that optimality can be traded for compute time and as a result it can in theory near optimal results.

• Journal of Communications and Networks
• /
• 제17권1호
• /
• pp.58-66
• /
• 2015

Aeronautical communication networks (ACN) is an emerging concept in which aeronautical stations (AS) are considered as a part of multi-tier network for the future wireless communication system. An AS could be a commercial plane, helicopter, or any other low orbit station, i.e., Unmanned air vehicle, high altitude platform. The goal of ACN is to provide high throughput and cost effective communication network for aeronautical applications (i.e., Air traffic control (ATC), air traffic management (ATM) communications, and commercial in-flight Internet activities), and terrestrial networks by using aeronautical platforms as a backbone. In this paper, we investigate the issues about connectivity, throughput, and delay in ACN. First, topology of ACN is presented as a simple mobile ad hoc network and connectivity analysis is provided. Then, by using information obtained from connectivity analysis, we investigate two communication models, i.e., single-hop and two-hop, in which each source AS is communicating with its destination AS with or without the help of intermediate relay AS, respectively. In our throughput analysis, we use the method of finding the maximum number of concurrent successful transmissions to derive ACN throughput upper bounds for the two communication models. We conclude that the two-hop model achieves greater throughput scaling than the single-hop model for ACN and multi-hop models cannot achieve better throughput scaling than two-hop model. Furthermore, since delay issue is more salient in two-hop communication, we characterize the delay performance and derive the closed-form average end-to-end delay for the two-hop model. Finally, computer simulations are performed and it is shown that ACN is robust in terms of throughput and delay performances.

• ETRI Journal
• /
• 제36권3호
• /
• pp.385-395
• /
• 2014

In this paper, we consider a resource allocation scheme for millimeter wave-based wireless personal area networks using directional antennas. This scheme involves scheduling the reservation period of medium access control for IEEE 802.15.3c. Objective functions are considered to minimize the average delay and maximize throughput; and two scheduling algorithms-namely, MInMax concurrent transmission and MAxMin concurrent transmission-are proposed to provide a suboptimal solution to each objective function. These are based on an exclusive region and two decision rules that determine the length of reservation times and the transmission order of groups. Each group consists of flows that are concurrently transmittable via spatial reuse. The algorithms appropriately apply two decision rules according to their objectives. A real video trace is used for the numerical results, which show that the proposed algorithms satisfy their objectives. They outperform other schemes on a range of measures, showing the effect of using a directional antenna. The proposed scheme efficiently supports variable bit rate traffic during the reservation period, reducing resource waste.

• Journal of Genetic Medicine
• /
• 제16권1호
• /
• pp.15-18
• /
• 2019

SHORT syndrome is an extremely rare congenital condition due to a chromosomal mutation of the PIK3R1 gene found at 5q13.1. SHORT is a mnemonic representing six manifestations of the syndrome: (S) short stature, (H) hyperextensibility of joints and/or inguinal hernia, (O) ocular depression, (R) Rieger anomaly, and (T) teething delay. Other key aspects of this syndrome not found in the mnemonic include lipodystrophy, triangular face with dimpled chin (progeroid facies, commonly referred to as facial gestalt), hearing loss, vision loss, insulin resistance, and intrauterine growth restriction (IUGR). 3q duplication syndrome is rare syndrome that occurs due to a gain of function mutation found at 3q25.31-33 that presents with a wide array of manifestations including internal organ defects, genitourinary malformations, hand and foot deformities, and mental disability. We present a case of a 2 year and 3 month old male with SHORT syndrome and concurrent 3q duplication syndrome. The patient presented at birth with many of the common manifestations of SHORT syndrome such as bossing of frontal bone of skull, triangular shaped face, lipodystrophy, micrognathia, sunken eyes, and thin, wrinkled skin (progeroid appearance). Additionally, he presented with findings associated with 3q duplication syndrome such as cleft palate and cryptorchidism. Although there is no specific treatment for these conditions, pediatricians should focus on referring patients to various specialists in order to treat each individual manifestation.

• 한국멀티미디어학회논문지
• /
• 제9권7호
• /
• pp.827-834
• /
• 2006

참여자의 수가 대규모화되고 있는 분산가상환경에서 사용자의 행위에 대한 응답성은 시스템의 만족도를 결정하는 중요한 요소 중의 하나이다. 시스템의 응답성은 서버에서 이벤트 처리 알고리즘의 효율성에 의하여 영향을 받으며 대부분의 가상환경은 이벤트 메시지를 발생순서에 따라 순차적으로 처리하는 FCFS알고리즘을 사용한다. FCFS방식은 이벤트의 우선순위는 고려하지 않고 발생시간에만 전적으로 의존함으로써 일반 이벤트 메시지의 처리로 인해 사용자의 상호작용에 의해 생성된 긴급 이벤트의 처리가 지연되어 시스템 응답성을 저하시키는 문제점을 가지고 있다. 본 연구에서는 기존의 FCFS 이벤트 처리방식의 문제점을 개선하기 위하여 이벤트에 우선순위를 부여하고 이에 기반하여 서버에서 다중 메시지의 병행 처리가 가능한 이벤트 스케줄링 알고리즘을 제안한다. 본 알고리즘은 서버에서 처리충돌을 일으키는 이벤트에 대하여 발생시간과 우선순위 정보를 상호절충하여 처리함으로써 시스템의 일관성과 응답성의 목표를 동시에 만족시키는 효과가 있다.