• The Journal of the Korea Contents Association
• /
• v.1 no.1
• /
• pp.130-136
• /
• 2001

Real-time applications like VoIP in mobile networks need smooth handovers in order to minimize or eliminate packet loss as a mobile host(MH) transitions between network links. In this paper, we design a new variable buffering mechanism for IPv6 by which an MH can request that the router on its current subnet buffers pad(eta on its behalf while the MH completes registration procedures with the router of a new subnet. Performance results show that our proposed queueing scheme with a variable space allocation is quite appropriate for mobile internet environment in terms of the packet loss rate.

• The Journal of the Korea Contents Association
• /
• v.8 no.1
• /
• pp.169-176
• /
• 2008

In this paper, we develop radio resource management queueing model in IEEE 802.IS networks considering both connection and packet level. In the upper level connection, we model connection admission control depending on availability of bandwidth and priority queue in each service class. In the lower level packet, we model dynamic bandwidth allocation considering threshold and availability of bandwidth in each service class simultaneously. Hierarchical model is built using an extended Petri Nets, SRN (Stochastic Reward Nets). Bandwidth utilization and normal throughput as performance index for all service classes of traffic are calculated and numerical results are obtained.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.11
• /
• pp.1785-1796
• /
• 1993

Thanks to the data processing facilities of modern digital computers, the performances of radar has been promoted greatly as one of the main components of command and control systems along with the computer communications. In this study, radar data integrating and processing systems were designed for the data processing of various information from many kinds of radar in a single data processing system. The performance of the data integrating system was analyzed by applying queueing theory. A radar data integrating network was designed for synchronous relational operations among the information processing systems and the transmission characteristics were also analysed by specific models for each system. The designed data integrating systems can be divided into a simplex type and a distributed multiplex type.

• The Journal of the Korea Contents Association
• /
• v.8 no.4
• /
• pp.71-78
• /
• 2008

We propose the scheme that supports continuously service when a user tries to contact new target network in broadband convergence network even though the network resource for the service is not enough. The proposed scheme transforms original service capacity into suitable QoS for the target network using the scalable service techniques in the oncoding/decoding and supports handover for the user. We analyzed the handover blocking probability of two schemes using queueing system to show the improvement of performance by the proposed scheme. Subsequently, we showed that the handover blocking probability in the proposed scheme is lower than that in the existing scheme.

• Journal of Communications and Networks
• /
• v.13 no.3
• /
• pp.286-297
• /
• 2011

A novel converged optical network unit (ONU)-base station (BS) architecture has been contemplated for next-generation optical-wireless networks. It has been demonstrated through high quality studies that data traffic carried by both wired and wireless networks exhibit self-similar and long range dependent characteristics; attributes that classical teletraffic theory based on simplistic Poisson models fail to capture. Therefore, in order to apprehend the proposed converged architecture and to reinforce the provisioning of tightly bound quality of service (QoS) parameters to end-users, we substantiate the analysis of the QoS behavior of the ONU-BS under self-similar and long range dependent traffic conditions using custom queuing which is a common queuing discipline. This paper extends our previous work on priority queuing and brings novelty in terms of presenting performance analysis of the converged ONU-BS under realistic traffic load conditions. Further, the presented analysis can be used as a network planning and optimization tool to select the most robust and appropriate queuing discipline for the ONU-BS relevant to the QoS requirements of different applications.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.3
• /
• pp.135-151
• /
• 1998

The demand of large capacity in coming cellular systems makes inevitable the deployment of small cells, rendering more frequent handoff occurrences of calls than in the conventional system. The key issue is then how effectively to reduce the chance of unsuccessful handoffs, since the handoff failure is less desirable than that of a new call attempt. In this study, we consider the control policies which give priority to handoff calls by limiting channel assignment for the originating new calls, and allow queueing the new calls which are rejected at their first attempts. On this system. we propose the problem of finding an optimal call control strategy which optimizes the objective function value, while satisfying the requirements on the handoff/new call blocking probabilities and the new call delay. The objective function takes the most general form to include such well-known performance measures as the weighted average carried traffic and the handoff call blocking probability. The problem is formulated into two different linear programming (LP) models. One is based on the direct employment of steady state equations, and the other uses the theory of semi-Markov decision process. Two LP formulations are competitive each other, having its own strength in the numbers of variables and constraints. Extensive experiments are also conducted to show which call control strategy is optimal under various system environments having different objective functions and traffic patterns.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5B
• /
• pp.457-465
• /
• 2003

In this paper, we analyze the performances of variable MAC (Medium Access Control) protocols and present an efficient MAC protocol for Ethernet PON (Passive Optical Network). We consider three MAC protocols: static TDMA, dynamic TDMA, and Interleaved polling. Static TDMA assigns an equal amount of bandwidth to all ONUs regardless of the request information but Dynamic TDMA dynamically allocates the bandwidth to each ONU considering its request. Interleaved Polling operates a cycle with variable time period and a polling method for informing a uplink transmission chance to each ONU. This paper theoretically analyzes the available bandwidth for each of three protocols. We also implement the simulation models for them by using OPNET and evaluates the performances under various bursty traffic environments. The results are compared and analyzed in terms of channel utilization and queueing delay.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5B
• /
• pp.466-474
• /
• 2003

In this paper, we develope the simulation model for Ethernet passive optical networks (Ethernet-PON) by using OPNET. Ethernet-PON is an emerging access network technology that provides a low-cost method of deploying optical access lines. The simulator uses a Request/Grant TDMA MAC protocol based on IEEE 802.3ah EFM. It also executes registration, ranging and dynamic bandwidth allocation algorithm by exchanging control packets between OLT and ONUs. We have evaluated for success ratio of initial registration process and delay of late registration process. We also have simulated for dynamic TDMA protocol and static TDMA protocol in terms of channel utilization and queueing delay. We expect that this simulator can help to determine various parameters which are considered for designing Ethernet-PON system.

• Journal of the Korea Society of Computer and Information
• /
• v.5 no.4
• /
• pp.82-89
• /
• 2000

This study analyzes the cell loss probability of an ATM multiplexer with real time and non-real time bursty traffics. It is assumed that an ATM multiplexer with loss priority control for the analysis. The loss priority control uses the CLP Reld of cell header. For easy analysis and less computation. the multiplexed traffic of the ATM multiplexer was modeled by the MMDP. The ATM multiplexer is simulated by the MMDP/MMDP/l/K queueing system. From the above results, The connection admission of an ATM multiplexer with loss priority control is determined by the cell loss probability with low priority as well as the size of threshold buffer. Therefore, to increase the statistical multiplexing gain it will be good to utilize the loss priority control in order.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.2
• /
• pp.233-239
• /
• 1999

With the increase of Internet protocol (IP) packets the performance of routers became an important issue in internetworking. In this paper we examined the matching algorithm in gigabit router which has input queue with virtual output queueing. Port partitioning concept is employed to reduce the computational burden of the scheduler within a switch. The input and output ports are divided into two groups such that the matching algorithm is implemented within each input-output pair group in parallel. The matching is performed by exchanging input and output port groups at every time slot to handle all incoming traffics. Two algorithms, maximal weight matching by port partitioning (MPP) and modified maximal weight matching by port partitioning (MMPP) are presented. MMPP has the lowest delay for every packet arrival rate. The buffer size on a port is approximately 20-60 packets depending on the packet arrival rates. The throughput is illustrated to be linear to the packet arrival rate, which can be achieved under highly efficient matching algorithm.