• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.2
• /
• pp.264-270
• /
• 2006

In this paper we verified that the window based TCP performance of throughput can be improved by the traffic connection efficiency. and have studied the performance of traffic congestion control that is controlling transmission rate. In wireless network, the bidirectional node is run by estimating the usage rate of link of error control idle and the throughput is shown by transmitting segments. The throughput rate shows almost no delay due to the bidirectional traffic connection efficiency up to the allowable point as increasing the transport rate by the critical value, depending on the size of end-to-end node queue of the increase of transport rate. This paper reports the performance improvement as the number of feedback connection traffic congestion control increases because of the increase of the number of asynchronous transport TCP connections.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.3
• /
• pp.600-607
• /
• 2007

In the next generation mobile multimedia communications, the broad band shot-burst transmissions are used to reduce end-to-end transmission delay, and to limit the time variation of wireless channels over a burst. However, training overhead is very significant for such short burst formats. So, the availability of the short training sequence and the fast converging adaptive algorithm is essential in the system adopting the symbol-by-symbol adaptive equalizer. In this paper, we propose an adaptive equalizer using the DWMT (discrete multi-wavelet transform) and LMS (least mean square) adaptation. The proposed equalizer has a faster convergence rate than that of the existing transform-domain equalizers, while the increase of computational complexity is very small.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.21 no.6
• /
• pp.553-563
• /
• 2010

This paper presents a tapered slot-antenna(TSA) for optimal impulse-signal transmission in ultra-wide band(UWB). The proposed TSA provides radiates in end-fire direction, which meets an impulse-radio UWB(IR-UWB) system demands(e.g., low loss, thus less error throughout the UWB band). In order to minimize the pulse distortion, we used an wideband impedance transformer and a microstrip slotline. The pulse fidelity characteristics was evaluated with finite-difference time-domain(FDTD) analysis technique and pulse fidelity correlation equation. Approximately 93.89 % pulse fidelity was obtained between the two antennas in 0.5 m range. Additionally, derived chirp Z-transform algorithm enables us to utilize the zoom-in option on the pulse signal in few nano-seconds below. Thus, it is possible to analyze the pulse signal distortion, delay or dispersion characteristics.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.5
• /
• pp.1215-1223
• /
• 2014

In multi-hop wireless networks, a message transmission path is set up on demand by a route discovery step, where a shortest path is used in general. The shortest path, however, normally uses the nodes near the center area, which causes a high traffic load in that area and reduces the message transmission reliability. We propose a stable routing protocol considering the remaining energy of nodes. Our protocol uses ETX as a link performance estimator and tries to avoid the nodes with smaller energy. By doing this, we can reduce the route failure probability and packet loss. We have evaluated the performance of the proposed protocol using QualNet and compared with AODV and MRFR protocols. The simulation result shows that our protocol has a similar performance as MRFR in terms of end-to-end message reception ratio, average message delay and delay jitter, but outperforms MRFR in terms of traffic load distribution.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.9
• /
• pp.2948-2957
• /
• 2000

A broadband access network in B- ISDN subscriber network, plays a role of concentration or multiplexing of various subscribers into a service node. To establish an end-to-end ATM connection, interworking functions between \'B5.2 interface's connection protocol and the signalling protocol, are perfonned at the service node. A sequential interworking model and a parallel interworking model were proposed for these interworking functions. The sequential interworking model proceeds the signalling protocol of network node after the response of VB5.2 interface protocol. On the other hand, the parallel interworking model proceeds the signalling protocol and the VB5.2 interface protocol simultaneously. In this paper, we analyze and simulate above two interworking models in tenns of a connection setup delay and completion ratio, when call requests with eBR and VBR transfer capability arrive at the service node. We observed that the completion ratios of the two interworking models are quite closed. However the connection setup delay of parallel interworking model is improved by about 33% compared with that of the sequential interworking model.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.6
• /
• pp.75-84
• /
• 2014

