• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5174-5190
• /
• 2016

Recent years have witnessed an explosive growth of mobile devices, mobile cloud computing services offered by these devices and the remote clouds behind them. In this paper, we noticed ultra-low latency service, as a type of mobile cloud computing service, requires extremely short delay constraints. Hence, such delay-sensitive applications should be satisfied with strong QoS guarantee. Existing solutions regarding this problem have poor performance in terms of throughput. In this paper, we propose an end-to-end bandwidth resource reservation via software defined scheduling inspired by the famous SDN framework. The main contribution of this paper is the end-to-end resource reservation and flow scheduling algorithm, which always gives priority to delay sensitive flows. Simulation results confirm the advantage of the proposed solution, which improves the average throughput of ultra-low latency flows.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.3
• /
• pp.432-443
• /
• 1997

This paper presents contour simplification method and a regional hierarchical segmentation algorithm based on PSNR for the transmission of image in mobile communication, of which available bandwidth is very limited. It first takes into account the global information and produces a coarse segmentation, that is, with a small number of regions. Then, each segmented region has different quality. Thus, the region with low quality is selected by PSNR and improved by introducing regions corresponding to more local information. It is able to improve the subjective quality of image and reduce contour information. In addition, contour simplification method is proposed for the efficient lossless chain coding. The proposed method can be applied to the applications such as mobile communications and videotelephone through PSTN, of which the available transmission bandwidth is very limited.

• The KIPS Transactions:PartC
• /
• v.13C no.2 s.105
• /
• pp.227-234
• /
• 2006

In this paper, we propose a window based resource reservation scheme to minimize an waste bandwidth due to resource reservation in mobile networks. Specially, this scheme decides a proper timing to reserve resource by using the number of movement, which is provided by the differentiated handoff estimation model, among inner regions. In the previous resource reservation scheme[6], it requests a resource reservation to neighboring cells as soon as a mobile host enters or creates into a cell. But, after a proper time based on the number of movements in the differentiated handoff estimation model passes, the proposed scheme requests a resource reservation to neighboring cells. Because of this reason, it can improve resource utilization on mobile networks. And, this scheme differentiates resource reservation according to a request ratio for resource reservation to each neighboring cell. Also, this scheme improves resource reservation acceptance rate and bandwidth utilization.

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

The demand for next generation networks can be condensed into always-best-connected, ubiquitous, mobile, all-lP, and converged networks. IPv6 has been introduced for all-IP ubiquitous communications, and vehicles are coming to represent an important communication platform. In this paper. we propose various resource management schemes for in-vehicle mobile networks, which are adaptive to different hardware configurations. We focus on power and wireless bandwidth since they are critical resources for mobile communications. Based on the mobility characteristics of in-vehicle networks, we propose vehicle-aware power saving schemes. The main idea behind these power saving schemes is to adjust mobile router (MR) advertisement interval and binding lifetime. In addition, according to different wireless environments, we propose adaptive bandwidth management schemes using multihoming: best-connected MR selection based on location, and high-data-rate MR selection based on priority By mathematical analysis, it is shown that our schemes save power prominently for both the dormant nodes and active nodes. In addition, simulation results show that proposed multiple mobile router architecture outperforms previous simple redundant router architecture in preserving session and providing sufficient bandwidth.

• Journal of Internet Computing and Services
• /
• v.4 no.4
• /
• pp.65-74
• /
• 2003

Recently, It is required that multimedia data display on not only PC but also the Mobile device such as cellar phone, PDA. Mobile divieces has not sufficient of storage space or main memory and has slow network speed. So we can't process the multimedia data with the existing way on PC. This paper presents various methods for MultimediaPresentation which are able to display on the mobile device with the low-bandwidth and small storage. There Is an analysis that Is playable on the mobile device using presentation area devision method and replayable analysis method. If the display of multimedia presentation is impossible from this analysis, to apply prefetch techniques a using EPOB apoint and as User QoS of multimedia data through prefetch techniques have keep, do so that playable. Then, it is proposed to playable smooth multimedia presentation as that each of the presentations through prefetch Scheduling techniques point and quantity of data which are prefetch.

• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.493-504
• /
• 2007

