• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.7
• /
• pp.1256-1271
• /
• 1994

In this paper a GFC protocol based on HMR(High-speed Multimedia Ring) with a dynamic quota allocation is proposed and the performance of proposed protocol is evaluated by simulation. The HMR a medium access protocol proposed for Gbit ATM-LAN, can be applied to the GFC protocol without any modification because it uses only 4 bits for medium access of several topologies such as bus, ring and stared-bus, and priority control for satisfaction of different QoS(Quality of Service) requirements. The quota allocation method of HMR called static quota allocation has a problem of excessive access delay for the traffic with high burstness. In this paper a dynamic quota allocation method which allocates quota to the nodes according to the queue length is proposed and the performance of HMR with dynamic quota allocation is evaluated by seven simulation scenarios of CCITT. The HMR with proposed method shows better shows better access delay characteristics than the HMR with static quota allocation. Also the simulation results show that access delay performance of HMR is better than that of ATMR proposed by Japan and is similar to that of DQDB proposed by Australia.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.1
• /
• pp.9-14
• /
• 2003

APON, the subscriber network using bus or tree topology, requires MAC protocol, because it shares the uplink channel for many subscribers to transmit data to OLT. Although various MAC schemes, which consider each QoS characteristics of traffic are proposed considering transmission characteristics of ATM traffic class, existing schemes reduce the network efficiency by increasing transmission overhead in frame. In this paper, we propose new MAC scheme, which shows similar performance as those of existing schemes but does not increase transmission overhead. To prevent increasing transmission overhead, the proposed scheme encodes the information about each cell information of traffic of the local queue in RAU transmitted periodically from ONU to OLT Thus, the proposed MAC scheme shows similar performance as those of existing ones and increases efficiency of entire network.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.147-155
• /
• 2005

For the last several decades, many researches have been performed to distribute bandwidth fairly between sessions. In this problem, the most important challenge is to realize a scalable implementation and high fairness simultaneously. Here high fairness means that bandwidth is distributed fairly even in short time intervals. Unfortunately, existing scheduling algorithms either are lack of scalable implementation or can achieve low fairness. In this paper, we propose a scheduling algorithm that can achieve feasible fairness without losing scalability. The proposed algorithm is a Hierarchical Deficit Round-Robin (H-DRR). While H-DRR requires a constant time for implementation, the achievable fairness is similar to that of Packet-by-Packet Generalized Processor Sharing(PGPS) algorithm. PGPS has worse scalability since it uses a sorted-priority queue requiring O(log N) implementation complexity where N is the number of sessions.

• Journal of Internet Computing and Services
• /
• v.9 no.4
• /
• pp.61-68
• /
• 2008

Ethernet passive optical network (EPON) is the next-generation technology mitigating the bottleneck between high-capacity local area networks (LANs) and a backbone network. The bottleneck is aggrevated depending on burstiness and long range dependence (LRD) of traffic characteristics as well as amount of outgoing traffic from the high-capacity LANs. The proposed scheme decreases average packet delay for data upstreaming by considering such traffic characteristics to dynamically allocate bandwidth to multiple optical network units (ONUs). In addition, it can appropriately support delay-sensitive traffic such as constant bit ratio (CBR) traffic by making maximum cycle time fix regardless of the number of ONUs. The comprehensive simulation results indicate that the proposed scheme acheives up to 77% and 82% lower than previous schemes in terms of average packet delay and average queue size while it limits the maximum cycle time to twice of the basic cycle time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8B
• /
• pp.514-524
• /
• 2005

In optical burst switching(OBS) networks, the ingress edge router assembles packets in the same class queue into the appropriate size of burst. A burst control packet(BCP) is generated for channel reservation of corresponding data burst and sent earlier than the corresponding data burst with an offset time. Offset time is determined considering the number of hops from source to destination and the required quality of service(QoS). After offset time, the burst data is passed through tile pre-configured optical switches without any O/E/O conversion. But a failure in OBS networks may lead to the loss of bursts until the ingress nodes receive the failure indication signal. This results in a significant degradation in QoS. Therefore, in this paper, we propose a fault-tolerant node architecture based on sub-carrier multiplexing to reduce the effects of failure in OBS networks. The Performance of the proposed fault-tolerant node architecture exhibits considerable improvement as compared with the previous ones.

