• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.10
• /
• pp.2150-2164
• /
• 1997

Two distinct features required in transport service and protocol to meet new multimedia applications requirements are multicast transmission capability and enhanced QoS facility. In this paper, we presents major functions and facilities of enhanced communications transport service definition supporting these requirements. At first, major fundamental issues, that should be handled to design multi-peer communcation service and protocol, are resoved and applied to design service definition. Secondly, we proposed several new functions for enhanced transport service such as heterogeneous TC establishment, invitation capability, TC-ownership transfer, restriction of transmit concurrency. The detils of proposed enhanced transport service are TC creation, TC invitation, TC join, multicase data transfer, pause of data transfer, resulme of data transfer, report of specific status, TC leave, TC termination, TC-ownership transfer, Token transfer services. The proposed transport service was submitted and accepted as a draft text for committee draft of international standard by the international standradization body such as JTC1/SC6 and ITU-T SG 7.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.10
• /
• pp.2191-2204
• /
• 1997

An efficient packet transmit scheduling algorithm should be able to allocate the resource to each connection fairly based on the bandwidth and quality of service requirements negotiated during the call admission procedure and it should be able to isolate the effects of users that are behaving badly. In this paper, we propose an effective round-robin packet transmit scheduling mechanism, which we call the delay tolerant packet reserving scheme (DTPRS) based on delay QoS requirments. The proposed scheme can not only provide fairness and but also reduce delay, delay variation, and packet loss rate by reserving output link time slots of delay tolerant packets and assigning the reserved slotsto delay urgent packets. Our scheme is applicable to high speed networks including ATM network because it only requires O(1) work to process a packet, and is simple enough to implement.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.1C
• /
• pp.76-88
• /
• 2012

Traffic classification for application services in military communication networks is one of the core requirements to provide efficient resource management for NCW operations. Though several standards and organizations provided their own traffic classification methods, the methods have been mainly focused on commercial services, but not reflected military specifics. In addition, though various military application services have been emerged, some of those services have been classified into different traffic classes due to implicit criteria for the classification among organizations. In this paper, we propose a methodology to classify traffic classes and to determine delivery requirements for military application services based on various standards by DoD as well as several commercial standards based on Y.1541. The validation of the proposed methodology was carried out by comparing the results by proposed one with the traffic classification suggestions by existing commercial standards, DoD and FCS. We expect that the proposed methodology can contribute to achieve efficient operations of limited military network resources, since the proposed method can provide systematic and consistent way to assign traffic classes for new and existing military applications services.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3B
• /
• pp.274-287
• /
• 2009

In the Internet environment in which best-effort services are provided, we need to guarantee end-to-end performance rather than hop performance to provide services with a variety of QoS(Quality of Service) requirements. The end-to-end performance is affected by many factors along the path of traffic flow. Most existing simulation studies are concentrated on a single node or a few nodes. We need much different approach considering the simulation execution time to simulate a large-scale network. In this paper, we derive requirements and present methodologies for the implementation of the simulator to simulate it. Then, we design and implement our simulator using OPNET. Performance evaluation is carried out using the simulator for large-scale KII (National Information Infrastructure in Korea). We use a self-similar traffic model and present some results on the end-to-end performance metric for the networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.27 no.1
• /
• pp.62-68
• /
• 2023

An aerial relay system utilizing an unmanned aerial vehicle(UAV) or drone is addressed for event-driven operations such as temporary communication services for disaster affected area, military and first responder support. UAV relay system (URS) targets to provide a reliable communication service to a remote user equipment or an operator, therefore, a fast UAV placement to guarantee a minimum quality of service(QoS) is important when an operation is requested. Researches on UAV utilization in communication systems mostly target to derive the optimal position of UAV to maximize the performance, however, fast deployment of UAV is much more important than optimal placement under emergency situations. To this end, this paper derives the feasible area for UAV placement, investigates the effect of performance requirements on that area, and suggests UAV placement to certainly guarantee the performance requirements. Simulation results demonstrate that the feasible area derived in this paper matches that obtained by an exhaustive search.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.10
• /
• pp.2376-2394
• /
• 2013

