• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.2
• /
• pp.241-249
• /
• 1998

In this paper, we seek to find an optimal allocation of link capacity in a data communication network. The architecture of the data communication network considered in the study is an online-service network based on public switched telephone network(PSTN) and packet switched data network(PSDN). In designing the architecture of the network, we need to deal with various measures of quality of service(QoS). Two important service measures are the call blocking probability in PSTN and the data transfer delay time in PSDN. Considering the tradeoff between the call blocking probability and the data transfer delay time in the network, we have developed the optimal link capacity allocation model that minimizes the total link cost, while guarantees the call blocking probability and the data transfer delay time within an acceptable level of QoS. This problem can be formulated as a non-linear integer programming model. We have solved the problem with tabu search and simulated annealing methods. In addition, we have analyzed the sensitivity of the model and provided the insight of the model along with computational results.

• Korean Journal of Optics and Photonics
• /
• v.12 no.2
• /
• pp.129-134
• /
• 2001

Novel supervisory system for WDM transmission link using conventional optical time domain reflectometry was presented. By modifying the structure of erbuim doped fiber amplifier to support bi-directional transmission at arDR pulse wavelength and launching the optical pulse into transmission link in the opposite direction of data signal propagation to avoid the distortion by cross-gain modulation, it is possible to monitor the WDM link in service. To prove the validity of proposed scheme, the supervision result of 2.5 Gbps $\times$ 8 channel WDM 320 km transmission system in service by arDR was presented. And power penalty due to monitoring was measured as smaller than 0.3 dB. .3 dB.

• Journal of Communications and Networks
• /
• v.8 no.2
• /
• pp.241-252
• /
• 2006

Traditional service-level agreements (SLAs), defined by average delay or packet loss, often camouflage the instantaneous performance perceived by end-users. We define a set of metrics for service availability to quantify the performance of Internet protocol (IP) backbone networks and capture the impact of routing dynamics on packet forwarding. Given a network topology and its link weights, we propose a novel technique to compute the associated service availability by taking into account transient routing dynamics and operational conditions, such as border gateway protocol (BGP) table size and traffic distributions. Even though there are numerous models for characterizing topologies, none of them provide insights on the expected performance perceived by end customers. Our simulations show that the amount of service disruption experienced by similar networks (i.e., with similar intrinsic properties such as average out-degree or network diameter) could be significantly different, making it imperative to use new metrics for characterizing networks. In the second part of the paper, we derive goodness factors based on service availability viewed from three perspectives: Ingress node (from one node to many destinations), link (traffic traversing a link), and network-wide (across all source-destination pairs). We show how goodness factors can be used in various applications and describe our numerical results.

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

Recently IPTV service is penetrating to the ordinary home users very swiftly. One of the first phase of IPTV service is considered to be VoD, and a nationwide availability of the VoD service imposes tremendous pressure to the network resource due to its requirements for the broad bandwidth, the inherent nature of unicast technology, and the large scalability, etc. This work suggests a novel and practical method to the design of network resource for the VoD service. Especially, we explore the distributed content storage problem that takes into account the popularity of the video contents and its corresponding link dimensioning problem that takes into account the grade of service for the flow level quality of service about the VoD service. By assuming a realistic topology for the nationwide IP backbone network of Korea, which is a typical tree topology, we suggest an analytic method for the design of VoD service.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.25 no.6
• /
• pp.1515-1523
• /
• 2015

It has been prevalent to be serviced through WLAN(Wireless Local Area Network) as a variety of mobile devices have been introduced. If the number of mobile devices increases rapidly for the network access in a limited range of ESS(Extended Service Set), a lengthy connection delays are induced due to the initial link setup process of the IEEE 802.11i which is WLAN security standard. In this paper, we propose a new initial link setup protocol which can be executed in the ESS area of WLAN.

• Journal of Communications and Networks
• /
• v.8 no.4
• /
• pp.410-421
• /
• 2006

