• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.28 no.4
• /
• pp.14-19
• /
• 2005

In general, cell transmission delay is more sensitive for real time video service rather than cell losses in a wireless ATM network. Existing handoff schemes, which are emphasizing the prevention of cell losses, have limitations in cell transmission delay to satisfy QoS. In this paper, we propose a scheme to minimize transmission delay generated during the handoff and to maintain the sequence of cells. Transmission delay can be reduced by transmitting ATM cells with low CLP(i.e., CLP=0) prior to others and by discarding cells with high CLP(i.e., CLP= 1). The simulation results show that the proposed scheme is suitable for delay sensitive real time VBR service as well as fast handoff by giving high CLP to less meaningful MPEG frames.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.243-246
• /
• 1998

A predictive controller is designed based upon stochastic methods for compensation of network time delay which caused by the spatial separation between controllers and actuators. Current commands are generated by using time varying probability functions which can be defined according to the values of previous control inputs and actual outputs. To demonstrate the effect of this control methodology, simulation experiments are performed. The results show that even an unstabilized system by a long time delay can be stabilized with this predictive controller.

• Journal of Information Processing Systems
• /
• v.19 no.6
• /
• pp.817-829
• /
• 2023

Variable wireless channel is a big challenge for real-time video applications, and the rate adaptation of realtime video streaming becomes a hot topic. Intra-video coding is important for high-quality video communication and industrial video applications. In this paper, we proposed a novel adaptive scheme for real-time video transmission with intra-only coding over a wireless network. The key idea of this scheme is to estimate the instantaneous remaining capacity of the network to adjust the quality of the next several video frames, which not only can keep low queuing delay and ensure video quality, but also can respond to bandwidth changes quickly. We compare our scheme with three different schemes in the video transmission system. The experimental results show that our scheme has higher bandwidth utilization and faster bandwidth change response, while maintaining low queuing delay.

• Journal of the Korea Society for Simulation
• /
• v.12 no.3
• /
• pp.55-68
• /
• 2003

As mobile IP has been suggested only to support mobility of mobile station(MS) by which it dose nothing but guarantee MS's new connection to the network, it is for nothing in Quality of Service(QoS) after handoff of MS. QoS is very important factor in mobile IP network to provide multimedia applications and real-time services in mobile environment, and it is closely related to handoff delay Therefore as a main issue in mobile IP research area, handoff delay problem is actively studied to guarantee and promote QoS. In this paper, in order to resolve such a problem, we suggest Simple Network Management Network(SNMP) information-based routing that adds keyword management method to information-based routing in active network, and then propose QoS controlled handoff by SNMP information-based routing. After setting up routing convergence time, modeling of suggested method and existing handoff method is followed in order to evaluate the simulations that are carried out with NS-2. The result of simulation show the improvement of handoff delay, and consequently it turns off the QoS has been improved considerably.

• Journal of Internet Computing and Services
• /
• v.18 no.6
• /
• pp.65-73
• /
• 2017

Congestion occurring at wireless sensor networks(WSNs) causes packet delay and packet drop, which directly affects overall QoS(Quality of Service) parameters of network. Network congestion is critical when important data is to be transmitted through network. Thus, it is significantly important to effectively control the congestion. In this paper, new mechanism to guarantee reliable transmission for the important data is proposed by considering the importance of packet, configuring packet priority and utilizing the settings in routing process. Using this mechanism, network condition can be maintained without congestion in a way of making packet routed through various routes. Additionally, congestion control using packet service time, packet inter-arrival time and buffer utilization enables to reduce packet delay and prevent packet drop. Performance for the proposed mechanism was evaluated by simulation. The simulation results indicate that the proposed mechanism results to reduction of packet delay and produces positive influence in terms of packet loss rate and network lifetime. It implies that the proposed mechanism contributes to maintaining the network condition to be efficient.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.7
• /
• pp.3470-3493
• /
• 2019

