• Journal of Korea Multimedia Society
• /
• v.7 no.8
• /
• pp.1066-1077
• /
• 2004

Dramatic increase in the number of Internet users want highly qualified service of continuous media contents on the web. To solve these problems, we present two network caching schemes(PPC, PPCwP) which consider the characteristics of continuous media objects and user access pattern in this paper. While there are plenty of reasons to create rich media contents, delivering this high bandwidth contents over the internet presents problems such as server overload, network congestion and client-perceived latency. PPC scheme periodically calculates the popularity of objects based on the playback quantity and determines the optimal size of the initial fraction of a continuous media object to be cached in proportion to the calculated popularity. PPCwP scheme calculates the expected popularity using the series information and prefetches the expected initial fraction of newly created continuous media objects. Under the PPCwP scheme, the initial client-perceived latency and the data transferred from a remote server can be reduced and limited cache storage space can be utilized efficiently. Trace-driven simulation have been performed to evaluate the presented caching schemes using the log-files of iMBC. Through these simulations, PPC and PPCwP outperforms LRU and LFU in terms of BHR and DSR.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.4
• /
• pp.89-96
• /
• 2016

In this paper, we study mobile data collector (MDC) based data-gathering schemes in wireless sensor networks. In Such networks, MDCs are used to collect data from the environment and transfer them to the sink. The majority of existing data-gathering schemes suffer from high data-gathering latency because they use only a single MDC. Although some schemes use multiple MDCs, they focus on maximizing network lifetime rather than minimizing packet delay. In order to address the limitations of existing schemes, this paper focuses on minimizing packet delay for given number of MDCs and minimizing the number of MDCs for a given delay bound of packets. To achieve the minimum packet delay and minimum number of MDCs, two optimization problems are formulated, and traveling distance and traveling time of MDCs are estimated. The interior-point algorithm is used to obtain the optimal solution for each optimization problem. Numerical results and analysis are presented to validate the proposed method.

• The KIPS Transactions:PartB
• /
• v.9B no.3
• /
• pp.303-310
• /
• 2002

In this paper, we propose a proxy caching scheme that stores a portion of a continuous media object or an entire object on the Internet. The proxy stores the initial fraction of a continuous media object and determines the optimal size of the initial fraction of the continuous media object to be cached based on the object popularity. Under the proposed scheme, the initial latency of most clients and the data transferred from a remote server can be reduced and limited cache storage space can be utilized efficiently. Considering the characteristics of continuous media, we also propose the novel popularity for the continuous media objects based on the amount of the data of each object played by the clients. Finally, we have performed trace-driven simulations to evaluate our caching scheme and the popularity for the continuous media objects. Through these simulations, we have verified that our caching scheme, PPC outperforms other well-known caching schemes in terms of BHR, DSR and replacement and that popularity for the continuous media objects based on the amount of the playback data can enhance the performance of caching scheme.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.12
• /
• pp.1493-1503
• /
• 1999

ATM Clustering System과 같이 SAN(System Area Network) 환경에서 동작하는 시스템은 낮은 지연시간과 넓은 대역폭의 네트워크가 필수적이나 기존의 에러 복구 프로토콜들은 이러한 요구를 충족시키기에는 큰 오버헤드를 가지고 있다. 제안된 새로운 에러 복구 프로토콜은 ATM Clustering System 환경에서 최적의 성능을 나타내는 light-weight 프로토콜로 에러가 없는 상황과 에러 복구가 진행중인 상황에 따라 acknowledgement 주기를 적응적으로 변화시키는 adaptive acknowledgement scheme를 제안하여 적용하였다. 제안된 프로토콜은 상용 툴인 SDT를 이용한 논리 검증 받았고, DEVSim++ 환경에서의 성능 분석을 통해 프로토콜이 최상의 성능을 보이기 위한 파라메터 값을 찾았고, 이 값을 적용하였을 때의 성능을 기존의 프로토콜과 비교하여 제안된 프로토콜이 더 우수함을 확인하였다.Abstract While a system working with SAN, such as ATM Clustering System, requires a network with low latency and wide bandwidth, the previous error recovery protocols have a serious network overhead to satisfy this requirement. The suggested error recovery protocol is a light-weight protocol which can shows its best performance at ATM Clustering System and uses a newly suggested adaptive acknowledgement scheme. In the adaptive acknowledgement scheme, the period of acknowledgement is dynamically changed depending on the state of the network. We proved the logical correctness of our protocol with SDT and did performance analysis with DEVSim++. From the analysis, we found the optimal parameter values for best performance and showed that our protocol works better than the previous error recovery protocols.

• Journal of Internet Computing and Services
• /
• v.6 no.3
• /
• pp.55-70
• /
• 2005

In order to provide mobile hosts with multicast service in mobile communication environment, we proposed a multicast mechanism named HXcast++ which is an extended version of the existing Xcast++ with hierarchical architecture, We assured that mobile hosts could get multicast service through an optimal path regardless of their location by making DR(Designated Router) join a group on behalf of the mobile hosts, In this present research we introduced hierarchical architecture in order to reduce the maintenance cost resulting from frequent handoff. We also proposed a GMA (Group Management Agent) based group management mechanism which enables the mobile hosts to join the group without waiting for a new IGMP Membership Query. A fast handoff method with L2 Mobile Trigger was, in this work, employed in order to reduce the amount of the packet loss which occurs as a result of the handoff, We also managed to curtail the packet loss caused by the latency of the group join by using a buffering and forward mechanism.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.235-242
• /
• 2007

