• 한국통신학회논문지
• /
• 제29권3A호
• /
• pp.223-232
• /
• 2004

본 논문에서는 이더넷 PON(Passive Optical Network)에서 다중 클래스 서비스를 효율적으로 제공하기 위한 동적 대역 할당 알고리듬을 제안한다. 제안한 알고리듬은 OLT(Optical Line Terminal)에 존재하는 상위 단계 스케줄러와 ONU(Optical Network Unit)에 존재하는 하위 단계 스케줄러로 구성된다. 계층적 구조 기반의 대역 할당 알고리듬은 대역 할당을 수행하는 스케줄러와 스케줄의 대상이 되는 큐가 거리 상으로 분산되어 있는 이더넷 PON 시스템에서 확장성과 자원의 효율성을 제공할 수 있다. 또한 본 논문에서는 ONU에서 수행하는 하위 단계 대역 할당 알고리듬으로 비례 할당 알고리듬, 최대 요구 우선 할당(Maximum Request First Allocation: MRFA) 알고리듬, 우선 순위 우선 할당(High Priority First Allocation: HPFA) 알고리듬을 제안한다. 제안한 알고리듬의 성능 평가를 위해 OPNET을 이용하여 IEEE 802.3ah 기반의 이더넷 PON 시스템을 설계하고 시뮬레이션을 수행하였으며 각 알고리듬의 채널 이용률, 큐잉 지연, 잔여대역 관점에서 성능을 평가하고 분석하였다.

• Journal of Ubiquitous Convergence Technology
• /
• 제2권2호
• /
• pp.88-96
• /
• 2008

IPTV Content delivery systems over wired networks confront scalability problems due to their high network bandwidth requirement for real-time services. Especially, VoD service provides Trick Mode features such as pause, fast forward and similar operations. However, Trick Mode services are delivered by the method of unicast only for controlling of the stream. With a point of views, this paper propose a new real-time multimedia streaming architecture over IP Networks, which tries to achieve bandwidth efficiency and supporting for mass clients better than traditional unicast services. The proposed methods divide the Transport Stream into a series of segments. After that, this divided partial Transport Stream makes multicast streaming periodically. Meanwhile Set-top Box of a client makes a rearrangement orderly by using Presentation Time Stamp field from the served Transport Stream packets. While the current Transport Stream segment is playing, it should be guaranteed that the next segment is downloaded on time. Consequently, the original video content can be played out continuously. The detail introduction of a new real-time multimedia streaming system with analysis and simulation follows as below.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2008년도 추계학술대회
• /
• pp.189-192
• /
• 2008

Modern broadcasting/multicasting networks has the heterogeneous nature in terms of terminals and available bandwidth. Such heterogeneity could be coped by scalable video coding (SVC) standard developed recently. More specifically, spatial layers of an SVC bitstream can be consumed by different terminals and SNR (and temporal) scalability can be used to cope with bandwidth heterogeneity. In this work, we tackle the problem of SVC adaptation for different user groups receiving the same broadcast/multicast video, so as to provide a flexible tradeoff between the groups while also maximizing the overall quality of the users. The adaptation process to truncate an SVC bitstream is first formulated as an optimization problem. Then the problem is represented by MPEG-21 DIA description tools, which can be solved by a universal processing. The results show that MPEG-21 DIA is useful to enable automatic and interoperable adaptation in our scenario.

• 한국통신학회논문지
• /
• 제29권12B호
• /
• pp.1052-1062
• /
• 2004

지금의 high-speed TCP 프로토콜은 공정성과 TCP friendliness에 심각한 문제가 있으며, 이는 high-speed TCP의 도입에 있어 중요한 문제가 된다. 본 논문에서는 high-speed TCP의 버스터한 특성을 줄여 TCP friendliness와 공평성 향상시키는 방안으로 high-speed TCP에 pacing 적용을 제시하고 성능 분석을 수행하였다. Pacing은 TCP 송신원의 수정만으로 적용 가능하며 TCP 혼잡 제어 방식과는 독립적으로 동작하기 때문에 도입이 쉽다는 장점을 가진다. 시뮬레이션 결과 제안된 방안은 high-speed TCP의 버스터한 특성을 효과적으로 줄이고 성능 저하 없이 기존의 high-speed TCP에 비해 향상된 TCP friendliness와 RTT에 따른 공정성을 제공함을 보였다.

• Journal of Communications and Networks
• /
• 제4권3호
• /
• pp.221-229
• /
• 2002

Adaptability is the most promising feature to be applied in future robust multimedia applications. In this paper, we propose the Direct Algorithm to improve the degree of satisfaction at heterogeneous receivers in multi-layered multicast video environments. The algorithm relies on a mechanism that dynamically controls the rates of the video layers and is based on feedback control packets sent by the receivers. The algorithm also addresses scalability issues by implementing a merging procedure at intermediate nodes in order to avoid packet implosion at the source in the case of large multicast groups. The proposed scheme is optimized to achieve high global video quality and reduced bandwidth requirements. We also propose the Direct Algorithm with a virtual number of layers. The virtual layering scheme induces intermediate nodes to keep extra states of the multicast session, which reduces the video degradation for all the receivers. The results show that the proposed scheme leads to improved global video quality at heterogeneous receivers with no cost of extra bandwidth.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제18권4호
• /
• pp.881-902
• /
• 2024

