• The KIPS Transactions:PartC
• /
• v.13C no.2 s.105
• /
• pp.203-210
• /
• 2006

Fair packet scheduling algorithms supporting quality-of-services of real-time multimedia applications can be classified into the following two design schemes in terms of the reference time used in calculating the timestamp of arriving packet: Finish-time Design (FD) and Start-time Design (SD) schemes. Since the former can adjust the latency of a flow with raising the flow's reserved rate, it has been applied to a router for the guaranteed service of the IETF (Internet Engineering Task Force) IntServ model. However, the FD scheme may incur severe bandwidth loss for traffic flows requiring low-rate but strong delay bound such as internet phone. In order to verify the usefulness of the SD scheme based router for the IETF guaranteed service, this paper analyzes and compares two design schemes in terms of bandwidth and payload utilizations. It is analytically proved that the SD scheme is better bandwidth utilization than the FD one, and the simulation result shows that the SD scheme gives better payload utilization by up to 20%.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.1
• /
• pp.196-204
• /
• 2013

In this paper, a scheduling algorithm is proposed for military satellite networks to improve QoS(Quality of Service) based on WDRR(Weighted Deficit Round Robin) method. When the packet size that has been queued to be larger, the proposed scheme DWDRR(Dynamic WDRR) method give appropriate additional quantum using EWMA(Exponentially Weighted Moving Average). To demonstrate an usefulness of proposed algorithm using OPNET modeler that built the simulation environment, reliability and real-time availability of the proposed algorithm is analyzed. The simulation results show an availability of proposed scheme in terms of reduce queuing delay and packet drop rate compared and analyzed the existing algorithms WRR(Weighted Round Robin), DRR(Deficit Round Robin) and WDRR with DWDRR.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.11
• /
• pp.1225-1230
• /
• 2015

MAC protocol for WBAN performs CSMA/CA(:Carrier Sense Multiple Access with Collision Avoidance)algorithm that handles traffic which occurs in emergency with top priority in order to deal with variable data of sensor node for medicine. Emergency message that node sends undergoes collision and delay of transmission by retransmission of emergency message and waste of energy by retransmission. This paper suggests algorithm that minimizes loss of frame caused by collision and applies different backoff parameters by setting order of priority between MAC instruction frame and data frame in CSMA/CA algorithm case which applies order of priority queuing to improve aforementioned problem. According to performance evaluation, it has been found that using suggested MAC protocol showed lower collision probability, higher packet transmission processing ratio and lower packet loss compared with using IEEE 802.15.6.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3A
• /
• pp.223-232
• /
• 2004

In this paper we propose the hierarchical-based dynamic bandwidth allocation algorithm for multi-class services in Ethernet-PON. The proposed algorithm consists of the high level scheduler in OLT and the low level scheduler in ONU. The hierarchical architecture is able to provide scalability and resource efficiency in Ethernet-PON which has the distributed nature of the scheduling domain, with queues and the scheduler located at a large distance from each other. We also propose three dynamic bandwidth allocation algorithms for the low level scheduler: Proportional Allocation algorithm, Maximum Request First Allocation (MRFA) algorithm and High Priority First Allocation (HPFA) algorithm. We implement the Ethernet-PON standardized in the IEEE 802,3ah using OPNET. We also evaluate and analyze the performance for the proposed algorithms in terms of channel utilization, queuing delay and the amount of remainder.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.3
• /
• pp.1-15
• /
• 1993

In this paper, we propose over-reporting avoidance scheme which avoids congestion of network traffics by adjusting managed system's over-reporting, on the OSI network management model which reports events from managed system to managing system. In case of reporting events from managed system to managing system, management traffic concentration occurs, and it causes over-loading on the managing system and congestion on the network. This scheme takes advantage of feedback from managing system to managed system. Managed system transmits event reports as much as maximum event pertime allocated to itself to managing system, and it sets it's management variables to LOCK state and stops event reports as Threshold time is reached. At the time, managing system directs event reports again by using M-set primitive with referring it's status. With this scheme, distributed processing, dynamic network adaptation, convergence of optimal operation point is possible. In addition to it, a fairness is assured. In order to detect characteristics of the Unary feedback over-reporting avoidance scheme. It is observed a control capability of the event reporting and fairness of each nodes through measuring. ThresholdTime value. It is measured a number of mean activating nodes and maintained time of LOCK state according to event reporting load, and also measured lost ratio of management packet, queuing delay in managing system, and goodput to observe effects of general packet load. Binary feedback scheme. Unary feedback overreporting avoidance scheme and raw scheme on the OSI network management system each are compared and analyzed, and finally proved that the scheme proposed in this study performs better.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.4
• /
• pp.84-91
• /
• 2011

Recently, WBAN(Wireless Body Area Network) which has progressed standardization based on IEEE 802.15.6 standardization is a network for the purpose of the short-range wireless communications within around 3 meters from the inner or outer human body. Effective QoS control technique and data efficient management in limited bandwidth such as audio and video are important elements in terms of users and loads in short-range wireless networks. In this paper, for high-speed WBAN IEEE 802.15.6 standard, the dynamic allocation to give an efficient bandwidth management and weighted fair queueing algorithm have been proposed through the adjustment of the super-frame about limited data and Quality of Service (QoS) based on the queuing algorithm. Weighted Fair Queueing(WFQ) Algorithm represents the robust performance about elements to qualitative aspects as well as maintaining fairness and maximization of system performance. The performance results show that the dynamic allocation expanded transmission bandwidth five times and the weighted fair queueing increased maximum 24.3 % throughput and also resolved delay bound problem.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.777-781
• /
• 2004