In order to ensure both of the whole system capacity and users QoS requirements in heterogeneous wireless networks, admission control mechanism should be well designed. In this paper, Multi-agent Q-learning based Admission Control Mechanism (MQACM) is proposed to handle new and handoff call access problems appropriately. MQACM obtains the optimal decision policy by using an improved form of single-agent Q-learning method, Multi-agent Q-learning (MQ) method. MQ method is creatively introduced to solve the admission control problem in heterogeneous wireless networks in this paper. In addition, different priorities are allocated to multiple services aiming to make MQACM perform even well in congested network scenarios. It can be observed from both analysis and simulation results that our proposed method not only outperforms existing schemes with enhanced call blocking probability and handoff dropping probability performance, but also has better network universality and stability than other schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.1260-1281
• /
• 2015

As the number of services available on the Web increases, it is vital to be able to identify which services can be trusted. Since there can be an extremely large number of potential services that offer similar functionality, it is challenging to select the right ones. Service requestors have to decide which services closelysatisfy their needs, and theymust worry about the reliability of the service provider. Although an individual service can be trusted, a composed service is not guaranteed to be trustworthy. In this paper, we present a trust model that supports service discovery and composition based on trustworthiness. We define a method to evaluate trust in order to discover trustworthy services. We also provide a method to perform trust estimation for dynamic service composition, and we present results of two experiments. The proposed model allows for service requestors to obtain the most trustworthy services possible. Our mechanism uses direct and indirect user experience to discover the trustworthiness of the services and service providers. Moreover, composing services based on quantitative trust measurements will allow for consumers to acquire a highly reliable service that meet their quality and functional requirements.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.9
• /
• pp.911-920
• /
• 2004

Intensive studies have been made in the area of VOD server. Multimedia files in the VOD sever are characterized with the large volume of data, the requirements of synchronization and real-time playback of streams. The basic goal of the study is to find an efficient mechanism to allow maximum number of users under the limited resources such as Bu11er size and disk bandwidth. we propose a efficient user-grouping policy for multi-casting services with dynamic monitoring and management of VOD sever resources. Simulation results show that the rate of buffer usage and QOS change of proposed scheme are about 23% performance improved than that of traditional methods. This implies that our method can allow much more users for given resources.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11B
• /
• pp.1023-1030
• /
• 2003

In this paper, we deal with an effective dynamic bandwidth allocation(DBA) scheme in order to support the qualify of services (QoS) in the customer access network which supports various applications with own service requirements. we discuss the DBA scheme for upstream traffic in the EPON which support both the delay sensitive traffic such as voice and real-time video and non-real time traffic such as data and BE. We propose the new DBA scheme which guarantee the delay performance of the real time traffic and utilize the upstream bandwidth effectively in the limited resource environment. We analize the delay performance of the proposed scheme by simulation.

• Journal of Communications and Networks
• /
• v.12 no.4
• /
• pp.334-345
• /
• 2010

In this paper, we study optimal tradeoffs of achievable throughput versus consumed power in wireless ad-hoc networks formed by a collection of multiple antenna nodes. Relying on adaptive modulation and/or dynamic channel coding rate allocation techniques for multiple antenna systems, we examine the maximization of throughput under power constraints as well as the minimization of transmission power under throughput constraints. In our examination, we also consider the impacts of enforcing quality of service requirements expressed in the form of channel coding block loss constraints. In order to properly model temporally correlated loss observed in fading wireless channels, we propose the use of finite-state Markov chains. Details of fading statistics of signal-to-interference-noise ratio, an important indicator of transmission quality, are presented. Further, we objectively inspect complexity versus accuracy tradeoff of solving our proposed optimization problems at a global as oppose to a local topology level. Our numerical simulations profile and compare the performance of a variety of scenarios for a number of sample network topologies.