• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.9
• /
• pp.19-28
• /
• 2010

The GTS(Guaranteed Time Slot) of the IEEE 802.15.4 standard, which is the contention free access mechanism, is used for low-latency applications or applications requiring specific data bandwidth. But it has some problems such as delay of service due to FIFS(First In First Service) scheduling. In this paper, we proposes a weight based GTS allocation scheme for fair queuing in IEEE 802.15.4 LR-WPAN. The proposed scheme uses a weight that formed by how much more weight we give to the recent history than to the older history for a new GTS allocation. This scheme reduces service delay time and also guarantees transmission simultaneously within a limited time. The results of the performance analysis shows that our approach improves the performance as compared to the native explicit allocation mechanism defined in the IEEE 802.15.4 standard.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.4
• /
• pp.750-760
• /
• 1994

In this paper we proposed a multiplexing scheme of real time and non-real traffics in which a congestion control is embedded. Real time traffics are assumed to be nonqueuable and have preemptive priority over non-real time traffics in seizing the common output link, whereas the non-real time traffics wait in the common buffer if the output link is not available for transmission. Real time traffics are encoded according to the bandwidth reduction strategy, paticularly when congestion occurs among non-real time traffics. This scheme provides us an efficient way for utilizing the costly bandwidth resources, by accommodation as many real time traffics as possible with gauranteeing its mimimum bandwidth requirements, and also resloving the congestion encountered among non-real time traffics. We describe the system as a Markov queueing system, provide the analysis by exploiting the matrix geometric method, and present the performance for various performance measures of interest. Some numerical results are also provided.

• Journal of Satellite, Information and Communications
• /
• v.1 no.1
• /
• pp.12-19
• /
• 2006

In this paper, we propose the bandwidth borrowing scheme which improves the performance of the cal admission control of the integrated GEO satellite networks. In general, target transmission rates of communications and streaming services are fixed, but data services do not have the target transmission rates. Therefore, we can control the transmission rates for data services flexibly according to the system loading situation. When the available bandwidth of the system is insufficient, the bandwidth borrowing scheme gives the bandwidth to request real time services by the transmission rates control of data services through packet scheduler. We make the queueing model for our system model and demonstrate the results through simulations. The simulation results show that there is a 8.7-35.2 dB gain at the total blocking probability according to the use of bandwidth borrowing scheme.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.4
• /
• pp.421-429
• /
• 2000

In present, ATM integrated switching system has been developed to a mixed modules that complexed switching system including maintenance, operation based on B-ISDN/LAN service and plug-in module, , which runs on workstation computer system. Meanwhile, workstation has HMI operation system feature including file system management, time management, graphic processing, TMN agent function. The workstation has communicated with between ATM switching module and clients. This computer system architecture has much burden messages communication among processes or processor. These messages communication consume system resources which are socket, message queue, IO device files, regular files, and so on. Therefore, in this paper we proposed new performance modeling with this system architecture. We will analyze the system bottleneck and improve system performance. In addition, in the future, the system has many additional features should be migrated to workstation system, we need previously to evaluate system bottleneck and redesign it. In performance model, we use queueing network model and the simulation package is used PDQ and C-program.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.6
• /
• pp.17-29
• /
• 1999

In this paper, the prioritized queueing handoff scheme in CDMA (Code Division Multiple Access) cellular system is proposed. Also, the analytical survey for the proposed scheme is carried out, and the performance of this scheme is compared with that of non prioritized scheme and FIFO (First In First Out) queue scheme by computer simulation. The handoff region is defined as the time between the handoff treshold and the receiver threshold, and it is used for the maximum queue waiting time in the proposed scheme. The handoff and the receiver thresholds are defined as rewpectively: 1) the time that the Pilot Strength Measurement Message in the neighbor in the neighbor cell is received to the BS (Base Station) under the T_ADD threshold; and 2) the time that the T_DROP timer is expired and the Pilot Strength Measurement Message in the current cell is received to the BS under the T_DROP threshold. The performance metrics for analyzing the proposed scheme are : 1) probability of forced termination; 2) probability of call blocking; 3) ratio of carried traffic to total offered load; 4) average queue size; 5) average handoff delay time in queue. The simulation results show that the proposed scheme maintains high performance for handoff requests at a small penalty in total system capacity.

• Journal of the Institute of Convergence Signal Processing
• /
• v.7 no.3
• /
• pp.136-142
• /
• 2006

