• Journal of KIISE:Information Networking
• /
• v.36 no.1
• /
• pp.34-42
• /
• 2009

In this paper, we propose a practical hybrid transport error control scheme to provide SVC video streaming service over error-prone IP networks. Many error control mechanisms for various video coding standards have been proposed in the literature. However, there is little research result which can be practically applicable to the multilayered coding structure of SVC(the scalable extension of H.264/AVC). We present a new hybrid transport error control scheme that efficiently combines layered Forward Error Correction(FEC) and Automatic Repeat Request(ARQ) for better packet-loss resilience. In the proposed hybrid error control, we adopt ACK-based ARQ instead of NACK-based ARQ to maximize throughput which is the amount of effective data packets delivered over a physical link per time unit. In order to prove the effectiveness of the proposed hybrid error control scheme, we adopt NIST-Net network emulator which is a general-purpose tool for emulating performance dynamics in IP networks. It is shown by simulations over the NIST-Net that the proposed hybrid error control scheme shows improved packet-loss resilience even with much less number of overhead packets compared to various conventional error control schemes.

• Journal of KIISE:Information Networking
• /
• v.34 no.3
• /
• pp.218-225
• /
• 2007

As the research on home network technologies, sensor network technologies, and ubiquitous network technologies makes rapid progresses, wireless ad-hoc network have attracted a lot of attention. A wireless mobile ad-hoc network is a temporary network formed by a collection of wireless mobile nodes without the aid of any existing network infrastructure or centralized administration, and it is suitable for ubiquitous computing environments. In this paper, we suggest an extension scheme of a wireless mobile ad-hoc network based on limited multiple paths source routing protocol. This scheme reduces the overhead of route re-establishment and re-registration by maintaining link/node non-disjoint multiple paths between mobile hosts in a wireless mobile ad-hoc network or a mobile host in a wireless mobile ad-hoc network and a base station supporting fixed network services. By maintaining multiple paths, our scheme provides short end-to-end delay and is reliable extension scheme of a wireless mobile ad-hoc network to a fixed network. In this paper, our simulations show that our scheme outperforms existing schemes with regards to throughput and end-to-end delay. Also we show that our scheme outperforms multi-paths approach using disjoint routes with regards to routing overhead.

• Journal of KIISE:Information Networking
• /
• v.34 no.3
• /
• pp.226-238
• /
• 2007

In this paper, we present a novel fully distributed topology control protocol that can construct the multiple-ring topology of Minimal Connected Dominating Set (MCDS) as the transport backbone for mobile ad hoc networks. It makes a topology from the minimal nodes that are chosen from all the nodes, and the constructed topology is comprised of the minimal physical links while preserving connectivity. This topology reduces the interference. The all nodes work as the nodes of the distributed parallel Boltzmann machine, of which the objective function is consisted of two Boltzmann factors: the link degree and the connection domination degree. To define these Boltzmann factors, we extend the Connected Dominating Set into a fuzzy set, and also define the fuzzy set of nodes by which the multiple-ring topology can be constructed. To construct the transport backbone of the mobile ad hoc network, the proposed protocol chooses the nodes that are the strong members of these two fuzzy sets as the clusterheads. We also ran simulations to provide the quantitative comparison against the related works in terms of the packet loss rate and the energy consumption rate. As a result, we show that the network that is constructed by the proposed protocol has far better than the other ones with respect to the packet loss rate and the energy consumption rate.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.1
• /
• pp.32-39
• /
• 2015

The voice communications with wireless backbone based networks are evolving into a packet switching VoIP systems. In those networks, a call processing scheme is required for management of subscribers and connection between them. A VoIP service scheme for those systems requires reliable subscriber management and connection establishment schemes, but the conventional call processing schemes based on the centralized server has lack of reliability. Thus, the mutual-backup architecture of SIP-servers is required to ensure efficient subscriber management and reliable VoIP call processing capability, and the synchronization and call processing schemes should be changed as the architecture is changed. In this paper, a mutual-backup architecture of SIP-servers is proposed for wireless backbone based networks. A message format for synchronization and information exchange between SIP servers is also proposed in the paper. This paper also proposes a FSM scheme for the fast call processing in unreliable networks to detect multiple servers at a time. The performance analysis results show that the mutual backup server architecture increases the call processing success rates than conventional centralized server architecture. Also, the FSM scheme provides the smaller call processing times than conventional SIP, and the time is not increased although the number of SIP servers in the networks is increased.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.20 no.9
• /
• pp.835-842
• /
• 2009

DVB-SSP is a new broadcasting system for hybrid satellite communications, which supports mobile handheld systems and fixed terrestrial systems. However, a critical factor must be considered in upper layer decoding which including erasure Reed-Solomon error correction combined with cyclic redundancy check. If there is only one bit error in an IP packet, the entire IP packet is considered as unreliable bytes, even if it contains correct bytes. IF, for example, there is one real byte error, in an If packet of 512 bytes, 511 correct bytes are erased from the frame. Therefore, this paper proposed two kinds of upper layer decoding methods; LLR-based decoding and hybrid decoding. By means of simulation we show that the performance of the proposed decoding algorithm is superior to that of the conventional one.

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

