• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.4
• /
• pp.562-570
• /
• 2022

The supply expansion of 5G services and personal smart devices has caused the sharp increase of data traffic and the demand of various services. Again, these facts have resulted in the huge demand of network bandwidth. However, existing network technologies using electronic signal have reached the limit to accommodate the demand. Therefore, in order to accept this request, optical internet has been studied actively. However, optical internet still has a lot of problems to solve, and among these barriers a very urgent issue is to develop QoS technologies. Hence, in order to achieve service differentiation between classes in optical internet, especially in OBS network, a new QoS method automatically tuning the size of data bursts is proposed in this article. Especially, the algorithm suggested in this article is based on fiber delay line.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.139-145
• /
• 2016

Dumbbell is the most basic topology that can be used in almost all kind of network experiment within it or just by little expansion. While Transmission Control Protocol TCP is the basic protocol that is used for the connectivity among networks and stations. TCP major and basic goal is to provide path and services to different applications for communication. For that reason TCP has to transfer a lot of data through a communication medium that cause serious congestion problem. To calculate the congestion problem, different kind of pre-cure solutions are developer which are Loss Based Variant and Delay Based Variant. While LBV keep track of the data that is going to be passed through TCP protocol, if the data packets start dropping that means congestion occurrence which notify as a symptom, TCP CUBIC use LBV for notifying the loss. Similarly the DBV work with the acknowledgment procedure that is used in when data ACK get late with respect to its set data rate time, TCP COMPOUND/VAGAS are examples of DBV. Many algorithms have been purposed to control the congestion in different TCP variants but the loss of data packets did not completely controlled. In this paper, the congestion control algorithms are implemented and corresponding results are analyzed in Dumbbell topology, it is typically used to analyze the TCP traffic flows. Fairness of throughput is evaluated for different TCP variants using network simulator (NS-2).

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.6
• /
• pp.18-26
• /
• 2008

In this paper, dynamic GTS scheduling method based on IEEE 802.15.4 is proposed for wireless control system considering reliability and real-time property. The proposed methods can guarantee a transmission of real-time periodic and sporadic data within the limited time frame in factory environment. The superframe of IEEE 802.15.4 is used for the dynamic transmission method of real-time mixed traffic (periodic data, sporadic data, and non real-time message). By separating CFP and CAP properly, the periodic, sporadic, and non real-time messages are transmitted effectively and guarantee real-time transmission within a deadline. The simulation results show the improvement of real-time performance of periodic and sporadic data at the same time.

• Journal of Internet Computing and Services
• /
• v.10 no.5
• /
• pp.41-47
• /
• 2009

Routing through a backbone, which is responsible for performing and managing multipoint communication, reduces the communication overhead and overall energy consumption in wireless sensor networks. However, the backbone nodes will need extra functionality and therefore consume more energy compared to the other nodes. The power consumption imbalance among sensor nodes may cause a network partition and failures where the transmission from some sensors to the sink node could be blocked. Hence optimal construction of the backbone is one of the pivotal problems in sensor network applications and can drastically affect the network's communication energy dissipation. In this paper a distributed algorithm is proposed to generate backbone trees through robust multi-hop clusters in wireless sensor networks. The main objective is to form a properly designed backbone through multi-hop clusters by considering energy level and degree of each node. Our improved cluster head selection method ensures that energy is consumed evenly among the nodes in the network, thereby increasing the network lifetime. Comprehensive computer simulations have indicated that the newly proposed scheme gives approximately 10.36% and 24.05% improvements in the performances related to the residual energy level and the degree of the cluster heads respectively and also prolongs the network lifetime.

• Journal of Internet Computing and Services
• /
• v.3 no.6
• /
• pp.43-51
• /
• 2002

In this paper, we study the new packet dropping scheme using an active queue management algorithm. Active queue management mechanisms differ from the traditional drop tail mechanism in that in a drop tail queue packets are dropped when the buffer overflows, while in active queue management mechanisms, packets may be dropped early before congestion occurs, However, it still incurs high packet loss ratio when the buffer size is not large enough, By detecting congestion and notifying only a randomly selected fraction of connection, RED causes to the global synchronization and fairness problem. And also, it is the biggest problem that the network traffic characteristics need to be known in order to find the optimum average queue length, We propose a new efficient packet dropping method based on the active queue management for congestion control. The proposed scheme uses the per-flow rate and fair share rate estimates. To this end, we present the estimation algorithm to compute the flow arrival rate and the link fair rate, We shows the proposed method improves the network performance because the traffic generated can not cause rapid fluctuations in queue lengths which result in packet loss

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.4
• /
• pp.758-767
• /
• 2017

