• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.9
• /
• pp.3008-3028
• /
• 2022

In this paper, we investigate traffic scheduling for a delay-sensitive multi-hop relay network, and aim to minimize the priority-based end-to-end delay of different data packet via joint relay selection, subcarrier assignment, and power allocation. We first derive the priority-based end-to-end delay based on queueing theory, and then propose a two-step method to decompose the original optimization problem into two sub-problems. For the joint subcarrier assignment and power control problem, we utilize an efficient particle swarm optimization method to solve it. For the relay selection problem, we prove its convexity and use the standard Lagrange method to deal with it. The joint relay selection, subcarriers assignment and transmission power allocation problem for each hop can also be solved by an exhaustive search over a finite set defined by the relay sensor set and available subcarrier set. Simulation results show that both the proposed routing scheme and the resource allocation scheme can reduce the average end-to-end delay.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.3
• /
• pp.213-219
• /
• 2017

Recently, the Internet Protocol Television (IPTV) services have become very common, enabling various Internet-based services as well as watching TV. In the IPTV system, a Set-Top box (STB) plays a key role as a network terminal device that transmits and receives realtime multimedia contents. In addition, the IPTV networks are usually supported by broadband optical fiber-base network such as fiber-to-the-home (FTTH), However, a general IPTV STB is regarded as one of the local area network (LAN)-attached devices while sharing the bandwidth of the LAN (e.g., Ethernet). In order to overcome the limited bandwidth utilization by fully facilitating the broadband bandwidth (e.g., 1 Gbps) of the optical fiber-based network, we propose a new FC (Fiber Channel)-embedded IPTV STB which can be directly attached to the optical fiber network. Then, we verify that the impacts of the proposed FC-embedded IPTV STB by organizing the the FC-AL (Fiber Channel-Arbitration Loop) network equipped with the FC-embedded IPTV We measures the average Start-up Delay, Average Reject Ratio and the Number of Concurrent Users through extensive simulations to investigate the performances of the suggested FC-AL-based IPTV network. Surprisingly, the IPTV network architecture with the proposed FC-embedded IPTV STBs has an excellent average start-up delay of less than 10 msec, an acceptable average reject ratio of less than 3 % as well as a linear increase of the number of concurrent users when extending the architecture. This reveals that the proposed FC embedded STB has a superior impacts on the performance of the entire IPTV network by effectively utilizing the broadband bandwidth of the fiber optic-based network.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.3
• /
• pp.997-1005
• /
• 2010

Recently, there has been a growing interest in the use of WLAN technology due to its easy deployment, flexibility and so on. Examples of WLAN applications range from standard internet services such as Web access to real-time services with strict latency/throughput requirements such as multimedia video and voice over IP on wireless network environments. Fair and efficient distribution of the traffic loads among APs(Access Points) has become an important issue for improved utilization of WLAN. This paper focuses on an AP selection scheme for achieving better load balance, and hence increasing network resource utilization for each user on wireless network environments. This scheme makes use of active scan patterns and the network delay as main parameters of load measurement and AP selection. This scheme attempts to estimate the AP traffic loads by observing the up/down delay and utilize the results to maximize the link resource efficiency through load balancing. We compared the proposed scheme with the original SNR(Signal to Noise Ratio)-based scheme using the NS-2(Network Simulation.2). We found that the proposed scheme improves the throughput by 12.5% and lower the network up/down link delay by 36.84% and 60.42%, respectively. All in all, the new scheme can significantly increase overall network throughput and reduce up/down delay while providing excellent quality for voice and video services.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.11 no.4
• /
• pp.9-17
• /
• 2007

Network Mobility basic support protocol (NEMO Basic) extends the operation of Mobile IPv6 to provide uninterrupted Internet connectivity to the communicating nodes of mobile networks. The protocol uses a mobile router (MR) in the mobile network to perform prefix scope binding updates with its home agent (HA) to establish a bi-directional tunnel between the HA and MR. This solution reduces location-update signaling by making network movements transparent to the mobile nodes (MNs) behind the MR. However, delays in data delivery and higher overheads are likely to occur because of sub-optimal routing and multiple encapsulation of data packets. To manage the mobility of the mobile network, it is important to minimize packet overhead, to optimize routing, and to reduce the volume of handoff signals over the nested mobile network. This paper proposes en aggregate router-assisted route optimization (ARARO) scheme for nested mobile networks support which introduces a local anchor router in order to localize handoff and to optimize routing. With ARARO, 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 aggregate router (AGR) via root-MR on behalf of all active MNNs when the mobile network moves. This paper describes the new architecture and mechanisms and provides simulation results which indicate that our proposal reduces transmission delay, handoff latency and signaling overhead. To evaluate the scheme, we present the results of simulation.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1999.12a
• /
• pp.121-129
• /
• 1999

