• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.9
• /
• pp.2078-2082
• /
• 2010

The general bus system architecture consists of masters, slaves, arbiter, decoder and so on in shared bus. As several masters can't use a bus concurrently, arbiter plays an role in bus arbitration. In compliance with the selection of arbitration method, The efficiency of bus usage can be determined. Fixed Priority, Round-Robin, TDMA, Lottery arbitration are studied in conventional arbitration method. Conventional arbitration method is considered bus priority primarily, actual bus utilization didn't considered. In this paper, we propose arbitration method using bus utilization operating block of each master, we verify the performance compared with the other arbitration methods through throughput performance. From the result of performance verification, we confirm that proposed arbitration method, matched bus utilization set by the user 40%, 20%, 20%, 20%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.5C
• /
• pp.399-410
• /
• 2002

Web cache, which is functionally another word of proxy server, is located between client and server. Web cache has a limited storage area although it has broad bandwidth between client and proxy server, which are usually connected through LAN. Because of limited storage capacity, existing objects in web cache can be deleted for new objects by some rules called replacement algorithm. Hit rate and byte-hit rate are general metrics to evaluate replacement algorithms. Most of the replacement algorithms do satisfy only one metric, or sometimes none of them. In this paper, we propose two replacement algorithms to achieve both high hit rate and byte-hit rate with great satisfaction. In the first algorithm, the cache is appropriately partitioned according to file types as a basic model. In the second algorithm, the cache is composed of two levels; the upper level cache is managed by the basic algorithm, but the lower level is collectively used for all types of files as a shared area. To show the performance of the proposed algorithms, we evaluate hit rate and byte-hit rate of the proposed replacement algorithms using the trace driven simulation.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.11
• /
• pp.56-65
• /
• 2009

As increasing the number of IPs integrated in a single chip and requiring high communication bandwidth on a chip, the trend of SoC communication architecture is changed from bus- or crossbar-based architecture to packet switched network architecture, NoC. However, highly complex control logics in routers require multiple cycles to switch packet. In this paper, we design low complex router to improve the communication latency. Our NoC design is verified by simulation platform modeled by ESL tool, SoC Designer. We also evaluate our NoC design comparing to the previous NoC architecture based on VC router. Our results show that our NoC architecture has less communication latency, even small throughput degradation (about 1-2%).

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.4
• /
• pp.403-410
• /
• 2010

The switched Ethernet has many features for real-time communications such as providing traffic isolation, large bandwidth, and full-duplex links, and so on. The switched Ethernet, however, cannot guarantee the timely delivery of a real-time message because message delay increases when collisions occurs at the output ports and message loss can even occur due to the overflow at the output buffer. Recently, many research efforts have been done to use the switched Ethernet as an industrial control network. In the industrial control network, sensors periodically sense the physical environment and transmit the sensed data to an actuator, and the periodic messages from sensors to actuators have typically real-time requirements such that those messages must be transmitted within their deadlines. This paper first suggests a feasible condition for EDF (Earliest Deadline First)-based scheduling of periodic messages on a synchronized switched Ethernet and a message scheduling algorithm which satisfies the proposed feasible condition. Pedreiras, et al. [10] suggested a feasible condition for message scheduling on the Ethernet (shared media Ethernet), but there has been no research result on the scheduling condition on the switched Ethernet until now. We compared the real-time message scheduling capacity between the Ethernet and the switched Ethernet by simulation. The simulation result shows that the message scheduling capacity of the Ethernet has almost remained constant as the number of nodes on the network increases, but, in the case of the switched Ethernet, the message scheduling capacity has increased linearly according to the number of nodes on the network.

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.589-596
• /
• 2002

Tn the data transmission service of the mobile host, it is needed to reduce the bandwidth and to make a reliable error recovery. there are two appropriate methods in that. One is FEC which retransmits the parity of error recovery, in case of happening of the loss after forming the parity of error recovery by grouping original data. The other is local recovery based on server which can block the implosion of transmission. The use of FEC and local recovery based on server at the same time enables the reliable multicast. This paper suggests algorithm that recovers the loss by FEC and local recovery based on server through the solution of the problems about triangle routing, tunnel convergence by dividing mobile host into two parts-the sender and the receiver. This model about the loss of algorithm tested the efficiency of performance by the homogeneous independent loss, the heterogeneous independent loss, the shared source link loss model. The suggested algorithm confirms effectiveness in the environment where there are much data and many receivers in mobile host.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.9
• /
• pp.1864-1869
• /
• 2012

