• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.37-44
• /
• 2005

This paper proposes a hybrid scheme for dynamic bandwidth allocation(DBA) in Ethernet passive optical network(EPON), which combines advantages of adaptive cycle and constant cycle-based schemes. The proposed scheme is based on IPACT scheme, but it operates as adaptive cycle or constant cycle mode according to the queue status of optical line terminal(OLT) for downstream transmission. Simulation results showed that the proposed scheme could achieve a similar throughput in downstream transmission to a constant cycle-based DBA scheme, while producing a similar delay performance to the IPACT scheme in upstream transmission.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.17-24
• /
• 2005

Traditional Internet applications such as FIP and E-mail are increasingly sharing bandwidth with newer, more demanding applications such as Web browsing, IP telephony, video conference and online games. These new applications require Quality of Service (QoS), in terms of delay, loss and throughput that are different from QoS requirements of traditional applications. Unfortunately, current Active Queue Management (AQM) approaches offer monolithic best-effort service to all Internet applications regardless of the current QoS requirements. This paper proposes and evaluates a new AQM technique, called MCDT that provides dynamic and separated buffer threshold for each Applications, those are FTP and e-mail on TCP traffic, streaming services on tagged UDP traffic, and the other services on untagged UDP traffic. Using a new QoS metric, our simulations demonstrate that MCDT yields higher QoS in terms of the delay variation and a packet loss than RED when there are heavy UDP traffics that include streaming applications and data applications. MCDT fits the current best-effort Internet environment without high complexity.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.5
• /
• pp.44-56
• /
• 2009

Multimedia streaming service is susceptible to loss and delay of data as it requires high bandwidth and real time processing. Therefore QoS cannot be guaranteed due to data loss caused by heavy network traffic and error of wireless channel. To solve these problems, studies about algorithms which improve the quality of multimedia by serving differently according to the priority of packets in multimedia stream. Two algorithms are proposed in this paper. The first algorithm proposed is WMS-1(Wireless Multimedia Scheduling-1) algorithm which acts like IWFQ when any wireless loss is occurred but assigns channels first in case of urgent situation like when the running time of multimedia runs out. The second algorithm proposed is WMS-2(Wireless Multimedia Scheduling-2) algerithm that assigns priority to multimedia flow and schedules flow that has higher priority according to type of frame first. The comparison with other existing scheduling algorithms shows that multimedia service quality of the proposed algorithm is improved and the larger the queue size of base station is, the better total quality of service and fairness were gained.

• Journal of Digital Contents Society
• /
• v.10 no.2
• /
• pp.357-365
• /
• 2009

To effectively exploit the underlying network bandwidth while maximizing user perceivable QoS, mandatory to make proper estimation on packet loss and queuing delay of the underling network. This issue is further emphasized in wireless network environment where network bandwidth is scarce resource. In this work, we focus our effort on developing performance model for wireless network. We collect packet trace from actually wireless network environment. We find that packet count process and bandwidth process in wireless environment exhibits long range property. We extract key performance parameters of the underlying network traffic. We develop an analytical model for buffer overflow probability and waiting time. We obtain the tail probability of the queueing system using Fractional Brown Motion (FBM). We represent average queuing delay from queue length model. Through our study based upon empirical data, it is found that our performance model well represent the physical characteristics of the IEEE 802.11b network traffic.

• Journal of the Korea Society for Simulation
• /
• v.23 no.1
• /
• pp.1-10
• /
• 2014

A cloud computing is one of a parallel and distributed computing. The cloud computing provides some service for user with virtual resources. However, a user's service request does not show a time pattern. As a result, each resource also shows a different availability at the same time. This difference affects a quality of service (QoS) and a resource selection for users. Therefore, we propose the resource availability-based multi auction model for cloud service reservation and resource brokering system. The proposed system is to select the proper resource provider based on the users' request. The proposal adopts the multi phase of the auction to transact resources. The system evaluates the available factor of each resource on the auction phase, and finally reserves the service on the adaptive queue. The proposed model shows the better performance than other existing method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2B
• /
• pp.146-153
• /
• 2006