• Journal of Korea Society of Industrial Information Systems
• /
• v.23 no.2
• /
• pp.29-39
• /
• 2018

In this paper, we discuss a discrete-time queueing system with dyadic server control policy that combines workload control and multiple vacations. Customers arrive at the system with Bernoulli arrival process. If there is no customer to serve in the system, an idle single server spends a vacation of discrete random variable V and returns. The server repeats the vacation until the total service time of waiting customers exceeds the predetermined workload threshold D. In this paper, we derived the steady-state workload distribution of a discrete-time queueing system which is operating under a more realistic and flexible server control policy. Mean workload is also derived as a performance measure. The results are basis for the analysis of system performance measures such as queue lengths, waiting time, and sojourn time.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.6
• /
• pp.65-70
• /
• 1999

In ATM network there exist several traffics according to QoS, such as CBR, rt-VBR, nrt-VBR, UBR, and ABR. Many studies have done at the traffic management of ABR which uses the unused network bandwidth. Many flow control mechanisms have proposed to use efficiently the unused bandwidth. In TMWG(Traffic Management Working Group) of ATM Forum, there exist rate-based, credit-based, and mixture of them to manage flow control of ABR traffic. Among these, rate-based mechanisms adopted as standard because it is flexible and also makes it possible to implement ATM switch with low price and high capacity. In this paper, we study the switch that uses EFCI, ER and VS/VD(Virtual Source/Virtual Destination) with rate-based mechanism. Instead of using queue threshold, we propose a new algorithm which uses bandwidth threshold of input stage of switch, and manages efficiently ABR traffic with EPRCA algorithm.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.26 no.3
• /
• pp.661-666
• /
• 2016

The Internet of Things (IoT) is an infrastructure of physical objects that could be connected to the Internet. Most of these are low performance to ensure a reasonable cost for the smart physical objects. Thus, these devices usually use a lightweight messaging protocol: message queue telemetry transport with SSL/TLS. Cipher suites in device are fixed by default and selected based on preference in SSL/TLS. However, the selected cipher suite provides high security level more than expected. This limitation causes energy waste and overhead of devices. In order to counter this problem, we proposed fuzzy logic based cipher suite decision method to improve energy efficiency. Our proposed method saved 36.03% energy.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.1890-1906
• /
• 1997

A new ER feedback switch control algorithm, called EMRCA(Explicit Max-min Rate Control Algorithm), to control the ABR services traffic in the ATM networks, is proposed in this thesis. This scheme was interpreted the ACR variation residing on between a transient state and a stable state using the two thresholds that is the $TH_{high}$ and $TH_{low}$ in the queue to detect switch nodes congestion, and decreased the difference of minimum and maximum ACR all active connection to enhance the line bandwidth utilization. The proiposed scheme used a minimum and maximum rate of all active connections to select the connection whose the congestion rate inveoked, and uses a congestion detection mechanixm to prevent some potential cogestion by regulating selected contection.s The EMRCA scheme showed ACR variation more stable that the EPRCA scheme, also reduced buffer size of the switch, and achieved higher link utilization than the EPRCA scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1A
• /
• pp.44-53
• /
• 2010

This paper proposes a traffic management policy for delay control in the wireless networks. The so-called EDD(Earliest Due Date) scheme is adopted as the packet scheduling policy, so that the service provision is performed in the order of the transmission urgency of the backlogged packets. In addition, we derive a formula to determine the contention window, one of the MAC parameters, with the goal of minimizing the non-work conserving characteristics of the traditional MAC scheme. This method eliminates the burden of the class-wise parameter settings which is typically required for the priority control. Simulations are performed to show the validity of the proposed scheme in comparison with the policy that adopts the class-level queue management such as the IEEE 802.11e standard. Smaller delays and higher rates of delay guarantees are observed throughout the experiments.