• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.3
• /
• pp.1-7
• /
• 2009

At a Internet service provider(ISP), field human resources visit many customers sites to provide multimedia services to customers in ubiquitous environment. Scheduling the resources is a hard problem because there are many tasks which have to be done by the resources and the number of the resources is not sufficient. To tackle this problem, ISPs had used team-based scheduling system. However, this aporoach was not sufficient to reduce the number of frequent changes of arrival time and could not increase operational efficiency. We also developed an optimal resource selection algorithm based on statistical information when an operator assigns a task to the resource. After we adopted this algorithm to the real world, the resources can do more tasks in a day.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.8
• /
• pp.1114-1122
• /
• 2018

In this paper, we propose a theoretical framework for provisioning marginal resources in wired and wireless computer networks which include Internet. In more detail, we propose a mathematical model for the upper bounds of marginal capacity in grid networks, where the resource is designed a priori by normal traffic estimation and marginal resource is prepared for unexpected events such as natural disasters and abrupt flash crowd in public affairs. To be specific, we propose a method to evaluate an upper bound for minimum marginal capacity for an arbitrary grid topology using the concept of a strong Roman domination number. To that purpose, we introduce a graph theory to model and analyze the characteristics of general grid structure networks. After that we propose a new tight upper bound for the strong Roman domination number. Via a numerical example, we show the validity of the proposition.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3B
• /
• pp.207-215
• /
• 2006

It has known that the handover based on MIP in mobile environments has many constraints for proving seamless service due to well hon problems. Although there has been researching for the solutions, such as MRSVP and HMRSVP etc, it is difficult to do the research related with QoS due to the issues based on MIP used as a seamless mobility. In this paper, the seamless provides in a mobility based on SCTP, which is applied by IntServ for end-to-end QoS service. The paper also proposes the path management scheme for saving reservation cost. the scheme searches a new path on the moving mobile terminal and reserves the resources on the path for providing seamless QoS service. The paper is also analyzed on the comparition between a SCTP based and MIP based solutions. the scheme is evaluated using the cost effect saved for resource reservation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.6
• /
• pp.466-475
• /
• 2014

The IVEF service is the draft standard designed for exchange of information on sea traffic between the vessel traffic systems and between the vessels. Standardization of this service is under way as a part of the next-generation navigation system, called e-Navigation. The International Association of Lighthouse Authorities (IALA) suggests, on its recommendation V-145, the IVEF service model and the protocol for provisioning of this service. But the detailed configuration of this service must be designed by the users. This study suggests, based on the basic service model and protocol provided in the recommendation V-145, the implementation of the J-VTS middleware which will facilitate exchange of information on sea traffic. The J-VTS middleware consists of various components for providing the IVEF service and for processing the IVEF message protocols. The vessel traffic systems and the vessels corresponding to upper-layer applications may use the IVEF service with the functions provided by the J-VTS middleware, and the services are designed to be accessed according to the security level of users.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.6
• /
• pp.1245-1258
• /
• 2012

This study is about development of technology for electronic government of S. Korea with cloud computing analysed by the application of scenario planning. As a society of knowledge and information has been developed rapidly, because of changing from web environment to ubiquitous environment, a lot of countries across the world as well as S. Korea for e-Government have a variety of changes with cloud computing service. So this research focused on the strategy consulting of e-Government of S. Korea with development of cloud computing technology analysed by the application of 'scenario planning' as a foresight method. As a result, the future policy for development of cloud computing technology for electronic government of S. Korea is to further spur the development of technology for hard ware and internet data center as SLA(Service Level Agreement) and service provisioning, more improvement of level of technology with soft ware solution as resource virtualization, open API(Application Programming Interface).

• Current Optics and Photonics
• /
• v.1 no.5
• /
• pp.456-467
• /
• 2017