It is required to have researches on efficient resource allocation schemes in an integrated voice and data CDMA system with the spreading of high-speed wireless internets. In this paper, we proposed a efficient resouce allocation scheme for providing a high speed data service in an integrated CDMA system. In an integrated voice/data CDMA system, resources for voice users are allocated with high priority and residual resources are allocated to the data service. In this case, it is necessary to use a resource allocation scheme for minimizing interference. In this paper, we first explain about a interference minimizing method and define QoS requirements. Based on the method, we proposed a efficient resource allocation scheme which satisfy the QoS requirements. The proposed scheme controls the transmission rate and delay of data users with a priority information such as the number of packets in a queue. From the simulation results, we show that the proposed scheme reduce the blocking probability and delay and improve the performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5B
• /
• pp.498-508
• /
• 2009

In wireless mobile environments, large bandwidth and high QoS (Quality of Service) are recently required to support the increased demands for multimedia services. LTE (Long Term Evolution) is one of the promising solutions for the next generation broadband wireless access systems. To efficiently use downlink resource and effectively support QoS, packet scheduling algorithm is one of the important features in LTE system. In this paper, we proposed DAPS (Delay-Aware Packet Scheduling) algorithm to consider QoS requirements of delays for various traffic classes as well as channel condition and fairness. To reflect delay experiences at scheduling instance, DAPS observes how queue waiting time of packet is closed to maximum allowable delay. The simulation results show that the DAPS algorithm yields better performance for delay experience by increasing the number of transmitted packets with satisfying the required delay time compared with existing scheduling algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3A
• /
• pp.219-224
• /
• 2008

In the c-DSDV routing protocol proposed to improve the scalability of DSDV, clusterheads manage a routing table that has only clusterheads as potential destinations and flood update request message to its neighbor clusterheads periodically or at the time of topology change. Accordingly, the convergence range of topology change by a single update request message was expanded nine times as wide as that of DSDV, increasing routing correctness; however, c-DSDV suffers from the congestion of clusterheads since data packets always go through clusterheads of the clusters on the routing path. To improve this problem, we propose an adaptive routing scheme that judges if detouring clusterhead is possible on the fly while packets are forwarded. As a result, a routing path length is shortened and an end-to-end delay is improved by the reduced queue length. It shows that the end-to-end delay is reduced by almost 40% through simulation.

• Journal of the Korean Institute of Navigation
• /
• v.10 no.1
• /
• pp.101-127
• /
• 1986

Transportation provides an infrastructure vital to economic growth, and it is an integral part of production . As a port is the interface between the maritime transport and domestic transport sectors, it certainly plays a key role in any economic development. Therefore, it is doubtless that inadequacy of a nation's port will depress the level of throughput, to the level where it fails to meet the target set by the national economic planning schemes. Korea is surrounded by the seas and the economic structure of Korea consists of processing trades, so that it cannot be overstated that substantial economy in maritime transport coasts can be achieved through the improvement of the port transport system. This paper treats the transportation process in Pusan Port by Queueing Simulation method, and the reasonable size of Pusan Port is suggested from the point of view of efficiency maximization. The results of the analysis are summarized as follows; 1) the utility rate is 47.91 percents in general piers, 85-52 percents in container piers, and waiting time 5.2hrs, in general piers, 0.8 hrs, in container piers, and the probability of maximum queue length 12 ships in general piers, 2 ships in container piers, and the probability of waiting is 44 percents in general piers, 8 percents in container pier. 2) in general piers, the improvement of app. 30 percents in port capacity is desirable for operating effectively concerning the current arrival rate. By introducing the traffic control ion container piers, there is no apparent necessity of port investment, but I is expected to reduce invisible congestion occurred along the waiting line. 3) On Pusan Port, the optimal utility rate and the optimal arrival rate for reducing waiting time are 3.5 to 4.0(hrs./ship) in general piers, 5.1 to 6.0(hrs./ship) in container piers.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1C
• /
• pp.67-77
• /
• 2007

Virus throttling technique, one of many early worm detection techniques, detects Internet worm propagation by limiting connect requests within a certain ratio. The typical virus throttling controls the period of rate limiter autonomically by utilizing weighted average delay queue length to reduce connection delay time without hanving a large effect on worm detection time. In the existing virus throttling research, a minimum period of variable rate limiter is fired and a turning point which is a point that the period of rate limiter has been being decreased and starts to be increased is also fixed. However, these two performance factors have different effects on worm detection time and connection delay. In this paper, we analyze the effect of minimum period and turning point of variable rate limiter, and then propose an algorithm which determines values of performance factors by referencing current traffic pattern. Through deep experiments, it is verified that the proposed technique is more efficient in respect of reducing worm detection time and connection delay than the existing virus throttling which fixed the performance factors.