IoT paradigm which makes a information without direct intervention of a human and interworks with other objects, humans and systems is attracting attention. It will be expected the number of smart devices equipped with sensors and wireless communication capabilities is reached to about 260 billion by 2020. With the vast amount of sending data generated from rapidly increasing number of smart devices, it will bring up the traffic growth over internet and congestion in wireless networks. In this paper, we utilize the smart device as a sink node to collect and forward the sensing data periodically in IoT and propose a heuristic algorithm for a selection of sink nodes' set with each sink node satisfies the QoS its applications because a selection of optimal sink nodes' set is NP-hard problem. The complexity of proposed heuristic algorithm is $O(m^3)$ and faster than the optimal algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11A
• /
• pp.859-866
• /
• 2003

In this paper, we designed the bandwidth allocation scheme with priority consideration for upstream channel access of EthernetPON. The objective of our scheme is to control the multi services in more effective way according to their CoS(Class of Service) or QoS(Quality of Service). The designed scheme considers transmission priority in the both side of OLT and ONU. In the OLT's view, the Two-step scheduling algorithm is applied with which we can support multiple bandwidth allocation policies simultaneously, i.e. SBA for the time-sensitive, constant rate transmission services and DBA for the best-effort services. This Two-step scheduling algorithm reduces the scheduling complexity by separating the process of transmission start time decision from the process of grant generation. In the ONU's view, the proposed scheme controls 8 priority queues of the 802.1d recommended 8 service classes. Higher priority queue is serviced in prior during the allowed GATE time from OLT. The OPNET modeling and simulation result compares the performance of each bandwidth allocation policy with SBA or DBA only approach.

• Journal of Internet Computing and Services
• /
• v.7 no.1
• /
• pp.151-164
• /
• 2006

The DCF of IEEE 802.11 standard coordinates transmissions onto the shared communication channel based on CSMA/CA protocol. Currently, 802,11 is the most widely deployed wireless LAN standard. In this paper, for 802.11-based wireless LAN we propose a service differentiation scheme adopting different contention window sizes and retransmission schemes for two different types of data packets and we present a Markov model for the state of a given station under a finite load traffic condition. We then derive an algorithm to find the transmission probability and the throughput. The proposed model is validated through simulation under various system settings.

• Journal of Internet Computing and Services
• /
• v.12 no.2
• /
• pp.1-8
• /
• 2011

In this paper, we propose an effective method for cooperative spectrum sensing in cognitive radios where cognitive user(CR) with the highest reliability sensing data is only selected and allowed to report its local decision to FC as only decision making node. The proposed scheme enables CR users to implicitly compare their sensing data reliabilities based on their likelihood ratio, without any collaboration among cognitive radio users. Due to the mechanism, the proposed cooperative scheme can achieves a high spectrum sensing performance while only requiring extremely low cooperation resources such as signaling overhead and cooperative time in comparison with other existing methods such as maximum ratio combination (MRC) based, equal gain combination (EGC) based and conventional hard combination based cooperative sensing methods.

• The KIPS Transactions:PartC
• /
• v.13C no.4 s.107
• /
• pp.441-446
• /
• 2006

In recent years, WDM networks have received much attention as the Internet backbone networks because of the explosive growth of the Internet IP-based traffic. The Optical Burst Switching (OBS) has been proposed as an effective optical switching technology in the WDM networks. The OBS has the advantages in 1) the high usage rate of the bandwidth, and 2) no necessity of optical buffer. However, the OBS has the burst-contention problem in the networks. The deflection routing is proposed as one of means to solve this problem. In this paper, we propose a new routing method to minimize burst loss in the deflection routing based networks. In addition, we propose a QoS control method using a new routing algorithm. Finally, we show the variety of the proposed methods by computer simulations.