Network Mobility Basic Support protocol reduces location-update signaling by making network movements transparent to the mobile nodes (MNs) behind the mobile router (MR), but causes some problems such as sub-optimal routing and multiple encapsulations. This paper proposes an Route Optimization Employing HMIP Extension for Mobile Networks (ROHMIP) scheme for nested nubile networks support which introduces HMIP concept with relation information between MNNs behind a MR and the MR in order to localize handoff, to optimize routing and especially reduce handoff signal overhead. With ROHMIP, a mobile network node (MNN) behind a MR performs route optimization with a correspondent node (CN) as the MR sends a binding update message (BU) to mobility anchor point (MAP) via root-MR on behalf of all active MNNs when the mobile network moves. This paper describes the new mechanisms and provides simulation results which indicate that our proposal reduces transmission delay, handoff latency and signaling overhead.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6B
• /
• pp.544-550
• /
• 2006

Next-generation wireless/mobile networks are envisioned to have an IP-based infrastructure. One of the research challenges for next-generation all IP-based networks is the design of intelligent mobility management technologies that have a seamless mobility and minimal signaling overhead. Recently, HMIPv6 was proposed by the IETF for efficient mobility management. HMIPv6 reduces the amount of signaling and improves the performance of MIPv6 in terms of handover latency. However the MAP can be a single point of performance bottleneck when there are a lot of local movements. HMIPv6 can cause signaling overhead due to the unnecessary location update of idle mobile nodes. Therefore, in this paper, we propose the dynamic paging Mobile IPv6 that reduces the signaling cost of the unnecessary location updates using IP paging and organizes dynamically optimal MAP area according to user's mobility and traffic. We show performance results that are obtained from the average total location update cost and packet delivery cost.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.23 no.1
• /
• pp.1-13
• /
• 2012

AESA radar is able to instantaneously and adaptively position and control the beam, and such adaptive beam pointing of AESA radar enables to remarkably improve the multi-mission capability, compared with mechanically scanned array radar. AESA radar brings a new challenges, radar resource management(RRM), which is a technique efficiently allocating finite resources, such as energy and time to each task in an optimal and intelligent way. Especially radar beam scheduling is the most critical component for the success of RRM. In this paper, we proposed the several dispatching rules for radar beam scheduling, and compared the performance on the multi-function radar scenario. We also showed that the dispatching rule which differently applying SPF(Shortest Processing time First) and ERF(Earliest Request time First) according to beam processing latency is the most efficient.

• The KIPS Transactions:PartC
• /
• v.14C no.1 s.111
• /
• pp.73-80
• /
• 2007

In conventional on-demand mobile ad hoc routing algorithms, an alternate path is sought only after an active path is broken. It incurs a significant cost in terms of money and time in detecting the disconnection and establishing a new route. In this thesis, we propose proactive route selection and maintenance to conventional mobile ad hoc on-demand routing algorithms. The key idea for this research is to only consider a path break to be likely when the signal power of a received packet drops below an optimal threshold value and to generate a forewarning packet. In other words, if a path is lost with high probability, the neighboring node that may easily be cut off notifies the source node by sending a forewarning packet. Then the source node can initiate route discovery early and switched to a reliable path potentially avoiding the disconnection altogether. For the simulational study, network simulator(NS2) is used. The result of simulation shows that the algorithm significantly improves the performance of networks comparing to conventional on-demand routing protocols based on DSR and AODV in terms of packet delivery ratio, packet latency and routing overhead.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.10
• /
• pp.1862-1878
• /
• 2011

With the advances in wireless communication technology and the advent of smartphones, research on location-based services (LBSs) is being actively carried out. In particular, several spatial index methods have been proposed to provide efficient LBSs. However, finding an optimal indexing method that balances query performance and index size remains a challenge in the case of wireless environments that have limited channel bandwidths and device resources (computational power, memory, and battery power). Thus, mechanisms that make existing spatial indexing techniques more efficient and highly applicable in resource-limited environments should be studied. Bitmap-based Spatial Indexing (BSI) has been designed to support LBSs, especially in wireless broadcast environments. However, the access latency in BSI is extremely large because of the large size of the bitmap, and this may lead to increases in the search time. In this paper, we introduce a Selective Bitmap-based Spatial Indexing (SBSI) technique. Then, we propose an Adaptive Bitmap-based Spatial Indexing (ABSI) to improve the tuning time in the proposed SBSI scheme. The ABSI is applied to the distribution of geographical objects in a grid by using the Hilbert curve (HC). With the information in the ABSI, grid cells that have no objects placed, (i.e., 0-bit information in the spatial bitmap index) are not tuned during a search. This leads to an improvement in the tuning time on the client side. We have carried out a performance evaluation and demonstrated that our SBSI and ABSI techniques outperform the existing bitmap-based DSI (B DSI) technique.