• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.374-395
• /
• 2017

Users quite often experience volatile channel conditions which negatively influence multimedia transmission. HTTP adaptive streaming has emerged as a new promising technology where the video quality can be adjusted to variable network conditions. Nevertheless, the new technology does not remain without drawbacks. As it has been observed, multiple video players sharing the same network link have often problems with achieving good efficiency and stability of play-out due to a mutual interference and competition among video players. Our investigation indicates that there may be another cause for under-performance of the streamed video. In an emulated environment, we implemented three algorithms of adaptive video play-out based on bandwidth or buffer assessment. As we show, traffic generated by players employing the same or similar play-out strategies is positively correlated and synchronised (clustered), whereas traffic originated from different play-out strategies shows negative or no correlations. However, when some of the parameters of the play-out strategies are randomised, the correlation and synchronisation diminish what has a positive impact on the smoothness of the traffic and on the video quality perceived by end users. Our research shows that non-correlated traffic flows generated by play-out strategies improve efficiency and stability of streamed adaptive video.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.259-262
• /
• 2006

라우터에서 세션간 출력링크 용량을 공정하게 분배하기 위해, Generalized Processor Sharing(GPS) 기반 공정큐잉 알고리즘들이 제안되었다. 이 알고리즘들은 대역폭 관점에서는 서버에 대기중인 각 세션들에게 공정한 서비스를 제공해 주지만, 지연 관점에서는 경계치 이하로 보장해 주는 서비스만 제공한다. 이로 인해 적은 양의 패킷을 생성하는 세션이라도 작은 지연으로 서비스 받고자 한다면, 큰 대역폭을 할당받아야 하는 문제가 발생한다. 이와 같이 지연과 대역폭이 결합됨으로 써 생기는 문제를 해결하고자 서비스커브 기반의 알고리즘이 제안되었지만, 이 알고리즘들은 서비스 지연과 대역폭간 제한된 분리밖에 지원하지 못한다. 본 논문에서는 서비스 지연과 대역폭을 분리하여 독립적으로 처리함으로 써, 각 세션에게 세션의 트래픽 특성에 맞게 서비스를 제공해 주는 지연-대역폭 정규화 모델을 제안한다. 이 모델은 서비스를 서비스 지연과 대역폭 측면에서 정의하고, 정의된 서비스를 서비스 가치(Value of Service: VoS)라는 개념을 통해 표현한다. 이 모델과 VoS개념을 이용하여 각 세션에게 지연-대역폭 관점에서 공정한 서비스를 제공하는 스케줄링 알고리즘을 제안한다. 이 알고리즘을 통해, 각 세션에게 지연-대역폭 관점에서 공정서비스, 전송률을 보장하는 서비스를 제공하려고 한다.

• Current Optics and Photonics
• /
• v.1 no.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.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.2
• /
• pp.31-40
• /
• 2004

Diff-Serv(DS) is a mechanism by which network service providers can offer differing levels of network service to different traffic, in so providing quality of service(QoS) to their customers. Because this mechanism has been deployed just for fixed hosts with the Token Bucket mechanism according to AggF(Aggregate Flow) instead of each flow, DS can not suggest effective usability of traffic resources. In this paper, we use WFQ mechanism for traffic conditioner and scheduling method monitoring the AggF and the results will be used to control the next flows coming in TC. So it will control traffic rate dynamically and suggest efficient usability of bandwidth.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.9
• /
• pp.358-365
• /
• 2003

To support Internet traffic efficiently over ATM networks, Guaranteed Frame Rate(GFR) has been proposed in the ATM Forum. GFR provides minimum rate guarantees to VCs and allows any excess bandwidth in the network to be shared among the contending VCs in a fair manner. In this paper, we proposed a new fuzzy logic based buffer management algorithm that provides MCR guarantee and fair sharing to GFR VCs. A key feature of proposed algorithm is its ability to accept or drop a new incoming packet dynamically based on buffer condition and load ratio of VCs. This is achieved by using fuzzy logic controller for the production of a drop factor. Simulation results show that proposed scheme significantly improves fairness and TCP throughput compared with previous schemes.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.6
• /
• pp.1064-1070
• /
• 2010

