• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.4
• /
• pp.629-637
• /
• 2006

Currently the research on input-queued ATM switches is one of the most active research fields. Many achievements have been made in the research on scheduling algorithms for input-queued ATM switches and also applied in commerce. The scheduling algorithms have the characteristics of improving throughput, satisfying QoS requirements and providing service fairly. In this paper, we studied on an implementation of scheduler which arbirates the input-queued ATM switches efficiently and swiftly. The proposed scheduler approximately provides 100% throughput for scheduling. The proposed algorithm completes the arbitration for N-port VOQ switch with 4-iterative matching. Also the proposed algorithm has a merit for implementing the scheduling algorithm with 1/2 area compared to that of iSLIP scheduling algorithm which is widely used. The performance of the proposed scheduling algorithm is superior to that of iSLIP in 4-iterative matching. The proposed scheduling algorithm was implemented in FPGA and verified on board-level.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4B
• /
• pp.153-161
• /
• 2005

In a multi-channel network based of wavelength division multiplexing (WDM) technology, an efficient protocol is needed in order for the transmitter and receiver to be tuned to the same wavelength during message transmission time. This paper proposes a priority-based reservation protocol that can efficiently support variable-length messages that require different QoS requirements. In this proposed protocol, high-priority nodes can reserve the data channel before low-priority nodes. However, once a node reserves a data channel successfully, it can persistently use the reserved channel till message transmission is finished regardless of the priority of the node. Moreover, the protocol can operate independently of the number of nodes, and any new node can join the network anytime without requiring network re-initialization. The protocol is analyzed with a finite population model and the throughput-delay characteristics are investigated as performance measures.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.6A
• /
• pp.558-564
• /
• 2007

3G Long Term Evolution, which aims for various mobile multimedia service provision by enhanced wireless interface, proposes VoIP-based voice service through a Packet Switching (PS) domain. As delay and loss-sensitive VoIP traffic flows through the PS domain, more challenging technical difficulties are expected than in Circuit Switching (CS) domain based VoIP services. Moreover, since 3G LTE, which adopts the OFDM as its physical layer, introduces Physical Resource Block (PRB) as a unit for transmission resources, new types of resource management schemes are needed. This paper proposes a PRB scheduling algorithm of MAC layer for VoIP service in 3G LTE and shows the simulation results. The proposed algorithm has two key parts; dynamic activation of VoIP priority mode to satisfy VoIP QoS requirements and adaptive adjustment of the priority mode duration in order to minimize the degradation of resource utilization.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.7
• /
• pp.1447-1454
• /
• 2017

The realtime test data topic means that process for the data efficiently from many kinds of measurement device at the test range. There are many measurement devices in test range. The test range require accurate observation and determine on test object. In this realtime test data slaving framework system, the system can produce variety of test informations and all these data also must be transmitted to test information management or display system in realtime. Using RTI DDS(Data Distribution Service) middle ware Ver 5.2, we can product the efficiency of system usability and QoS(Quality of Service) requirements. So the application user enables to concentrate on applications, not middle ware. As the reason, Complex function is provided by the DDS, not the application such as Visualization Software. In this paper, I suggest the realtime test data topic on slaving framework of realtime test data based on DDS at the test range system.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.13 no.6
• /
• pp.7-20
• /
• 2017

The advancement of cloud and big data and the considerable growth of traffic have increased the complexity and problems in the management inefficiency of existing networks. The software-defined networking (SDN) environment has been developed to solve this problem. SDN enables us to control network equipment through programming by separating the transmission and control functions of the equipment. Accordingly, several studies have been conducted to improve the performance of SDN controllers, such as the method of connecting existing legacy equipment with SDN, the packet management method for efficient data communication, and the method of distributing controller load in a centralized architecture. However, there is insufficient research on the control of SDN in terms of the quality of network-using applications. To support the establishment and change of the routing paths that meet the required network service quality, we require a mechanism to identify network requirements based on a contract for application network service quality and to collect information about the current network status and identify the violations of network service quality. This study proposes a method of identifying the quality violations of network paths through ontology to ensure the network service quality of applications and provide efficient services in an SDN environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.6
• /
• pp.2824-2837
• /
• 2019

Container technologies are widely used in infrastructures to deploy and manage applications in cloud computing environment. As containers are light-weight software, the cluster of cloud applications can easily scale up or down to provide Internet-based services. Container-based applications can well deal with fluctuate workloads by dynamically adjusting physical resources. Current works of scheduling applications often construct applications' performance models with collected historical training data, but these works with static models cannot self-adjust physical resources to meet the dynamic requirements of cloud computing. Thus, we propose a self-adaptive automatic container scheduling framework AutoScale for cloud applications, which uses a feedback-based approach to adjust physical resources by extending, contracting and migrating containers. First, a queue-based performance model for cloud applications is proposed to correlate performance and workloads. Second, a fuzzy Kalman filter is used to adjust the performance model's parameters to accurately predict applications' response time. Third, extension, contraction and migration strategies based on predicted response time are designed to schedule containers at runtime. Furthermore, we have implemented a framework AutoScale with container scheduling strategies. By comparing with current approaches in an experiment environment deployed with typical applications, we observe that AutoScale has advantages in predicting response time, and scheduling containers to guarantee that response time keeps stable in fluctuant workloads.

