• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.1
• /
• pp.80-90
• /
• 1996

The efficienty of ATM is based on the statical multiplexing of fixed-length packets, which are called cells. The most important technical point for realizing ATM switching network is an arrangement of the buffers and switches. Current most ATM switching networks are being achieved by using the switching modules based on the unit switch of $8{\times}8$ 150Mb/s or $16{\times}16$ 150Mb/s, the unit switch of $32{\times}32$150Mb/s for a large scale system is under study in many countries. In this paper, we proposed a new $32{\times}32$(4.9Gb/s throughput) ATM switch using Shared buffer memory switch which provides superior traffic characteristics in the cell loss, delay and throughput performance and easy LSI(Large Scale Integrated circuit). We analytically estimated and simulated by computer the buffer size into it. We also proposed the configuration of the large capacity ATM switching network($M{\times}M$.M>1,000) consisting of multistage to improve the link speed by non-blocking.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.8
• /
• pp.34-42
• /
• 2009

Mobile communication traffic is changing from voice to data/internet, e.g. wireless internet access, SMS/MMS. more and more. Therefore many data services are coming out over 3G, Mobile WiMAX(WIBRO), LTE etc. Wireless internet market is growing and MIPv6 is more important and many protocols being studied and developed from MIPv6 to Fast MIPv6, Hierachical MIPv6, Proxy MIPv6, etc. The significant factor over MIPv6 is Hand-over latency and Packet-loss PMIPv6 is efficient for reducing mobility related messages and hand-over latency, but it considers single LMA domain. If mobile node is moving inter-LMAs, hand-over delay time affects the real-time communications. To overcome this hand-over delay, we propose present and new enhanced schemes and analize the performance and show the results.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.8
• /
• pp.50-58
• /
• 2009

Fourth generation mobile communication network have the technology of extensive form include basic service technology and it has been developed from the radio access technology and network topology. Not only fourth generation mobile communication network have basically done new highspeed radio access technology which is suitable to high and low speed environment of transfer, but also it is possible that they have been made for freely vertical handover. ETRI also has made fourth generation mobile communication network which is WiNGS(Wireless Initiative for Next Generation Service) satisfied that demand. This paper is made by lossless handover method through the local retransmission ARQ agent that is one of the main technology of fourth generation mobile communication network. Lossless handover method through local retransmission ARQ agent has been basically made by WiNGS and it was better than original local retransmission of layer by simulation.

• Journal of KIISE:Information Networking
• /
• v.32 no.4
• /
• pp.508-514
• /
• 2005

The research in internetworking between UMTS and WLAN, which is completed with merits and demerits, Is actively progressed to establish global roaming environments. This internetworking is classified into two groups: loosely-coupled and tightly-coupled. h tightly-coupled mechanism demands lots of investment and considerable amountof time to construct, which is directly connoted between UNTS and WLAN via IWU. On the other hand, a tersely-coupled mechanism is more scalable and easier to implement than a tightly-coupled one while it has critical drawbacks of packet loss and blocking of services due to handover delay. To alleviate these drawbacks. this work proposes a handover scheme between UMTS and WLAN, which is based on HMIPv6. The performance of the proposed scheme is evaluated by the simaulation. The proposed internetworking scheme based on HMIPv6 shows hotter performance than those based on MIPv6.

• Journal of Digital Contents Society
• /
• v.14 no.4
• /
• pp.429-437
• /
• 2013

Recently, wireless mesh network has been focused as a core technology for resolving the issues of shadow zone and distributed bypass route as it has broad service coverage as well as good scalability features. It, however, provides users with relatively lower QoS than infrastructure-based networks. In order for addressing this QoS issue and also enhancing the routing performance of mobile WiMax mesh network, this paper proposes a load sensing QoS routing (LSQR) scheme. In the proposed LSQR, each node figures out network congestion status and selects a bypass route accordingly. With this scheme, we can expect good load balancing effect by changing the routing paths from centralized links to distributed links under a heavy traffic condition. From the simulation results using NS-2, it has been verified that the LSQR shows lower packet loss rates and data transmission delays than the existing representative routing schemes.

