• Journal of Information Processing Systems
• /
• v.9 no.3
• /
• pp.365-378
• /
• 2013

In Wireless Mesh Networks (WMNs), we usually deploy multiple Internet Gateways (IGWs) to improve the capacity of WMNs. As most of the traffic is oriented towards the Internet and may not be distributed evenly among different IGWs, some IGWs may suffer from bottleneck problem. To solve the IGW bottleneck problem, we propose an efficient scheme to balance the load among different IGWs within a WMN. Our proposed load-balancing scheme consists of two parts: a traffic load calculation module and a traffic load migration algorithm. The IGW can judge whether the congestion has occurred or will occur by using a linear smoothing forecasting method. When the IGW detects that the congestion has occurred or will occur, it will firstly select another available IGW that has the lightest traffic load as the secondary IGW and then inform some mesh routers (MPs) which have been selected by using the Knapsack Algorithm to change to the secondary IGW. The MPs can return to their primary IGW by using a regression algorithm. Our Qualnet 5.0 experiment results show that our proposed scheme gives up to 18% end-to-end delay improvement compared with the existing schemes.

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

It is essential to satisfy class-specific QoS constraints to provide broadband services for new generation networks. The present study proposes a QoS-driven multicast scheme for wireless networks in which the transmission rate and end-to-end delay are assumed to be bounded during a multiple multicast session. A distributed algorithm was used to identify a cost-efficient sub-graph between the source and destination which can satisfy QoS constraints of a multicast session. The model was then modified as to be applied for wireless networks in which satisfying interference constraints is the main challenge. A discrete power control scheme was also applied for the QoS-aware multicast model to accommodate the effect of transmission power level based on link capacity requirements. We also proposed random power allocation (RPA) and gradient power allocation (GPA) algorithms to efficient resource distribution each of which has different time complexity and optimality levels. Experimental results confirm that the proposed power allocation techniques decrease the number of unavailable links between intermediate nodes in the sub-graph and considerably increase the chance of finding an optimal solution.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.15 no.6
• /
• pp.770-778
• /
• 2012

In this paper, we propose a multi-path construction scheme to improve the survivability of a multicast session in military hybrid networks. A military hybrid network consists of a static backbone network and multiple mobile stub networks where some nodes are frequently susceptible to be disconnected due to link failure and node mobility. To improve the survivability of multicast sessions, we propose a construction scheme of ${\kappa}$ redundant multi-paths to each receiver. In order to take account of different characteristics of static and mobile networks, we propose quite different multi-path setup approaches for the backbone and stub networks, respectively, and combine them at the boundary point called gateway. We prove that our proposed scheme ensures that each receiver of a multicast session has ${\kappa}$ redundant paths to the common source. Through simulations, we evaluate the performance of the proposed schemes from three aspects : network survivability, recovery cost, and end-to-end delay.

• Journal of Korea Game Society
• /
• v.4 no.4
• /
• pp.3-9
• /
• 2004

Expansion of internet and construction of high speed network which require multimedia services like MMORPG are exceeding the infra-structure. In this work, CBT is analyzed by focusing on the multicast routing protoco and the algorithm which is transformable to Anycast scheme from CBT scheme is suggested to adapt game traffic. Anycast routing scheme is suitable to distribute high density traffic. Simulation model was set per a number of group and group member, which enabled to reflect real environments. Performance evaluation of routing based on the characteristics of end-to-end delay of CBT and Anycast was mainly focused, The result showed that Anycast method was improved up 8.7%, 25.5%, 34.0%, 38.6% and 51.8%, 56.6% comparing with PIM-DM and CBT routing when packet site was 128, 512 and 1K byte respectively. From the simulation, CBT/Anycast routing scheme can be presented as a flexible and solid solution for the MMORPG traffic to improve the delay characteristics of game packets.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.6
• /
• pp.719-726
• /
• 2014

This paper addresses quality of experience(QoE) and how to measure and evaluate QoE including its subjective aspects. Adopting the real measurements on the field, a various quality metric have been measured for VoIP(voice over IP) service provided through a wireless interface of WiBro(Wireless Broadband). By analyzing the measured values and correlation between the metrics, we attempt to find a method to evaluate QoE of the VoIP service in a objective way. As a result, it has been shown that QoE of the VoIP service through WiBro network has close relation to the packet-level end-to-end delay, and the delay has close relation to received signal strength indicator(RSSI).

• The KIPS Transactions:PartC
• /
• v.13C no.4 s.107
• /
• pp.461-470
• /
• 2006

