• The KIPS Transactions:PartA
• /
• v.11A no.7 s.91
• /
• pp.489-498
• /
• 2004

VLIW processor is considered to be an appropriate processor for the embedded system, provided with high performance and low power con-sumption due to its simple hardware structure. Unfortunately, the VLIW processor often suffers from high memory access latency due to the variable length of I-packets, which consist of independent instructions to be issued in parallel. It is because of the variable I-packet length that some I-packets must be placed over two cache blocks, which are called straddle I-packets, so that two cache accesses are required to fetch such I-packets. In this paper, an expansion buffer cache is proposed to improve not only the instruction fetch bandwidth, but also the power consumption of the I-cache with moderate hardware cost. The expansion buffer cache has a small expansion buffer containing a fraction of a straddle packet along with the main cache to reduce the additional cache accesses due to the straddle I-packets. With a great reduction in the cache accesses due to the straddle packets, the expansion buffer cache can achieve $5{\~}9{\%}$improvement over the conventional I-caches in the $Delay{\cdot}Power{\cdot}Area$ metric.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11A
• /
• pp.1173-1181
• /
• 2007

A number of routing algorithms have been studied for wireless mobile ad-hoc network. Among them, the AODV routing algorithm with on-demand method periodically transmits hello message and monitors link state during data transmission in order to maintain routing paths. When a path is disconnected, a node that senses it transmits a RERR packet to the transmitting node or transmits a RREQ locally so that the path could be repaired. With that, the control packet such as a RREQ is broadcast, which causes the consumption of bandwidth and incurs data latency. This paper proposes a LRRLBP algorithm that locally repairs a path by predicting link state before disconnecting the path based on the AODV routing protocol for solving such problems. Intensive simulations with the results using NS-2 simulator are shown for verifying the proposed protocol.

• The KIPS Transactions:PartC
• /
• v.13C no.6 s.109
• /
• pp.685-690
• /
• 2006

This paper compares the performance of the unicast routing protocol and the broadcast routing protocol in a small-sized wireless multi-hop network, such as home network. Normally, ad-hoc routing protocols are designed for general wireless multi-hop networks, not being said to be optimized for the small-sized ad hoc network. This paper compares some unicast routing protocols and optimal broadcast routing protocol, and shows the result. The result of the simulation says the broadcast routing protocol shows better performance than the ad-hoc routing protocols in the small-sired wireless multi-hop network. Especially, the result shows that the broadcast protocol has higher packet delivery ratio and lower packet latency than unicast routing protocols

• The KIPS Transactions:PartC
• /
• v.12C no.6 s.102
• /
• pp.917-926
• /
• 2005

In this paper, we propose a transport layer mobility support protocol for multimedia streaming services in mobile/wireless environments by extending PR-SCTP to support mobility. We named the proposed scheme to be uPR-mSCTP. The rules related to provide unordered and unreliable data transfer, as well as an approach to minimize handover latency we proposed. Through the simulation results, it is shown that, since uPR-mSCTP reduces transmission rates during handover, not only it reduces the waste of network resources, but it also has the packet loss rate similar to FMIPv6, which is a lot smaller than UDP over MIPv6 or HMIPv6 It also incurs smaller control packet overhead compared to the network layer mobility support approaches.

• Journal of KIISE:Information Networking
• /
• v.35 no.1
• /
• pp.46-55
• /
• 2008

As a mobility support for IP have studied, Internet Engineering Task Force(IETF) standardized the Mobile IPv6(MIPv6) protocol. When a mobile node moves between subnets, MIPv6 maintains connectivity to network and supports seamless communication, and these processes are called a Handover. Whenever the mobile node moves between subnets, the Handover is performed. The mobile node can not communicate during the Handover. This period is Galled Handover latency. To reduce this latency, mipshop working group standardizes Fast Handovers for Mobile IPv6(FMIPv6), but latency which the mobile node registers its new care-of address to a home agent and a correspondent node is still long. To solve this problem, we propose a scheme that the mobile node registers the new care-of address to the home agent and initiates Return Routability procedure in advance during layer 2 handover, based on FMIPv6 and IEEE 802.11. We analyze MIPv6, FMIPv6 and the proposed scheme in term of packet transmission cost during the Handover. Compared to MIPv6 the proposed scheme gains 79% improvement, while it gains 31% improvement compared to FMIPv6.

• International Journal of Computer Science & Network Security
• /
• v.22 no.3
• /
• pp.236-244
• /
• 2022