• Journal of The Korean Association of Information Education
• /
• v.15 no.1
• /
• pp.129-136
• /
• 2011

The aim of this study is to present the handover procedures and the performance comparisons of layered mobility management schemes for wireless mobile Internet. To investigate efficient mobility management schemes providing seamless information services in a mobile environment, this paper provided the detailed discussions of existing network layered mobility management scheme, including Mobile IPv4, Mobile IPv6, and new transport layer mobility management scheme, stream control transmission protocol (SCTP) based mobility architecture (SMA). Network simulator-2 (ns-2) was used to compare the performance between Mobile IPv6 and SMA in the wireless mobile Internet environment. Simulation results show that for typical network configuration and parameters, SMA has a lower handover latency, lower packet loss rate, and higher throughput than Mobile IPv6.

• Journal of Korea Multimedia Society
• /
• v.11 no.2
• /
• pp.197-205
• /
• 2008

TCP packets occupy over 90% of current Internet traffic thus understanding of TCP throughput is crucial to understand Internet. Under the TCP congestion regime, heterogeneous flows, i.e., flows with different round-trip times (RTTs), that share the same bottleneck link will not attain equal portions of the available bandwidth. In fact, according to the TCP friendly formula, the throughput ratio of two flows is inversely proportional to the ratio of their RTTs. It has also been shown that TCP's unfairness to flows with longer RTTs is accentuated under loss synchronization. In this paper, we show that, injecting bursty background traffic may actually lead to new type of synchronization and result in unfairness to foreground TCP flows with longer RTTs. We propose three different metrics to characterize traffic burstiness and show that these metrics are reliable predictors of TCP unfairness.

• Journal of Digital Convergence
• /
• v.10 no.9
• /
• pp.325-332
• /
• 2012

VANET(Vehicular Ad-hoc Network), which is a technology to create a network among vehicles, decides the route to the destination using information of neighbors within the transmission range as transmission nodes. The existing routing protocol which uses geographical information can cause delay and disconnection of the network when the density of nodes is not high enough to communicate because it only considers the distance of the relay nodes or destination nodes from the source nodes. To solve the problem, this dissertation suggests a routing algorithm based on zones for stable communications among vehicles in the environment of VANET. I minimize the packet loss rate by dividing the city environment into zones and taking into account not only the distance of the destination but also the density of vehicles to choose the best communications environment. This results in a better performance than the established research when the performance evaluation is implemented.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.3
• /
• pp.62-73
• /
• 2012

IEEE 802.15.4 standard which has low-speed, low-power, low-cost can be efficiently used in wireless sensor network environment. Among various topologies used in IEEE 802.15.4 standard, a cluster-tree topology which has many nodes in it, transmit delay, energy consumption and data loss due to traffic concentration around the sink node. In this paper, we propose the MRS-DCA algorithm that minimizes conflicts between packets for efficient data transmission, and dynamically allocates the active period for efficient use of limited energy. The MRS-DCA algorithm allocates RP(Reservation Period) to the active period of IEEE 802.15.4 and guarantees reliable data transmission by allocating RP and CAP dynamically which is based on prediction using EWMA. The comparison result shows that the MRS-DCA algorithm reduces power consumption by reducing active period, and increasing transmission rate by avoiding collision.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.6
• /
• pp.630-640
• /
• 2002

The compressed video bitstream is very sensitive to transmission errors. If we lost packet or received with errors during the transmission, not only the current frame will be corrupted, but also errors will propagate to succeeding frames. Error concealment is a data recovery technique that enables the decoder to conceal effects of transmission errors by predicting the lost or corrupted video data from the previously reconstructed error free information. Motion vection recovery and motion compensation with the estimated motion vector is a good approach to conceal the corrupted macroblock data. In this paper, we prove that it is reasonable to use the estimated motion vector to conceal the lost macroblock by providing macroblock distortion models. After we propose a new motion vector recovery algorithm based on optical flow fields, we compare its performance to those of conventional error concealment methods. The proposed algorithm has smaller computational complexity than those of conventional algorithms.