• Annual Conference of KIPS
• /
• 2008.11a
• /
• pp.1332-1335
• /
• 2008

In order to various service types of real time and non-real time traffic with varying requirements are transmitted over the IEEE 802.16 standard is expected to provide quality of service(QoS) researchers have explored to provide a queue management scheme with differentiated loss guarantees for the future Internet. The sides of a packet drop rate, an each class to differential drop probability on achieving a low delay and high traffic intensity. Improved a queue management scheme to be enhanced to offer a drop probability is desired necessarily. This paper considers multiple random early detection with differential drop probability which is a slightly modified version of the Multiple-RED(Random Early Detection) model, to get the performance of the best suited, we analyzes its main control parameters (max_th, min_th, max_p) for achieving the proportional loss differentiation (PLD) model, and gives their setting guidance from the analytic approach. we propose Dynamic-multiple queue management scheme based on differential drop probability, called Dynamic-VQSDDP(Variable Queue State Differential Drop Probability)T, is proposed to overcome M-RED's shortcoming as well as supports static max_p parameter setting values for relative and each class proportional loss differentiation. M-RED is static according to the situation of the network traffic, Network environment is very dynamic situation. Therefore max_p parameter values needs to modify too to the constantly and dynamic. The verification of the guidance is shown with figuring out loss probability using a proposed algorithm under dynamic offered load and is also selection problem of optimal values of parameters for high traffic intensity and show that Dynamic-VQSDDP has the better performance in terms of packet drop rate. We also demonstrated using an ns-2 network simulation.

• Journal of Korean Society of Transportation
• /
• v.22 no.3 s.74
• /
• pp.145-157
• /
• 2004

The cycle length design model of the Korean traffic responsive signal control systems is devised to vary a cycle length as a response to changes in traffic demand in real time by utilizing parameters specified by a system operator and such field information as degrees of saturation of through phases. Since no explicit guideline is provided to a system operator, the system tends to include ambiguity in terms of the system optimization. In addition, the cycle lengths produced by the existing model have yet been verified if they are comparable to the ones minimizing delay. This paper presents the studies conducted (1) to find shortcomings embedded in the existing model by comparing the cycle lengths produced by the model against the ones minimizing delay and (2) to propose a new direction to design a cycle length minimizing delay and excluding such operator oriented parameters. It was found from the study that the cycle lengths from the existing model fail to minimize delay and promote intersection operational conditions to be unsatisfied when traffic volume is low, due to the feature of the changed target operational volume-to-capacity ratio embedded in the model. The 64 different neural network based cycle length design models were developed based on simulation data surrogating field data. The CORSIM optimal cycle lengths minimizing delay were found through the COST software developed for the study. COST searches for the CORSIM optimal cycle length minimizing delay with a heuristic searching method, a hybrid genetic algorithm. Among 64 models, the best one producing cycle lengths close enough to the optimal was selected through statistical tests. It was found from the verification test that the best model designs a cycle length as similar pattern to the ones minimizing delay. The cycle lengths from the proposed model are comparable to the ones from TRANSYT-7F.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.5
• /
• pp.1080-1086
• /
• 2014

In this paper, we analyze the tradeoff performance of a consensus algorithm when it is applied to the CSMA/CA-based distributed wireless network. The consensus algorithm has a faster convergence speed as the number of cooperating neighbors increases, but the transmission delay on the wireless network increases due to access collisions as the number of cooperating neighbors increases. Therefore, there exists a tradeoff relationship between these two performances and so there exists an optimal number of cooperating neighbors that minimizes the consensus time. The result for the optimal number of neighbors according to the number of nodes that participate in the consensus shows that it is optimal for all nodes to cooperate together in the small-scale network but it is optimal to limit the number of neighbors to a fixed value in the large-scale network with nodes greater than a certain value.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4287-4306
• /
• 2016

Network resilience provides an effective way to overcome the problem of network failure and is crucial to Internet protocol (IP) network management. As one of the main challenges in network resilience, recovering from link failure is important to maintain the constancy of packets being transmitted. However, existing failure recovery approaches do not handle the traffic engineering problem (e.g., tuning the routing-protocol parameters to optimize the rerouting traffic flow), which may cause serious congestions. Moreover, as the lack of QoS (quality of service) restrictions may lead to invalid rerouting traffic, the QoS requirements (e.g., bandwidth and delay) should also be taken into account when recovering the failed links. In this paper, we first develop a probabilistically correlated failure model that can accurately reflect the correlation between link failures, with which we can choose reliable backup paths (BPs). Then we construct a mathematical model for the failure recovery problem, which takes maximum rerouting traffic as the optimizing objective and the QoS requirements as the constraints. Moreover, we propose a heuristic algorithm for link failure recovery, which adopts the improved k shortest path algorithm to splice the single BP and supplies more protection resources for the links with higher priority. We also prove the correctness of the proposed algorithm. Moreover, the time and space complexity are also analyzed. Simulation results under NS2 show that the proposed algorithm improves the link failure recovery rate and increases the QoS satisfaction rate significantly.