Korea Department of Defense has been developing Link-K, Korean Joint Tactical Datalink, to support their independent joint operations and trying to enlarge the scope of Link-K tactical message delivery to nodes in IP based tactical networks for sharing situation awareness more broadly. A Link-K tactical message size is too small to fit into an IP packet, inefficiently wasting most of the IP packet space of the low bandwidth IP-based tactical networks. This paper proposes a new Link-K tactical message aggregation and delivery method when tactical messages need to be sent to some nodes located at IP-based tactical networks. With numerical analysis and OPNET simulation studies, we prove the effectiveness and efficiency of the proposed method.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.23 no.3
• /
• pp.257-266
• /
• 2020

It is very important to share tactical information such as video, images, and text messages among soldiers for situational awareness. Under the wireless environment of the battlefield, the available bandwidth varies dynamically and is insufficient to transmit high quality images, so it is necessary to minimize the distortion of the area of interests such as targets. A natural operating method for soldiers is also required considering the difficulty in handling while moving. In this paper, we propose a natural ROI(region of interest) setting and image compression method for effective image sharing among soldiers. We verify the proposed method through prototype system design and implementation of eye gaze detection and ROI-based image compression.

• The Journal of Society for e-Business Studies
• /
• v.9 no.4
• /
• pp.137-155
• /
• 2004

A video-conference system is being utilized in web based application services in various fields due to the widespread use of Internet and the progress of computer technologies. This system should use the public IP address for sharing file and white board and it is difficult to manage the internal network users of the firewall and non-public IP address users. In this paper, we propose an Application Level Gateway which transforms non-public IP address into public IP address. This mechanism is for the internal network users of the firewall or non-public IP address users over the Internet. We also propose a Control Daemon which manages video and audio media dynamically according to network bandwidth. This mechanism can start and terminate a video conference and manage the process of the video conference.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4B
• /
• pp.202-209
• /
• 2005

In this paper, a dynamic TCP-friendly rate control (TFRC) is proposed to adjust the coding rates according to the channel characteristics of the wireless-to-wired network consisting of wireless first-hop channel. To avoid the throughput degradation of multimedia flows traveling through wireless lint the proposed rate control system employs a new wireless loss differentiation algorithm (LDA) using packet loss statistics. This method can produce the TCP-friendly rates while sharing the backbone bandwidth with TCP flows over the wireless-to-wired network. Experimental results show that the proposed rate control system can eliminate the effect of wireless losses in flow control of TFRC and substantially reduce the abrupt quality degradation of the video streaming caused by the unreliable wireless link status.

• Journal of Communications and Networks
• /
• v.6 no.1
• /
• pp.68-77
• /
• 2004

In the near future packet networks should support applications which can not predict their traffic requirements in advance, but still have tight quality of service requirements, e.g., guaranteed bandwidth, jitter, and packet loss. These dynamic characteristics mean that the sources can be made to modify their data transfer rates according to network conditions. Depending on the customer&; needs, network operator can differentiate incoming connections and handle those in the buffers and the interfaces in different ways. In this paper, dynamic QoS-aware scheduling algorithm is presented and investigated in the single node case. The purpose of the algorithm is in addition to fair resource sharing to different types of traffic classes with different priorities ?to maximize revenue of the service provider. It is derived from the linear type of revenue target function, and closed form globally optimal formula is presented. The method is computationally inexpensive, while still producing maximal revenue. Due to the simplicity of the algorithm, it can operate in the highly nonstationary environments. In addition, it is nonparametric and deterministic in the sense that it uses only the information about the number of users and their traffic classes, not about call density functions or duration distributions. Also, Call Admission Control (CAC) mechanism is used by hypothesis testing.