Recently mobile Stream Control Transmission Protocol (mSCTP) has been proposed as a transport layer approach for supporting mobility. When a mobile terminal (MT) is not located in the home network. a terminal that wishes to communicate with the MT is not able to establish mSCTP association to the MT, since mSCTP does not include the location management mechanism. In order to solve this problem. an interworking approach using the Session Initiation Protocol (SIP) INVITE method has been proposed. However, this approach has shown subsequent delay in acquiring the current location information of the MT when initiating mSCTP association establishment. In this paper, we propose new SIP methods and an approach that minimizes the address acquisition delay (AAD) by utilizing those SIP methods. Mathematical analysis and simulation results show that the proposed approach is more efficient than the previous approach in terms of AAD in all kinds of SIP environments.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.446-456
• /
• 2007

Increased access to broadband networks has led to a fast-growing demand for voice and video over IP(VVoIP) applications such as Internet telephony(VoIP), videoconferencing, and IP television(IPTV). For pro-active troubleshooting of VVoIP performance bottlenecks that manifest to end-users as performance impairments such as video frame freezing and voice dropouts, network operators cannot rely on actual end-users to report their subjective quality of experience(QoE). Hence, automated and objective techniques that provide real-time or online VVoIP QoE estimates are vital. Objective techniques developed to-date estimate VVoIP QoE by performing frame-to-frame peak-signal-to-noise ratio(PSNR) comparisons of the original video sequence and the reconstructed video sequence obtained from the sender-side and receiver-side, respectively. Since processing such video sequences is time consuming and computationally intensive, existing objective techniques cannot provide online VVoIP QoE. In this paper, we present a novel framework that can provide online estimates of VVoIP QoE on network paths without end-user involvement and without requiring any video sequences. The framework features the "GAP-model", which is an offline model of QoE expressed as a function of measurable network factors such as bandwidth, delay, jitter, and loss. Using the GAP-model, our online framework can produce VVoIP QoE estimates in terms of "Good", "Acceptable", or "Poor"(GAP) grades of perceptual quality solely from the online measured network conditions.

• The Journal of the Korea Contents Association
• /
• v.8 no.6
• /
• pp.34-42
• /
• 2008

MAC(Medium Access Control) is demanded to provide end-to-end QoS(Quality of Service) for a variety of traffic in the wireless networks. When all the traffic is integrated in the channel, the main difficulty of the MAC protocol is how to efficiently support multi-class traffic in the limited bandwidth wireless channel. In this paper, we proposed the dynamic bandwidth slot method for improving QoS of the real time traffics. In this paper, we used in-band scheme to send dynamic parameter and considering buffer size and delay variation, we enabled 2 state bits to send to base station in mobile station. The proposed algorithm is to guarantee QoS of real time traffic and maximize transfer efficiency in wireless networks.

• Industrial Engineering and Management Systems
• /
• v.15 no.3
• /
• pp.268-277
• /
• 2016

Load balancing is a significant technique to prolong a network's lifetime in sensor network. This paper introduces a hybrid approach named as Load Distributing Hybrid Routing Protocol (LDHRP) composed with a border node routing protocol (BDRP) and greedy forwarding (GF) strategy which will make the routing effective, especially in mobility scenarios. In an existing solution, because of the high network complexity, the data delivery latency increases. To overcome this limitation, a new approach is proposed in which the source node transmits the data to its respective destination via border nodes or greedily until the complete data is transmitted. In this way, the whole load of a network is evenly distributed among the participating nodes. However, border node is mainly responsible in aggregating data from the source and further forwards it to mobile sink; so there will be fewer chances of energy expenditure in the network. In addition to this, number of hop counts while transmitting the data will be reduced as compared to the existing solutions HRLBP and ZRP. From the simulation results, we conclude that proposed approach outperforms well than existing solutions in terms including end-to-end delay, packet loss rate and so on and thus guarantees enhancement in lifetime.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.8
• /
• pp.19-27
• /
• 2016

Nowadays the adaptive buffering techniques for burst stream packet configuration and its operation algorithm to save energy in IP core network have been studied. This paper explains the selection method of packet buffering interval for energy saving when configuring burst stream packet at the ingress router in IP core network. Especially the adaptive buffering interval and its implementation scheme are required to improve the energy saving efficiency at the input part of the ingress router. In this paper, we propose the best adaptive buffering scheme that a current buffering interval is adaptively buffering scheme based on the input traffic of the past buffering interval, and analyze its characteristics of energy saving and end-to-end delay by computer simulation. We show the improvement of energy saving effect and reduction of mean delay variation when using an appropriate inverse-function selecting the buffering interval for the configuration of burst stream packet in this paper. We confirm this method have superior properties compared to other method. The proposed method shows that it is less sensitive to the various input traffic type of ingress router and a practical method.