• Journal of Advanced Navigation Technology
• /
• v.19 no.3
• /
• pp.217-223
• /
• 2015

This paper describes the design and implementation of a network system for UAV for multiple clients that enables long-range operation based on a commercial mobile network. A prototype data modem is developed with a commercial embedded M2M module in order to provide an access to the mobile network. A central server with a database is constructed to record all of real-time flight and video data and communicate with a ground control system. A GCS is developed for the central control, the single UAV and the smart phone version to be used for different purposes. Performance tests were progressed for data delay, video frame rate and state of clients. Flight tests were also performed to verify the reliability of the modem with respect to altitude.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.697-710
• /
• 2004

Differentiated services (DiffServ) model has been prevailed as a scalable approach to provide quality of service in the Internet. However, there are difficulties in providing the guaranteed service in terms of end-to-end systems since differentiated services network considers quality of service of aggregated traffic due to the scalability and many researches have been mainly focused on per hop behavior or a single domain behavior. Furthermore quality of service may be time varying according to the network conditions. In this paper, we study dynamic class mapping mechanism to guarantee the end-to-end quality of service for multimedia traffics with the minimum network cost over differentiated services network. The proposed algorithm consists of an effective implementation of relative differentiated service model, quality of service advertising mechanism and dynamic class mapping mechanism. Finally, the experimental results are provided to show the performance of the proposed algorithm.

• The Journal of Society for e-Business Studies
• /
• v.11 no.4
• /
• pp.87-106
• /
• 2006

Today as the scale of e-commerce constantly expands, the number and the amount of the consumer frauds are also increasing very rapidly, without sufficient levels of systematic support to prevent them. Internet Escrow service is one of the promising payment mechanisms, which guarantees secure electronic trades and payments. Especially, if the real-time product delivery information is available via RFID-based track-and-trace environment, the security and efficiency of the Internet Escrow services would be improved a lot. In this research, proposed a novel approach to integrate EPCglobal Network, which is a de-facto standard for RFID-based information network model, with Internet Escrow services. The proposed service model was implemented in the form of "Integrated Financial Platform", which supports the contracts among trading partners and the payment via Escrow services by being fully integrated with bank systems. Using the implemented EPCglobal Network-based Escrow service system, we would be able not only to shorten the money-flow cycle and to develop new kinds of loan services, but also to overcome the problems of existing Escrow services including the lack of product-related information and the delay of purchasing decisions.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.4
• /
• pp.168-180
• /
• 2018

Due to the spread of mobile devices and the introduction of high-quality services, mobile traffic is expected to increase sharply and overload of cellular networks is expected. D2D communication is a way to reduce the load and evolve to 5th generation. Since D2D communication directly communicates between the terminals, it can reduce the overload of the cellular network and improve energy efficiency, data rate and network performance. This paper proposes a D2D handover scheme for D2D communication in cellular networks. The cellular network is a 3GPP EPS, and the proposed D2D handover method improves the existing EPS handover process considering compatibility between existing EPS and D2D communication. We also demonstrate the superiority of the proposed handover scheme using the network simulator ns-3. Simulation results show that the proposed handover scheme is superior to existing handover methods in terms of CUE variation, packet transmission delay time, and throughput.

• The KIPS Transactions:PartC
• /
• v.11C no.6 s.95
• /
• pp.821-828
• /
• 2004

To analyze the usage information of system and network resources to the each grid application by measuring the real time traffic and calculating the statistic information, we suggested the kernel-based monitoring methods by researching the efficient monitoring method. This method use small system resourcesand measure the monitoring information accurately with less delay than the usual packet capture methods such as tcpdump. Also we implemented the monitoring systems which can monitor the used resources of system and network for grid application using the suggested kernel-based monitoring method. This research can give the useful information to the development of grid application and to grid network scheduler which can assign the proper resources to the grid application to perform efficiently. Network administrator can decide whether the expansion of network is required or not using the monitoring information.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.54-57
• /
• 2007

Much researches have studied for seamless mobility service. Those focused on minimizing the delay time due to the handover. In this paper, we suggest seamless mobility service with the network-based preemptive operations. With these operations, if it's found that the MT(Mobile Terminal)'s handover using L2-trigger event, old access network buffers the delivering data. Therefore this can decrease the data drop rates. And also, this can deal with the ping-pong's phenomenon of MT. At the end of MT's movement, these operations can provide seamless mobility service sending buffered data after checking the MT's movement. This mechanism uses MPLS-LSP(MultiProtocol Label Switching-Label Switched Path) in core network for fast process.