With the advance and proliferation of computer and wireless network technology, it is common to access to network through the wireless network using mobile device. The ratio of using the streaming media out of many applications through the network is increasing not only in the wired network but also in the wireless network. The streaming media is much bigger than other contents and requires more network bandwidth to communicate and more computing resources to process. However the mobile devices have relatively poor computing resource and low network bandwidth. If the streaming media service is provided for mobile devices without any consideration about the network bandwidth and computing power, it is difficult for the client to get the service of high quality. Since especially mobile devices are supported with very limited energy capacity from the battery, the streaming media service should be adjusted to the varying energy state of mobile devices to ensure the complete playback of streaming media. In this paper, we propose a new method to guarantee the complete playback time of the streaming media for the mobile clients by dynamically controlling transmitted frame rate to the client according to the estimated available time of mobile device using battery model reflecting the characteristic of the battery. Since the proposed method controls the number of frames transmitting to the client according to the energy state of the mobile device, the complete playback time is guaranteed to mobile clients.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.3916-3936
• /
• 2014

Smartphone applications like games, image processing, e-commerce and social networking are gaining exponential growth, with the ubiquity of cellular services. This demands increased computational power and storage from mobile devices with a sufficiently high bandwidth for mobile internet service. But mobile nodes are highly constrained in the processing and storage, along with the battery power, which further restrains their dependability. Adopting the unlimited storage and computing power offered by cloud servers, it is possible to overcome and turn these issues into a favorable opportunity for the growth of mobile cloud computing. As the mobile internet data traffic is predicted to grow at the rate of around 65 percent yearly, even advanced services like 3G and 4G for mobile communication will fail to accommodate such exponential growth of data. On the other hand, developers extend popular applications with high end graphics leading to smart phones, manufactured with multicore processors and graphics processing units making them unaffordable. Therefore, to address the need of resource constrained mobile nodes and bandwidth constrained cellular networks, the computations can be migrated to resourceful servers connected to cloud. The server now acts as a bridge that should enable the participating mobile nodes to offload their computations through Wi-Fi directly to the virtualized server. Our proposed model enables an on-demand service offloading with a decision support system that identifies the capabilities of the client's hardware and software resources in judging the requirements for offloading. Further, the node's location, context and security capabilities are estimated to facilitate adaptive migration.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.709-730
• /
• 2017

To address the challenge of unprecedented growth in mobile data traffic, ultra-dense network deployment is a cost efficient solution to offload the traffic over some small cells. The overlapped coverage areas of small cells create more than one candidate access points for one mobile user. Signal strength based user association in IEEE 802.11 results in a significantly unbalanced load distribution among access points. However, the effective bandwidth demand of each user actually differs vastly due to their different preferences for mobile applications. In this paper, we formulate a set of non-linear integer programming models for joint user association control and user demand guarantee problem. In this model, we are trying to maximize the system capacity and guarantee the effective bandwidth demand for each user by soft-association control with a software defined network controller. With the fact of NP-hard complexity of non-linear integer programming solver, we propose a Kernighan Lin Algorithm based graph-partitioning method for a large-scale network. Finally, we evaluated the performance of the proposed algorithm for the edge users with heterogeneous bandwidth demands and mobility scenarios. Simulation results show that the proposed adaptive soft-association control can achieve a better performance than the other two and improves the individual quality of user experience with a little price on system throughput.

• Journal of Communications and Networks
• /
• v.16 no.3
• /
• pp.322-334
• /
• 2014

Multimedia content is very sensitive to packet loss and therefore multimedia streams are typically protected against packet loss, either by supporting retransmission requests or by adding redundant forward error correction (FEC) data. However, the redundant FEC information introduces significant additional bandwidth requirements, as compared to the bitrate of the original video stream. Especially on wireless and mobile networks, bandwidth availability is limited and variable. In this article, an adaptive FEC (A-FEC) system is presented whereby the redundancy rate is dynamically adjusted to the packet loss, based on feedback messages from the client. We present a statistical model of our A-FEC system and validate the proposed system under different packet loss conditions and loss probabilities. The experimental results show that 57-95%bandwidth gain can be achieved compared with a static FEC approach.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4293-4304
• /
• 2014

In order to ensure the wireless connectivity and seamless service to mobile users, the next generation network system will be an integration of multiple wireless access networks. In a heterogeneous wireless access system, bandwidth allocation becomes crucial for load balancing to avoid network congestion and improve system utilization efficiency. In this article, we propose a new dynamic bandwidth allocation scheme for hierarchical wireless network systems. First, we derive a multi-objective decision criterion for each access point. Second, a bargaining strategy selection algorithm is developed for the dynamic bandwidth re-allocation. Based on the intervenient Stackelberg game model, the proposed scheme effectively formulates the competitive interaction situation between several access points. The system performance of proposed scheme is evaluated by using extensive simulations. With a simulation study, it is confirmed that the proposed scheme can achieve better performance than other existing schemes under widely diverse network environments.