Existing buffer management schemes for shared-memory output queueing switches can be classified into two types: In the first type, some constant amount of memory space is guaranteed to each virtual queue using static queue thresholds. The static threshold method (ST) belongs to this type. On the other hand, the second type of approach tries to maximize the buffer utilization in 머 locating buffer memories. The complete sharing (CS) method is classified into this type. In the case of CS, it is very hard to protect regular traffic from mis-behaving traffic flows while in the case of ST the thresholds can not be adjusted according to varying traffic conditions. In this paper, we propose a new buffer management method called weighted dynamic thresholds (WDT) which can process packet flows based on loss priorities for quality-of-service (QoS) functionalities with fairly high memory utilization factors. We verified the performance of the proposed scheme through computer simulations.

• Journal of Communications and Networks
• /
• v.17 no.1
• /
• pp.58-66
• /
• 2015

Aeronautical communication networks (ACN) is an emerging concept in which aeronautical stations (AS) are considered as a part of multi-tier network for the future wireless communication system. An AS could be a commercial plane, helicopter, or any other low orbit station, i.e., Unmanned air vehicle, high altitude platform. The goal of ACN is to provide high throughput and cost effective communication network for aeronautical applications (i.e., Air traffic control (ATC), air traffic management (ATM) communications, and commercial in-flight Internet activities), and terrestrial networks by using aeronautical platforms as a backbone. In this paper, we investigate the issues about connectivity, throughput, and delay in ACN. First, topology of ACN is presented as a simple mobile ad hoc network and connectivity analysis is provided. Then, by using information obtained from connectivity analysis, we investigate two communication models, i.e., single-hop and two-hop, in which each source AS is communicating with its destination AS with or without the help of intermediate relay AS, respectively. In our throughput analysis, we use the method of finding the maximum number of concurrent successful transmissions to derive ACN throughput upper bounds for the two communication models. We conclude that the two-hop model achieves greater throughput scaling than the single-hop model for ACN and multi-hop models cannot achieve better throughput scaling than two-hop model. Furthermore, since delay issue is more salient in two-hop communication, we characterize the delay performance and derive the closed-form average end-to-end delay for the two-hop model. Finally, computer simulations are performed and it is shown that ACN is robust in terms of throughput and delay performances.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.9
• /
• pp.2797-2806
• /
• 2000

Recently, DDSs(Distributed Database Systems) have been implemented on V AN(V alue Added Network) as we know the amazing expansion of information network. DDS can yield significant cost and response time advantages over centralized systems for geographically distributed organizations. However, inappropriate design can result in high cost and poor response time to maintain the database at each site. In a DDS design, the main problem is how to select proper computer and how to allocate data fragment into a proper site. In this paper, we address DDS design problem of selecting the proper class of computers and the allocating data files on VAN. Also, the formulated model includes two objectives, the waited response time and the investment cost to include their relationship. Specially, the formulation of waited response time is based on M/M/1 queueing system to evaluate more precisely. GA(Genetic Algorithm), a kind of heuristic search method, is developed to search an optimal solution in the proposed design model and we show the simulation result to examine the algorithm performance.

• Journal of Korea Society of Industrial Information Systems
• /
• v.22 no.1
• /
• pp.33-40
• /
• 2017

In this Paper, Analyse the Steady State Behavior of TCP and TFRC with Packet Error when both TCP and TFRC Flows Co-exist in the Network. First, Model the Network with TCP and TFRC Connections as a Discrete Time System. Second, Calculate Average Round Trip Time of the Packet Between Source and Destination on Packet Loss Environment. Then Derive the Steady State Performance i.e. Throughput of TCP and TFRC, and Average Buffer Size of RED Router Based on the Analytic Network Model. The Throughput of TCP and TFRC Connection Decrease Rapidly with the Growth of Sending Window Size and Their Transmission Rate but Their Declines become Smoothly when the Number of Sending Window Arrives on Threshold Value. The Average Queue Length of RED Router Increases Slowly on Low Transmission Rate but Increases Rapidly on High Transmission Rate.

• The Journal of the Korea Contents Association
• /
• v.10 no.6
• /
• pp.80-90
• /
• 2010

In this paper, we introduce some issues to implement an agent system to support service mobility in home network environment, and describe detailed design method in terminal as well as server agent. Specifically, we describe user recognition module, signaling message receiving/parsing module of terminal agent and signaling message receiving/parsing module, multimedia switching module, memory management module of server agent. We define several parameters managed in IP sharing device and design binding table structure to support mobility. And we utilize M/M/1/K queueing theory to obtain relations between memory size, blocking probability and memory utilization. From the obtained results, we show that memory size can be predicted in server agent mounted on IP sharing device.