• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.57-64
• /
• 2012

Multiplayer, real-time games are a kind of soft real-time systems because a game server has to respond to requests from many clients within specified time constraints. Client events have different timeliness and consistency requirements according to their nature in the game world. These requirements lead to different priorities on CPU processing. Events can be divided into different groups, depending on their consistency degree and priority. To handle these events with different priority and meet their timing constraints, we propose a priority-based group task scheduling policy in this paper. The number of clients or events requested by each client may be increased temporarily. In the presence of transient overloading, the game server needs to allocate more CPU bandwidth to serve an event with the higher priority level preferentially. The proposed scheduling policy is capable of enhancing real-time performance of the entire system by maximizing the number of events with higher priority completed successfully within their deadlines. The performance of this policy is evaluated through extensive simulation experiments.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.5
• /
• pp.141-151
• /
• 2012

This paper suggests more simple algorithm than Hungarian algorithm for assignment problem. Hungarian algorithm selects minimum cost of row and column, and subtracts minimum cost from each cost. Then, performs until the number of minimum lines with 0 equals the number of rows. But, the proposed algorithm selects the minimum cost for each rows only. From the start point with over 2 to the target point with null selects in column, fixes the maximum opportunity cost that the difference of the cost of starting point and target point, and moves the cost less than opportunity cost th more than previous cost. For the 25 balance and 7 unbalance assignment problems, This algorithm gets the optimal solution same as Hungarian algorithm. This algorithm improves the time complexity $O(n^3)$ of Hungarian algorithm to $O(n^2)$, and do not performs the transformation process from unbalance to balance assignment in Hungarian algorithm. Therefore, this algorithm can be alter Hungarian algorithm in assignment problem.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.2
• /
• pp.275-280
• /
• 2013

With rapidly growing mobile wireless services, the existing copper-based mobile backhaul technologies suffer from reaching the capacity limits. PON technologies is drawing attention as a key solution to replace the existing mobile backhaul technologies due to not only providing innovative network capacity but also cost-effective maintenance caused by the bandwidth gain from optical fibers. With a PON-based mobile backhaul, broadband wireless multimedia services such as a video conference and IPTV can be seamlessly provided. In this paper, we first introduce overview of the PON-based mobile backhaul technology. For a example of practical integration, three types of EPON-WiMAX integrated architectures are proposed and comparatively analyzed in term of costs and network performance. Then, applicable plan and anticipated effects are presented when applying network coding on the PON-based mobile backhaul to improve the performance of delivering multicast traffic.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.3
• /
• pp.1-7
• /
• 2017

This paper proposes a discrete logarithm algorithm that largely reduces execution times of Pollard's Rho and Brent's algorithm in obtaining ${\gamma}$ from ${\alpha}^{\gamma}{\equiv}{\beta}$(mod p). The proposed algorithm can be distinguished from the conventional Brent's algorithm by three major features: it sets an initial value as $x_0={\alpha}{\beta}$ in lieu of $x_0=1$; replaces $y=x_i$, ($i=2^k$) pointer with $y_j{\leftarrow}x_i$, ($i=2^k$, $1{\leq}j{\leq}10$) for a Queue the size 10; and detects collision of ${\beta}_{\gamma}$, ${\beta}_{{\gamma}^{\prime}}$, ${\beta}_{{\gamma}^{-1}}$ instead of ${\beta}_{\gamma}$. This Queue method has reduced the execution time of Pollard's Rho algorithm with $x_0=y_0=1$ by 65.02%, and that of Brent's algorithm with $x_0=1$ by 47.80%.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.2
• /
• pp.209-214
• /
• 2020

The equitable partitioning problem(EPP) is classified as [0/1] binary skill existence or nonexistence and integer skill levels such as [1,2,3,4,5]. There is well-known a polynomial-time optimal solution finding algorithm for binary skill EPP. On the other hand, tabu search a kind of metaheuristic has apply to integer skill level EPP is due to unknown polynomial-time algorithm for it and this problem is NP-hard. This paper suggests heuristic greedy algorithm with polynomial-time to find the optimal solution for integer skill level EPP. This algorithm descending sorts of skill level frequency for each field and decides the lower bound(LB) that more than the number of group, packing for each group bins first, than the students with less than LB allocates to each bin additionally. As a result of experimental data, this algorithm shows performance improvement than the result of tabu search.

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