This paper presents an algorithm for multichannel slotted-ring topology medium access protocol (MAC) using in wavelength division multiplexing (WDM) networks. In multichannel ring, there are two main previously proposed architectures: Tunable Transmitter - Fixed Receiver (TTFR) and Fixed Transmitter - Tunable Receivers (FTTR). With TTFR, nodes can only receive packets on a fixed wavelength and can send packets on any wavelengths related to destination of packets. Disadvantage of this architecture is required as many wavelengths as there are nodes in the network. This is clearly a scalability limitation. In contrast, FTTR architecture has advantage that the number of nodes can be much larger than the number of wavelength. Source nodes send packet on a fixed channel (or wavelength) and destination nodes can received packets on any wavelength. If there are fewer wavelengths than there are nodes in the network, the nodes will also have to share all the wavelengths available for transmission. However the fixed wavelength approach of TTFR and FTTR bring low network utilization. Because source node with waiting data have to wait for an incoming empty slot on corresponding wavelength. Therefore this paper presents Tunable Transmitter - Tunable Receiver (TTTR) approach, in which the transmitting node can send a packet over any wavelengths and the receiving node can receive a packet from any wavelengths. Moreover, the self-similar distributed input traffic is used for evaluation of the performance of the proposed algorithm. The self-similar traffic performs better performance over long duration than short duration of the Poison distribution. In order to increase bandwidth efficiency, the Destination Stripping approach is used to mark the slot which has already reached the desired destination as an empty slot immediately at the destination node, so the slot does not need to go back to the source node to be marked as an empty slot as in the Source Stripping approach. MATLAB simulator is used to evaluate performance of FTTR, TTFR, and TTTR over 4 and 16 nodes ring network. From the simulation result, it is clear that the proposed algorithm overcomes higher network utilization and average throughput per node, and reduces the average queuing delay. With future works, mathematical analysis of those algorithms will be the main research topic.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.1 s.343
• /
• pp.111-120
• /
• 2006

In this paper, a node architecture of WDM metro network for connecting broadband access networks to converge wire/wireless networks. In consideration of the proposed node architecture and network requirements we proposed and evaluated medium access control protocols. We review WDM related technologies of sub-carrier multiplexing and optical components in order to resolve the bottleneck between optical backbone networks md access networks, and a access node architecture sharing common wavelength is introduced. Source-stripping (SS) MAC protocol Is evaluated under the proposed functional node architecture. DS+IS (Destination-Stripping and Source-Stripping) and DS+IS (Destination-Stripping and Intermediate-Stripping) MAC protocols are described to increase the slot-reuse factor which is low on SS MAC protocol. The key function of new MAC protocols regards the optical switch module of proposed node architecture and helps intermediate or source access nodes for dropping slots to destinations of different wavelength group. Thus, slot-reuse factor increases as the MAC protocols reduce the unnecessary ring-rotation of transferred slots. We use a numerical analysis to expect bandwidth efficiency and maximum throughput by slot-reuse factor Throughput network simulation, the verification of throughput, queuing delay, and transmission fairness are compared among MAC protocols.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.618-636
• /
• 1997

DQDB(Distributed Queue Dual Bus) protocol, the IEEE 802.6 standard protocol for metropolitan area networks, does not fully take advantage of the capabilities of dual bus architecture. Although fairness in bandwidth distribution among nodes is improved when using so called the bandwidth balancing mechanism, the protocol requires a considerable amount of time to adjust to changes in the network load. Additionally, the bandwidth balancing mechanism leaves a portion of the available bandwidth unused. In a high-speed backbone network, each node may act as a bridge/ router which connects several LANs as well as hosts. However, Because the existence of high speed LANs becomes commonplace, the congestionmay occur on a node because of the limitation on access rate to the backbone network and on available buffer spaces. to release the congestion, it is desirable to install some congestion control algorithm in the node. In this paper, we propose an efficient congestion control mechanism and fair and waster-free MAC protocol for dual bus network. In this protocol, all the buffers in the network can be shared in such a way that the transmission rate of each node can be set proportional to its load. In other words, a heavily loaded node obtains a larger bandwidth to send the sements so tht the congestion can be avoided while the uncongested nodes slow down their transmission rate and store the incoming segments into thier buffers. this implies that the buffers on the network can be shared dynamically. Simulation results show that the proposed probotol significantly reduces the segment queueing delay of a heavily loaded node and segment loss rate when compared with original DQDB. And it enables an attractive high throughput in the backbone network. Because in the proposed protocol, each node does not send a requet by the segment but send a request one time in the meaning of having segments, the frequency of sending requests is very low in the proposed protocol. so the proposed protocol signigificantly reduces the segment queuing dely. and In the proposed protocol, each node uses bandwidth in proportion to its load. so In case of limitation of available buffer spaces, the proposed protocol reduces segment loss rate of a heavily loaded node. Bandwidth balancing DQDB requires the wastage of bandwidth to be fair bandwidth allocation. But the proposed DQDB MAC protocol enables fair bandwidth without wasting bandwidth by using bandwidth one after another among active nodes.