When continuous media are transmitted over the communication networks, asynchrony which can not maintain temporal relationships among packets may occur due to a random transit delay. There exist two types of synchronization schemes ; for guaranteed or non-guaranteed resource networks. The former which applies a resource reservation technique maintains delay characteristics, however, the latter supply a best-effort service. In this paper, I propose a intra-media synchronization scheme to transmit continuous media on general networks not guaranteeing a bounded delay tome. The scheme controls transmission times of the packets by estimating next delay time with the delay distribution. So, the arriving packets may be maintained within a limited delay boundary, and playout will be performed after buffering to smoothen small delay variations. The continually increasing delay due to network overload causes buffer underflow at the receiver. To solve it, the transmitter is required to speed up instantaneously. Too much increase of transmission-rate may cause network congestion. At that time, the transmitter drops the current packet when informed excessive delay from the receiver.

• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.367-376
• /
• 2003

This study deals with the DCMST (Delay constrained Capacitated Minimum Spanning Tree) problem applied in the topological design of local networks or finding several communication paths from root node. While the traditional CMST problem has only the traffic capacity constraint served by a port of root node, the DCMST problem has the additional mean delay constraint of network. The DCMST problem consists of finding a set of spanning trees to link end-nodes to the root node satisfying the traffic requirements at end-nodes and the required mean delay of network. The objective function of problem is to minimize the total link cost. This paper presents two-phased heuristic algorithm, which consists of node exchange, and node shift algorithm based on the trade-off criterions, and mean delay algorithm. Actual computational experience and performance analysis show that the proposed algorithm can produce better solution than the existing algorithm for the CMST problem to consider the mean delay constraint in terms of cost.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.4
• /
• pp.94-99
• /
• 2001

Recently a lot of informations is interchanged among many users through the network such as Internet. In this situation. multimedia data transfer has some problems. that are jitter, the difference of delay in arriving packets, and loss of data due to the various delay between sender and receiver. The arriving data packets are not synchronized because of those problems. Especially, an efficient method is needed to revise the sudden large changes of the delay, called spike-like delay. which is occured in explosive growth of networking. We propose efficient synchronization algorithm which controls synchronization interval and adjusts to sudden changes in networks. The algorithm, a receiver-driven adaptive synchronization method, is to synchronize the arriving data packets against spike-like delay and decrease the loss of them. In addition, another method is proposed in this paper. The method uses the probabilistic features of delay distribution appearing in general network. It is evaluated for the loss of data packets and the delay times.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.5
• /
• pp.916-924
• /
• 2003

Fair queueing has been an important issue in the multimedia networks where resources are shared among nodes both wired and wireless. In most fair queuing algorithms, based on the generalized processor sharing(GPS), emphasizes fairness guarantee while overlooking bounded delay guarantee which is critical to support multimedia services in the networks. In this paper, we propose a new fair queueing scheme, delay guaranteed fair queueing (DGFQ), which guaranteeing bounded delay of flows according to their individual delay requirements for multimedia services in the wireless packet networks.

• Journal of Mechanical Science and Technology
• /
• v.20 no.8
• /
• pp.1195-1208
• /
• 2006

This paper aims at presenting robustness analysis under the uncertainties of the time delay and plant parameters in symmetrically coupled dynamic systems connected through network having time delay. The delay-involved closed loop characteristic function is mathematically formulated, incorporated with active synchronization control. And the robust stability of the corresponding system is analyzed by investigating the formation of characteristic equation containing second- order terms of uncertainty variables representing delay and plant dynamics mismatches. For the two individual types of uncertainties, we elucidate details of how to compute the bounds and what they imply physically. To support the validity of the mathematical claims, numerical examples and simulations are presented.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.45-51
• /
• 2009

In this paper, a transparency analysis and network-adaptive transport scheme are proposed in order to improve transparency of EBA-based force-reflecting teleoperation. EBA guarantees stability of force-reflecting teleoperation over network delay and loss but has limitation that it cannot overcome transparency deterioration of haptic interactions. The proposed transparency analysis quantifies the force feedback distortion caused by network delay and loss. Based on the analysis, the proposed haptic data synchronization and transmission rate control schemes adapt synchronization delay and transmission rate to current network state for more transparent haptic interaction. Through Matlab/Simulink simulations, it is confirmed that the proposed analysis provides an acceptable quantification method about haptic interaction quality and that the proposed haptic data transport scheme effectively improves haptic interaction quality with respect to network delays and losses.