Recently, orthogonal frequency-division multiplexing(OFDM), with clusters of subcarriers allocated to different subscribers(often referred to as OFDMA), has gained much attention for its ability in enabling multiple-access wireless multimedia communications. In such systems, carrier frequency offsets (CFOs) can destroy the orthogonality among subcarriers. And the mismatch in sampling frequencies between transmitter and receiver can lead to serious degradation due to the loss of orthogonality between the subcarriers. As a result, multiuser interference (MUI) along with significant performance degradation can be induced. In this paper, we present a scheme to compensate for the SFOs and CFOs at the base station of an OFDMA system. A novel sampling frequency offset estimation algorithm is proposed, which is based on the repetition of a symbol at the communication start-up. Then, circular convolutions are employed to generate the interference after the discrete Fourier transform processing, which is then removed from the original received signal to increase the signal to interference power ratio(SIR). Simulation result shows that the proposed scheme can improve system performance.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.5
• /
• pp.87-93
• /
• 2014

For n/m=qm+r, there is no simple divisibility rule for simple m=7 such that is the n multiply by m? This problem can be more complex for two or more digits of m. The Dunkels method has been known for generalized divisibility test method, but this method can not compute very large digits number that can not processed by computer. This paper suggests simple and exact divisibility method for m completely irrelevant n and m of digits. The proposed method sets $r_1=n_1n_2{\cdots}n_l(mod m)$ for $n=n_1n_2n_3{\cdots}n_k$, $m=m_1m_2{\cdots}m_l$. Then this method computes $r_i=r_{i-1}{\times}10+n_i(mod m)$, $i=2,3,{\cdots}k-l+1$ and reduces the digits of n one-by-one. The proposed method can be get the quotient and remainder with easy, fast and correct for various n,m experimental data.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.5
• /
• pp.157-163
• /
• 2017

The binary and interpolation search algorithms are the most famous among search area algorithms, the former running in $O(log_2n)$ on average, and the latter in $O(log_2log_2n)$ on average and O(n) at worst. Also, the interpolation search use only the probability of key value location without priori information. This paper proposes another search algorithm, which I term a 'hybrid block and interpolation search'. This algorithm employs the block search, a method by which MSB index of a data is determined as a block, and the interpolation search to find the exact location of the key. The proposed algorithm reduces the search range with priori information and search the reduced range with uninformed situation. Experimental results show that the algorithm has a time complexity of $O(log_2log_2n_i)$, $n_i{\simeq}0.1n$ both on average and at worst through utilization of previously acquired information on the block search. The proposed algorithm has proved to be approximately 10 times faster than the interpolation search on average.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.9 no.1
• /
• pp.42-48
• /
• 2010

In this paper, we proposed analysis performance improvement technique for T-DMB watermarking based on MBOK spread spectrum. By applying the proposed scheme to T-DMB system, it allows additional data transmission and improves spectral efficiency of data transmission through watermarking spreading code. Using MBOK spread spectrum technique, data rate improved 2m-times existing direct sequence spread spectrum. However, since hardware complexity increase as the value of m becomes large, the method should be used with optimal situation. We analyze T-DMB watermarking techniques performance with MBOK spread spectrum and averaging. As a result, we confirm DER performance of MBOK spread spectrum scheme and it is shown system performance is improved as the number of averaging increases. The results of the paper can be applied to wireless multimedia digital broadcasting system.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.3
• /
• pp.101-108
• /
• 2009

Since the use of wireless communication instruments was standardized, users expect to be provided with seamless information whenever and wherever they use the instruments. Also, some technology is required to satisfy the users' needs which will cover their mobility. To support the mobility of host, the Internet Engineering Task Force (lETF) Mobile IP Working Group proposed a protocol called MIPv6 (Mobile IPv6). But in the case of the existing MIPv6, sometimes Mobile Node cannot receive data packet if Handover occurs although it is a temporal phenomenon. For solving these Handover problems, there are many methods like FMIPv6 (Fast Handover for Mobile IPv6) and HMIPv6 (Hierarchical Mobile IPv6) have been suggested. This paper suggested the use of Dual Buffer of Access Point and an effective way of registration as a way of reducing delayed time caused by Handover. Also, it analyzed and compare the existing MIPv6 with a proposed scheme concerning delayed time of Handover. Finally, the main objective of this paper is to proposed scheme that can reduce the delayed time of Handover compare to the existing MIPv6.