• Journal of Communications and Networks
• /
• v.18 no.4
• /
• pp.600-609
• /
• 2016

In this paper, we propose a two-stage base station (BS) sleeping scheme to save energy consumption in cellular networks. The BS sleeping mode is divided into a light sleeping stage and a deep sleeping stage according to whether there is a user in the BS's coverage. In the light sleeping stage, a BS will retain its coverage and frequently switch between the on state and the doze state according to the service characteristics. While in the deep sleeping stage analysis, the BS will shut down its coverage, and neighbor BSs will patch the coverage hole. Several closed-form formulas are derived to demonstrate the power consumption in each sleeping stage and the stage switching conditions are discussed to minimize the average power consumption. The average traffic delay caused by BS sleeping and the average deep sleeping rate under a given traffic load have also been studied. In addition, it is shown that BS sleeping is not always possible because of the limited quality of service (QoS) requirements. Simulation results show that the proposed scheme can effectively reduce the average BS power consumption, at the cost of some extra traffic delay. In summary, our proposed framework provides an essential understanding of the design of future green networks that aim to take full advantage of different stages of BS sleeping to obtain the best energy efficiency.

• Journal of Communications and Networks
• /
• v.13 no.2
• /
• pp.132-141
• /
• 2011

IEEE 802.15.4 networks are a feasible platform candidate for connecting all health-care-related equipment dispersed across a hospital room to collect critical time-sensitive data about patient health state, such as the heart rate and blood pressure. To meet the quality of service requirements of health-care systems, this paper proposes a multi-priority queue system that differentiates between various types of frames. The effect of the proposed system on the average delay and throughput is explored herein. By employing different contention window parameters, as in IEEE 802.11e, this multi-queue system prioritizes frames on the basis of priority classes. Performance under both saturated and unsaturated traffic conditions was evaluated using a novel analytical model that comprehensively integrates two legacy models for 802.15.4 and 802.11e. To improve the accuracy, our model also accommodates the transmission retries and deferment algorithms that significantly affect the performance of IEEE 802.15.4. The multi-queue scheme is predicted to separate the average delay and throughput of two different classes by up to 48.4% and 46%, respectively, without wasting bandwidth. These outcomes imply that the multi-queue system should be employed in health-care systems for prompt allocation of synchronous channels and faster delivery of urgent information. The simulation results validate these model's predictions with a maximum deviation of 7.6%.

• Journal of Communications and Networks
• /
• v.15 no.1
• /
• pp.102-110
• /
• 2013

This paper considers a cooperative orthogonal frequency division multiple access (OFDMA)-based cognitive radio network where the primary system leases some of its subchannels to the secondary system for a fraction of time in exchange for the secondary users (SUs) assisting the transmission of primary users (PUs) as relays. Our aim is to determine the cooperation strategies among the primary and secondary systems so as to maximize the sum-rate of SUs while maintaining quality-of-service (QoS) requirements of PUs. We formulate a joint optimization problem of PU transmission mode selection, SU (or relay) selection, subcarrier assignment, power control, and time allocation. By applying dual method, this mixed integer programming problem is decomposed into parallel per-subcarrier subproblems, with each determining the cooperation strategy between one PU and one SU. We show that, on each leased subcarrier, the optimal strategy is to let a SU exclusively act as a relay or transmit for itself. This result is fundamentally different from the conventional spectrum leasing in single-channel systems where a SU must transmit a fraction of time for itself if it helps the PU's transmission. We then propose a subgradient-based algorithm to find the asymptotically optimal solution to the primal problem in polynomial time. Simulation results demonstrate that the proposed algorithm can significantly enhance the network performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.3789-3809
• /
• 2015

In this paper, we deal with the problem of M2M gateways' network selection for different types of M2M traffic in heterogeneous wireless networks. Based on the difference in traffic's quality of service (QoS) requirements, the M2M traffic produced by various applications is mainly classified as two categories: flexible traffic and rigid traffic. Then, game theory is adopted to solve the problem of network-channel selection with the coexistence of flexible and rigid traffic, named as flexible network access (FNA). We prove the formulated discrete game is a potential game. The existence and feasibility of the Nash equilibrium (NE) of the proposed game are also analyzed. Then, an iterative algorithm based on optimal reaction criterion and a distributed algorithm with limited feedback based on learning automata are presented to obtain the NE of the proposed game. In simulations, the proposed iterative algorithm can achieve a near optimal sum utility of whole network with low complexity compared to the exhaustive search. In addition, the simulation results show that our proposed algorithms outperform existing methods in terms of sum utility and load balance.