Fast decision support systems and accurate diagnosis have become significant in the rapidly growing healthcare sector. As the number of disparate medical IoT devices connected to the human body rises, fast and interrelated healthcare data retrieval gets harder and harder. One of the most important requirements for the Healthcare Internet of Things (HIoT) is semantic interoperability. The state-of-the-art HIoT systems have problems with bandwidth and latency. An extension of cloud computing called fog computing not only solves the latency problem but also provides other benefits including resource mobility and on-demand scalability. The recommended approach helps to lower latency and network bandwidth consumption in a system that provides semantic interoperability in healthcare organizations. To evaluate the system's language processing performance, we simulated it in three different contexts. 1. Polysemy resolution system 2. System for hyponymy-hypernymy resolution with polysemy 3. System for resolving polysemy, hypernymy, hyponymy, meronymy, and holonymy. In comparison to the other two systems, the third system has lower latency and network usage. The proposed framework can reduce the computation overhead of heterogeneous healthcare data. The simulation results show that fog computing can reduce delay, network usage, and energy consumption.

• 한국음향학회지
• /
• 제24권7호
• /
• pp.395-401
• /
• 2005

본 논문에서는 대역폭 계층 구조의 광대역 음성 부호화기를 위한 8kbps 상위 대역 부호화기를 제안한다. 광대역 입력 음성 신호는 하위 대역 신호와 상위 대역 신호로 분리되고, 하위 대역 신호는 표준 협대역 음성 부호화기로 처리하고, 상위 대역 신호는 제안하는 부호화기로 처리하는 구조를 가진다. 제안한 상위 대역 부호화기는 입력 신호를 부프레임 단위로 MLT 변환하고 MLT 계수를 크기와 부호로 분리하여 각각의 특성에 적합하도록 양자화 한다. MLT 계수 크기는 다수의 시간과 주파수 성분을 함께 가지는 밴드로 분할하고, 각 밴드 신호는 2차원 DCT 변환하여 양자화하며, 하위 대역의 에너지 정보를 이용하여 양자화 성능을 향상시킨다. MLT 계수 부호는 각각의 중요도를 판정하여 일부 부호만 선택적으로 양자화 하는 방법을 사용한다. 제안한 상위 대역 부호화기를 포함하는 19.8kbps 광대역 부호화기의 객관적 성능과 주관적 성능을 측정하였으며, 32kbps G.722.1보다 우수한 성능을 가지는 것을 확인하였다.

• 한국국방경영분석학회지
• /
• 제30권1호
• /
• pp.107-134
• /
• 2004

Today's Internet is providing a single service which is so-called "best-effort service". Now, multimedia and real-time applications are not only demanding large bandwidth but also requiring high QoS. For this, MPLS and DiffServ technology can be adopted to support more scalability and QoS for data traffic engineering. The DISN(Defense Information Systems Network) supports CBR service for voice traffic and VBR service for data traffic which is best-effort service. We propose how to adopt MPLS and DiffServ technology to support traffic engineering and guarantee QoS in the DISN. A traffic analysis according to prioritized traffic classes is done using OPNET simulation tool for assuring QoS. The result shows that low priority packets are delayed a little bit, but high priority packets are transferred more efficiently than without traffic engineering.gineering.

• Journal of Information Processing Systems
• /
• 제4권2호
• /
• pp.53-60
• /
• 2008

The Web Services infrastructure is a distributed computing environment for service-sharing. Mechanisms for Web services Discovery proposed so far have assumed a centralized and peer-to-peer (P2P) registry. A discovery service with centralized architecture, such as UDDI, restricts the scalability of this environment, induces performance bottleneck and may result in single points of failure. A discovery service with P2P architecture enables a scalable and an efficient ubiquities web service discovery service that needs to be run in self-organized fashions. In this paper, we propose an autonomic -interleaving Registry Overlay Network (RgON) that enables web-services' providers/consumers to publish/discover services' advertisements, WSDL documents. The RgON, doubtless empowers consumers to discover web services associated with these advertisements within constant D logical hops over constant K physical hops with reasonable storage and bandwidth utilization as shown through simulation.

• Journal of Electrical Engineering and Technology
• /
• 제6권4호
• /
• pp.573-579
• /
• 2011

To meet the scalability and performance requirements of data analyses, which often involve voluminous data, efficient parallel or concurrent algorithms and frameworks are essential. We present a high-performance Korean morphological analyzer which employs the MapReduce framework on the graphics processing unit (GPU). MapReduce is a programming framework introduced by Google to aid the development of web search applications on a large number of central processing units (CPUs). GPUs are designed as a special-purpose co-processor. Their programming interfaces are typically formulated for graphics applications. Compared to CPUs, GPUs have greater computation power and memory bandwidth; however, GPUs are more difficult to program because of the design of their architectures. The performance of the Korean morphological analyzer using the MapReduce framework on the GPU is evaluated in comparison with the CPU-based model. The proposed Korean Morphological analyzer shows promising scalable performance on distributed computing with the GPU.