In order to solve the problems such as overload, single point of failure, non-optimized data path, and network scalability in conventional central mobility management protocols, distributed mobility management schemes have been continually studied in and around the IETF. In this paper, a network-based partially-distributed mobility management mechanism, pDMMv6, is suggested and the performance comparison with traditional protocols such as PMIPv6 and MIPv6 is made through simulation under the various user traffic environment. The simulation results include UDP packet delivery ratio, end-to-end packet delay, binding delay for registration signaling, CPU utilization in each node, and response delays in several server-client TCP applications such as web browsing, e-mail, telnet remote login, FTP file up/down-load, and database access.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.3
• /
• pp.86-94
• /
• 1990

This paper suggests a unified packet telecommunication network, which is designed by applying network design algorithm and distribution network design algorithm, Proposed local network design algorithm is based on MST topology, and it can satisfy the limited capacity and get a distribution effect of communication flow, With the result of the comparison with Kruskal and Esau-Willams algorithm, an increase of 2.7% in cost and a decrease of 44.8% in average delay time are shown. Starting with MST topology, proposed distribution network design algorithm gradually increases its reliability, and proposes a conclusive algorithm to determine a topology with minimum cost. In compared with Cut-Saturation algorithm in the aspect of end-to-end delay time and communication flow restricted condition, this proposed algorithm results in 1/7 cost down and about 2.5 times increases in Throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4B
• /
• pp.659-669
• /
• 2010

The P2P IPTV will create a new paradigm for the Internet services. However, it cannot guarantee the reliability of their server and QoS because of using common Internet users(peers) for SIP server or relay server, though the infrastructural cost is low. This paper proposes the ISP-based P2P IPTV architecture which can solute the limitations of conventional P2P-based IPTV. In this model, ISP can build P2P overlay network with ISP servers and directly manage each server needed for session connection. So, the servers have higher performance and better reliability than previous one. Besides, robustness is improved because each sever is set by P2P overlay network. To evaluate the characteristics of the ISP-based P2P IPTV architecture, we simulate it for some parameters which are end-to-end streaming delay time, connection delay time and traffic amount. We compared the proposed architecture with the conventional P2P architecture about video service and confirmed that the performance of ISP-based P2P IPTV is better than conventional P2P based IPTV.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.8
• /
• pp.2188-2208
• /
• 2023

Quality of Service (QoS) is a critical feature of Wireless Sensor Networks (WSNs) with routing algorithms. Data packets are moved between cluster heads with QoS using a number of energy-efficient routing techniques. However, sustaining high scalability while increasing the life of a WSN's networks scenario remains a challenging task. Thus, this research aims to develop an energy-balancing component that ensures equal energy consumption for all network sensors while offering flexible routing without congestion, even at peak hours. This research work proposes a Gravitational Blackhole Search Optimised splay tree routing framework. Based on the splay tree topology, the routing procedure is carried out by the suggested method using three distinct steps. Initially, the proposed GBSO decides the optimal route at initiation phases by choosing the root node with optimum energy in the splay tree. In the selection stage, the steps for energy update and trust update are completed by evaluating a novel reliance function utilising the Parent Reliance (PR) and Grand Parent Reliance (GPR). Finally, in the routing phase, using the fitness measure and the minimal distance, the GBSO algorithm determines the best route for data broadcast. The model results demonstrated the efficacy of the suggested technique with 99.52% packet delivery ratio, a minimum delay of 0.19 s, and a network lifetime of 1750 rounds with 200 nodes. Also, the comparative analysis ensured that the suggested algorithm surpasses the effectiveness of the existing algorithm in all aspects and guaranteed end-to-end delivery of packets.

• Journal of Korea Multimedia Society
• /
• v.7 no.9
• /
• pp.1273-1281
• /
• 2004

There have been a number of researches on real-time packet scheduling based on EDF algorithm to support end-to-end delay bound guarantees for real-time traffic transmission. However, EDF-based packet scheduler could not guarantee the real-time requirements of real-time traffic if there exist non-real-time traffic. In this paper, we propose a new admission control algorithm and packet scheduling scheme considering non-real-time traffic in the real -time packet scheduler based on EDF policy. Proposed admission control algorithm has pseudo-polynomial time complexity, but we show through simulation that it can be used with little run-time overhead.