IEEE 802.11s-based infrastructure Wireless Mesh Networks (iWMNs) are envisaged as a promising solution to provide ubiquitous wireless Internet access. The limited network capacity is a problem mainly caused by the medium contention between mesh users and the mesh access points (MAPs), which gets worst when the mesh clients employ the Transmission Control Protocol (TCP). To mitigate this problem, we use wireless network coding (WNC) in the MAPs. The aim of this proposal is to take advantage of the network topology around the MAPs, to alleviate the contention and maximize the use of the network capacity. We evaluate WNC when is used in MAPs. We model the formation of coding opportunities and, using computer simulations, we evaluate the formation of such coding opportunities. The results show that as the users density grows, the coding opportunities increase up to 70%; however, at the same time, the coding delay increments significantly. In order to reduce such delay, we propose to adaptively adjust the time that a packet can wait to catch a coding opportunity in an MAP. We assess the performance of moving-average estimation methods to forecast this adaptive sojourn time. We show that using moving-average estimation methods can significantly decrease the coding delay since they consider the traffic density conditions.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.06c
• /
• pp.351.1-355
• /
• 1998

Network-based real-time multimedia applications require guaranteed performances of communication service. Also according to increased bandwidth and processing performance in the future high speed networks, it is possible to make multimedia real-time applications such as distributed real-time applications including video conference, medical imaging, and video education. These applications have characteristics of stringent performance requirements in terms of delay, delay jitter and maximum loss rate. This paper proposes a new delay control for Broadband networks with FCFS queueing. The delay control provides an alternative solution to a current problem in real-time communication; traffic distortion, which makes it difficult to meet such real-time requirements. In simulations, it shows that the proposed delay control can guarantee local and end-to-end delay.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.72-75
• /
• 2004

In this paper, the task assignment strategy considering communication delay and the priority of distributed tasks is proposed for the real-time network system in order to maximize the utilization of the system. For the task assignment strategy, the relationship among priority of tasks in network nodes, the calculation time of each task, and the end-to-end response time including the network delay is formulated firstly. Then, the task assignment strategy using the genetic algorithm is proposed to optimize the utilization of the system considering the LCM(Least Common Multiple) period. The effectiveness of proposed strategy is proven by the simulation for estimating the performance such as the utilization and the response time of the system in case of changing the number of tasks and the number of network nodes.

• ETRI Journal
• /
• v.30 no.2
• /
• pp.282-289
• /
• 2008

We propose a new mini-slot transmission scheme for a passive optical network (PON) in which each customer can be switched either to access mode or to internetworking mode dynamically. In this paper, we present the system implementation (called LAN-PON) as well as the performance of the proposed transmission scheme to illustrate its feasibility and benefits. A mini-slot scheme can rapidly reduce the queuing delay, which increases due to the flooding of the deflected packets in a deflection scheme. We evaluate the impact of mode switching time on the bandwidth gain (throughput) and delay of local area network (LAN) traffic in the LAN-PON with a mini-slot scheme. We also analyze a theoretical delay model of the proposed scheme. The simulation results demonstrate that switching time has an impact on LAN performance, and the average packet delay of the proposed scheme is significantly improved compared to that of the deflection scheme.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1609-1615
• /
• 2006

Overlay multicast technique is an effective way as an alternative to IP multicast. Traditional IP multicast is not widely deployed because of the complexity of IP multicast technology and lack of application. But overlay multicast can be easily deployed by effectively reducing complexity of network routers. Because overlay multicast resides on top of densely connected IP network, In case of multimedia streaming service over overlay multicast tree, real-time data is sensitive to end-to-end delay. Therefore, moderate algorithm's development to this network environment is very important. In this paper, we are interested in minimizing maximum end-to-end delay in overlay multicast tree. The problem is formulated as a degree-bounded minimum delay spanning tree, which is a problem well-known as NP-hard. We develop tabu search heuristic with intensification and diversification strategies. Robust experimental results show that is comparable to the optimal solution and applicable in real time