Current end-to-end congestion control depends only on the information of end points (using three duplicate ACK packets) and generally responds slowly to the network congestion. This mechanism can't avoid TCP global synchronization which TCP congestion window size is fluctuated during congestion occurred and if RTT (Round Trip Time) is increased, three duplicate ACK packets is not a correct congestion signal because congestion maybe already disappeared and the host may send more packets until receive the three duplicate ACK packets. Recently there is increasing interest in solving end-to-end congestion control using active network frameworks to improve the performance of TCP protocols. ACC (Active congestion control) is a variation of TCP-based congestion control with queue management In addition traffic modifications nay begin at the congested router (active router) so that ACC will respond more quickly to congestion than TCP variants. The advantage of this method is that the host uses the information provided by the active routers as well as the end points in order to relieve congestion and improve throughput. In this paper, we model enhanced ACC, provide its algorithm which control the congestion by using information in core networks and communications between active routers, and finally demonstrate enhanced performance by simulation.

• Journal of KIISE:Information Networking
• /
• v.32 no.3
• /
• pp.391-403
• /
• 2005

Several nv6 mobility support protocols for mobile Internet services are proposed in IETP : Mobile Ipv6, Hierarchical Mobile Ipv6, and Fast Handovers over Mobile Ipv6. Recently, IEEE 802.11 network has also been widely deployed in public areas for mobile Internet services. In the near future, IPv6 mobility support over IEEE 802.11 network is expected to be a key function to actualize the All If-based mobile various services. For appropriate application of these protocols, the IPv6 mobility support protocols should be analyzed according to their characteristics in terms of signaling, handover latency, lost packets, and required buffer sire as well as the impact of lower layer such as IEEE 802.11 network. In this paper, we analyze the performance of the protocols over IEEE 802.11 network. We define a packet-level traffic model, a network system model, and a mobility model. From these models, we construct a framework for the performance analysis. We also make cost functions to formalize each protocol's performance. Lastly, we analyze the effect of varying parameters used to show diverse numerical results, and compare with each other. From the analysis results, it is concluded that each Protocol has contrary or contrastive advantages with other Protocols, so there is no protocol that holds a dominant position.

• Journal of KIISE:Information Networking
• /
• v.28 no.2
• /
• pp.251-261
• /
• 2001

The traffic on the Internet has been growing exponentially for some time. This growth is beginning to stress the current-day routers. However, switching technology offers much higher performance. So the label switching network which combines IP routing with switching technology, is emerged. EspeciaJJy in the data driven label switching, flow classification and cache table management are needed. Flow classification is to classify packets into switching and non-switching packets, and cache table management is to maintain the cache table which contains information for flow classification and label switching. However, the cache table management affects the performance of label switching network considerably as well as flowclassification because the bigger cache table makes more packet switched and maintains setup cost lower, but cache is restricted by local router resources. For that reason, there is need to study the cache replacement scheme for the efficient cache table management with the Internet traffic characterized by user. So in this paper, we propose several cache replacement schemes for label switching network. First, without the limitation at switching capacity in the router. we introduce FIFO(First In First Out). LFC(Least Flow Count), LRU(Least Recently Used! scheme and propose priority LRU, weighted priority LRU scheme. Second, with the limitation at switching capacity in the router, we introduce LFC-LFC, LFC-LRU, LRU-LFC, LRU-LRU scheme and propose LRU-weighted LRU scheme. Without limitation, weighted priority LRU scheme and with limitation, LRU-weighted LRU scheme showed best performance in this paper.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.12
• /
• pp.17-23
• /
• 2010

In the mobile cloud computing, the mobile node should request and receive the services while being connected. In PMIPv6, all packets sent by mobile nodes or correspondent nodes are transferred through the local mobility anchor. This unnecessary detour still results in high delivery latency and significant processing cost. Several PMIPv6 route optimization schemes have been proposed to solve this issue. However, they also suffer from the high signaling costs and handover latency when determining the optimized path. We propose the route optimization handover scheme which adopts the prediction algorithm in PFMIPv6. In the proposed scheme, the new mobile access gateway establishes the bi-directional tunnel with the correspondent node's MAG using the context message when the mobile node's handover is imminent. This tunnel may eliminate the need of separate route optimization procedure. Hence, the proposed scheme can reduce the signaling cost than other conventional schemes do. Analytical performance evaluation is preformed to show the effectiveness of the proposed scheme. The result shows that our scheme is more effective than other schemes.

• Journal of IKEEE
• /
• v.5 no.1 s.8
• /
• pp.8-15
• /
• 2001

This paper remarks IETF based requirements for IP/UDP/RTP header compression issued in 3GPP2 All IP Ad Hoc Meeting and protocol stacks of the next generation mobile station. All IP Network, for real time application such as Voice over IP (VoIP) multimedia services based on 3GPP2 3G cdma2000. Frames for various protocols expected in the All IP network Mobile Station (MS) are explained with several figures including the bit-for-bit notation of header format based on IETF draft of Robust Header Compression Working Group (ROHC). Especially, this paper includes problems of IS-707 Radio Link Protocol (RLP) for header compression which will be expected to modify in All IP network MS's medium access layer to accommodate real time packet data service[1]. And also, since PPP has also many problems in header compression and mobility aspects in MS protocol stacks for 3G cdma2000 packet data network based on Mobile IP (PN-4286)[2], we introduce the problem of solution for header compression of PPP. Finally. we suggest the guidelines for All IP network MS header compression about expected protocol stacks, radio resource efficiency and performance.