In this work, we propose an analytic framework for dimensioning the link capacity of broadband access networks which provide universal broadband access services to a diverse kind of customers such as patient and impatient customers. The proposed framework takes into account the flow-level quality of service (QoS) of a connection as well as the packet-level QoS, via which a simple and systematic provisioning and operation of the network are provided. To that purpose, we first discuss the necessity of flow-aware network dimensioning by reviewing the networking technologies of the current and future access network. Next, we propose an analytic model for dimensioning the link capacity for an access node of broadband convergence networks which takes into account both the flow and packet level QoS requirements. By carrying out extensive numerical experiment for the proposed model assuming typical parameters that represent real network environment, the validity of the proposed method is assessed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.7 no.4
• /
• pp.173-176
• /
• 1982

Point-to-point congestion, a criterion by which service quality in a communication network is estimated, Can be obtained by single moment method of analysis, point-to-point congestion can be computed by link blocking probability in turn is calculated by link offered traffic. Consequently, exact calculation of link offered traffic is vital to analysis of communication network. In this paper a fomula which facilitaties the calculation of link offered traffic in the limited available state of links, is derived.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10A
• /
• pp.1501-1506
• /
• 1999

DSRC(Dedicated Short Range Communications), which is a radio mobile communication protocol in ITS, is suited for traffic related information services. But in WAC(Wide-Area wireless communications), we could consider a conventional communication infrastructure in the case of supporting other applications besides ITS. Especially considering the current the trends to introduce wireless internet service into the mobile communication network, wireless internet service in ITS system is valuable. Although ITS LLC(Logical Link Control) protocols recommended by Europe and Japan are effective for traffic related services, it is not suitable for services related with geographical information, image or internet. That is because the data traffic characteristics is changed according to service types. Therefore we suggest a logical link control algorithm effective for traffic information related services as well as internet web service, and analyze its performance. As a result of numerical analysis and simulation, proposed algorithm shows larger performance improvements. For traffic information related services, the performance of DSRC LLC recommended by Europe and Japan is the same as that of proposed LLC protocol. However, for wireless internet web service, the performance of proposed protocol is much better than that of LLC protocol used in Europe and Japan.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.11
• /
• pp.902-910
• /
• 2013

The most representative research network in Korea, KREONET, has developed DynamicKL, an advance reservation based Network Service Agent (NSA) for user driven virtual circuit services. DynamicKL provides reservation, provisioning, release, termination, and inquiry web services for network resources by using an open standard network service interface (NSI), as well as web services for network resources by using a GUI interface. In addition, it has the RICE interface to support a protection management function per VC for virtual circuits and reservations. In this article, a protection management per VC for provisioned VCs and reservations is addressed in the DynamicKL framework, as a contribution to the VC protection management issue, which results in more manageable and reliable VC services compared to other advance reservation frameworks. An administrator can detect successful or unsuccessful VC protections in the event of a primary link failure and successful or unsuccessful VC retrievals after a primary link repair, by using RICE.

• Journal of Communications and Networks
• /
• v.4 no.3
• /
• pp.209-220
• /
• 2002

In this paper, we propose a hierarchical packet scheduling technique to closely approximate a hierarchical extension of the generalized processor sharing model, Hierarchical Generalized Processor Sharing (H-GPS). Our approach is to undertake the tasks of service guarantee and hierarchical link sharing in an independent manner so that each task best serves its own objective. The H-GPS model is decomposed into two separate service components: the guaranteed service component to consistently provide performance guarantees over the entire system, and the excess service component to fairly distribute spare bandwidth according to the hierarchical scheduling rule. For tight and harmonized integration of the two service components into a single packet scheduling algorithm, we introduce two novel concepts of distributed virtual time and service credit, and develop a packet version of H-GPS called Hierarchical Fair Queueing (HFQ). We demonstrate the layerindependent performance of the HFQ algorithm through simulation results.