We make an interference analysis to obtain a critical ctiteria for coexisting availability of WLAN and WiBro between adjacent channels can be used in TVWS(TV White Space). To meet this analysis, we set the various transmission parameters including the emission and blocking mask, antenna height and gain, transmission power and bandwidth, channel model etc. And, based on these parameters, we analyze on performances according to a variation of guard band, a number of service user and allowable transmit power of the user operating in the adjacent channels. In this paper, we consider a urban environment and apply a Extended Hata-SRD for WLAN and an interference link and Extended Hata model for WiBro, respectively. With these results, we can see how each system can be shared in an adjacent channel.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.7
• /
• pp.9-19
• /
• 2004

WLAN (Wireless Local Area Networks) needs error recovery and flow control schemes to support reliable multicast protocol. Limited wireless bandwidth, as well as queuing losses caused by the asymmetric wired/wireless interactions, demands more effective approaches for reducing packet losses. Moreover, since the wireless channel is a shared broadcast medium, if sender receives feedback information simultaneously from several receivers, the feedback delays data frame transmission of forward direction by introducing channel congestion and burden at the sender. Therefore, it is important to minimize the amount of feedback information from receivers. In this paper, we propose an ARS(Adaptive Redundancy Scheme) that combines FEC(Forward Error Correction) using channel state estimation and ARQ(Automatic Repeat Request) both to reduce the amount of feedback information and the number of retransmissions and to guarantee high data reliability in a WLAN multicast environment. Performance of the proposed scheme is evaluated by means of analysis and simulations in AWGN and Rayleigh fading channels. The results show that the proposed scheme reduces the amount of feedback information and the number of retransmissions and guarantees high data reliability, while keeping throughput efficiency similarly with the conventional FEC and ARQ scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.6A
• /
• pp.600-607
• /
• 2007

In this paper, we propose a MLKA (Multi-Level Keep-Alive) algorithm based on PRCG (Periodic In this paper, we propose a MLKA (Multi-Level Keep-Alive) algorithm based on PRCG (Periodic Ranging Code Group), in which periodic ranging codes are divided into groups. The AP (Access Point) performs this algorithm when a periodic ranging code arrives at the AP in a WiBro (Wireless Broadband Internet) system. In order to increase the traffic radio bandwidth resource efficiency in this system, we propose the multi-level keep-alive algorithm for finding abnormal AT (Access Terminal). From simulation results, it is verified our proposed MLKA algorithm based on PRCG can provide higher traffic radio resource efficiency compared to message-driven keep-alive algorithms.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.32 no.3
• /
• pp.565-573
• /
• 2022

Current mobile communication system is in the mid-process of conversion from 4G LTE to 5G network. According to the generalization of mobile communication services, personal information such as user's identifiers and location information is transmitted through a mobile communication network. The importance of security technology is growing according to the characteristics of wireless mobile communication networks, the use of wireless shared channels is inevitable, and security technology cannot be applied to all network system elements in order to satisfy the bandwidth and speed requirements. In particular, for security threat analysis, researches are being conducted on various attack types and vulnerability analysis through rogue base stations or attacker UE to make user services impossible in the case of 5G networks. In this paper, we established a 5G network testbed using open sources. And we analyzed three security vulnerabilities related to NAS COUNT and confirmed the validity of two vulnerabilities based on the testbed or analyzing the 3GPP standard.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.685-696
• /
• 2004

Real-time multimedia applications that require large amount of bandwidth need resource reservation before starting service for providing the QoS(i.e., Quality of Service). To reserve resources in advance, each reservation request has to notify its expectation on the required amount of resources and service duration. Using this information, a resource manager can schedule advance reservations. However, most existing resource management systems are adopting straightforward call admission control process (i.e., only immediate reservation) by checking currently available resources without considering the service duration. Hence, the resource management system that supports advance reservation has to manage confliction caused by indefinite service duration of immediate reservation. Even though the separation of resource pool according to type of reservation can prevent the confliction, it causes low resource utilization. In this paper, we propose an effective resource management scheme that supports both immediate and advance reservations by sharing resources dynamically. Using network cost function, the proposed scheme determines and adaptively adjusts resource boundary according to the confliction rate by varying weight parameters. And also, we define user utility function to quantify user satisfaction based on how well the reserved resource is guaranteed during service time. Simulation results using NS-2 network simulator show that the proposed scheme can achieve better resource utilization with preferable QoS than other schemes like static resource partitioning.