Network Mobility Basic Support (NEMO BS) protocol has been accredited and approved by Internet Engineering Task Force (IETF) working group for mobility of sub-networks. Trains, aircrafts and buses are three examples of typical applications for this protocol. The NEMO BS protocol was designed to offer Internet access for a group of passengers in a roaming vehicle in an adequate fashion. Furthermore, in NEMO BS protocol, specific gateways referred to Mobile Routers (MRs) are responsible for carrying out the mobility management operations. Unfortunately, the main limitations of this basic solution are pinball suboptimal routing, excessive signaling cost, scalability, packet delivery overhead and handoff latency. In order to tackle shortcomings of triangular routing and Quality of Service (QoS) deterioration, the proposed scheme (Diff-FH NEMO) has previously evolved for end-users in moving network. In this sense, the article focuses on an exhaustive analytic evaluation at Home Agent (HA) entity of the proposed solutions. An investigation has been conducted on the signaling costs to assess the performance of the proposed scheme (Diff-FH NEMO) in comparison with the standard NEMO BS protocol and MIPv6 based Route Optimization (MIRON) scheme. The obtained results demonstrate that, the proposed scheme (Diff-FH NEMO) significantly improves the signaling cost at the HA entity in terms of the subnet residence time, number of mobile nodes, the number of DMRs, the number of LFNs and the number of CNs.

• Journal of Communications and Networks
• /
• v.17 no.6
• /
• pp.656-664
• /
• 2015

This study analyzes the performance of power-line communications for sending open automated demand response (OpenADR) signals. In particular, we study main channel disturbances that can affect end-to-end communications and which have not been previously studied in detail. Our analysis takes into account physical phenomena, such as background and impulsive noise sources, channel attenuation, and multipath effects, and considers the physical, network, and applications layers of the communications structure. The performance of the physical layer is the basis for computing the packet error rate. In analyzing application performance, we focus specifically on the latency in several communication environments. If a channel is impaired only by background noise, latencies are less than 40 seconds. With the addition of impulsive noise in the channel, this value increases as long as 68 seconds. Using these figures, we find that power-line technology is more suitable for "slow" demand programs, such as day-ahead or day-of curtailments, rather than ancillary services markets, which require near-real-time communication.

• Journal of Korea Multimedia Society
• /
• v.23 no.2
• /
• pp.247-254
• /
• 2020

The recent Internet environment is characterized by the explosion of certain types of data, as the data that people want is affected by certain issues. In this paper, we propose a load balancing technique that considers the data generation forms. The concept of this technique is to prioritize some type of data when it suddenly explodes. This is a technique to build an add-on middle box on a switch to monitor packets and give priority to a queue for load balancing. This technique worked when certain types of data exploded. SDN(Software Defined Networking) has the advantage of efficiently managing a number of network equipment. However, load balancing in the SDN environment has not been studied much. Applying the proposed load balancing technique in the SDN environment can save time and budget and easily implement our policies. When the proposed load balancing technique is applied to the SDN environment, it has been found that the techniques we want can be easily applied to the network systems, and that efficient data processing is possible when certain types of data explosion.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.7
• /
• pp.394-400
• /
• 2002

Networks of Workstations(NOWs), that has features of flexibility and scalability, recently has emerged as an inexpensive alternative to massively parallel multicomputers. However it is not easier to perform deadlock-free multicast than regular topologies like mash or hypercube. Single phase differential multicast(SPDM) is a modified multicast algorithm with less burden of the root node. By applying quality of serviece(QoS), a specific node can have differentiated service and artificial change of message flow pattern is also available. As the results of performance evaluation experiments, SPDM has lower latency and lower packet concentration rate of the root node than the case of SPAM, and has ability to control network load distribution among switch nodes by controlling the assignment rate among nodes.

• Journal of Communications and Networks
• /
• v.3 no.4
• /
• pp.342-350
• /
• 2001

The Internet routing instability, or the rapid fluctuation of network reachability information, is an important problem currently facing the Internet engineering community. High levels of network instability can lead to packet loss, increased network latency, and delayed routing convergence. At the extreme, high levels of routing instability can lead to the loss of internal connectivity in wide-area networks. In this paper, we investigate the variation of domain degree and domain count of the inter-domain network over time by using linear regression model in order to analyze the topology variation of inter-domain network. We Also propose an efficient policy management model to reduce the instability in the inter-domain routing system. The proposed model can be used to identify whether a routing policy is adequate to reduce convergence time that is required to return to a normal state when BGP routing instability happens. Experimental analysis shows that the proposed model can be used to set up routing policy in domains for the purpose of minimizing the effects and the propagation of BGP routing instability.