The benefits of network coding in all-optical multicast networks have been widely demonstrated. In this paper, we mainly discuss the multicast service efficiently provisioning problem in the network coding enabled elastic optical networks (EONs). Although most research on routing and spectrum allocation (RSA) has been widely studied in the elastic optical networks (EONs), rare research studies RSA for multicast in the network coding enabled EON, especially considering the time delay constraint. We propose an efficient heuristic algorithm, called Network Coding based Multicast Capable-Multipath Routing and Spectrum Allocation (NCMC-MRSA) to solve the multipath RSA for multicast services in the network coding enabled EON. The well-known layered graph approach is utilized for NCMC-MRSA, and two request ordering strategies are utilized for multiple multicast requests. From the simulation results, we observe that the proposed algorithm NCMC-MRSA performs more efficient spectrum utilization compared with the benchmark algorithms. NCMC-MRSA utilizing the spectrum request balancing (SRB) ordering strategy shows the most efficient spectrum utilization performance among other algorithms in most test networks. Note that we also observe that the efficiency of NCMC-MRSA shows more obvious than the benchmark algorithm in large networks. We also conduct the performance comparisons of two request ordering strategies for NCMC-MRSA. Besides, we also evaluate the impact of the number of the linkdisjoint parallel w paths on the spectrum utilization performance of the proposed algorithm NCMC-MRSA. It is interesting to find that the change of the parameter w in a certain range has a significant impact on the performance of NCMC-MRSA. As the parameter w increases to a certain value, the performances of NCMC-MRSA cannot be affected by the change of w any more.

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

DiffServ supports aggregated traffic classes to provide various QoS to different classes of traffics. However, current DiffServ specifications do not have a complete QoS management framework. It is possible to lead to serious QoS violations without a QoS management support. From this reasoning, a QoS management system that can manage differentiated QoS provisioning is required. This paper proposes and implements a policy-based QoS management platform for differentiated services networks, which specifies QoS policies to guarantee dynamic QoS requirements. The implementation of the proposed platform is built on W framework and uses XML to represent and validate high-level QoS policies. High-level QoS policies are represented as valid XML documents and are mapped into Em beans of the EJB-based policy server of the platform. The policy distribution and the QoS monitoring are processed using SNMP.

• Journal of Communications and Networks
• /
• v.15 no.1
• /
• pp.61-70
• /
• 2013

The increasing number of mobile users and the popularity of real-time applications make wired-wireless integrated network extremely attractive. In this case, quality of service (QoS) adaptability is particularly important since some important features of the integrated network call for QoS adaptability, such as mobility, bursty applications and so on. Traditional QoS schemes include integrated service (IntServ) and differentiated service (DiffSev) as well as their variants. However, they are not able to balance well between scalability and QoS granularity. For example, IntServ faces the scalability problem, while DiffServ can only provide coarse granular QoS. In addition, they are also unable to efficiently support QoS adaptability. Therefore, a per-packet differentiated queueing service (DQS) was proposed. DQS was originally proposed to balance between scalability and QoS granularity in wired networks and then extended to wireless networks. This paper mainly discusses how to use DQS to support QoS adaptability in wired-wireless integrated networks. To this end, we propose a scheme to determine dynamic delay bounds, which is the key step to implement DQS to support QoS adaptability. Simulation studies along with some discussions are further conducted to investigate the QoS adaptability of the proposed scheme, especially in terms of its support of QoS adaptability to mobility and to bursty real-time applications.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.1
• /
• pp.41-47
• /
• 2002

Path setup considering QoS is one of the main problems to solve in Internet traffic engineering. In network restoration that is one of the traffic engineering components, to establish a backup path or backup path for a working path to be protected is the main task. The backup path should have enough bandwidth to guarantee the working paths. Thus this work requires the QoS routing solution that is to set up a backup path as well as a working path at the same time provisioning enough bandwidth. In this paper, we propose an algorithm to setup a backup path that shares the bandwidth of other backup paths whose working path does not pass along the same link with the working path we are considering. In this way we can reduce much bandwidth consumption caused by setting up backup paths. We also analyze the disjoint path computation algorithms. Finally we show simulation results how the algorithm can reduce the bandwidth consumption and how it will affect blocking when we setup paths.

• Journal of the Institute of Convergence Signal Processing
• /
• v.7 no.2
• /
• pp.60-64
• /
• 2006

In typical video streaming services such as MPEG encoded video, the transmission data sizes change depending on the frame types and the required bandwidth for QoS support also changes as time passes. Accordingly, in video streaming services using the Internet it could happen that the video services stop occasionally due to instantaneous deficiencies of the required bandwidth under unexpected congestion even if the highest priority is allocated to the service by network administration. In this paper, we investigate several methods for bandwidth allocation and traffic engineering to support MPEG video traffic and propose a new method to reduce the transmission delay and enhance the throughput, there by provisioning the QoS requirements. In the proposed scheme, LSPs are established based on temporal variation patterns of the Internet traffic and the CQ_LLQ policing scheme is applied for traffic shaping at the ingress routers. Finally we verified the performance of the proposed scheme via computer simulations using OPNET.