• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.2 s.332
• /
• pp.23-38
• /
• 2005

The state of channel between two or more wireless terminals is changed frequently due to noise or multiple environmental conditions in wireless network. In this paper, we analyze packet transmission time and queue length in a time-varying channel of packet based Wireless Networks. To reflect the feature of the time-varying channel, we model the channel as two-state Markov model and three-state Markov model Which are transformed to SFG(Signal Flow Graph) model, and then the distribution of the packet transmission can be modeled as Gaussian distribution. If the packet is arrived with Poisson distribution, then the packet transmission system is modeled as M/G/1. The average transmission time and the average queue length are analyzed in the time-varying channel, and are verified with some simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9B
• /
• pp.1272-1280
• /
• 2010

WFQ (Weighted Fair Queuing) provides not only fairness among traffic flows in using bandwidth but also guarantees the Quality of Service (QoS) that individual flow requires, which is why it has been applied to the resource reservation protocol (RSVP)-capable router. The RSVP allocates an enough resource to satisfy both the rate and end-to-end delay requirements of the flow in condition of no packet loss, and the WFQ guarantees those QoS requirements with the allocated resource. In a practice, however, most QoS-guaranteed services, specially the Voice of IP, allow a few percent of packet loss, so it is strongly desired that the RSVP and WFQ make the best use of this allowable packet loss. This paper enhances the WFQ to allow packet loss and investigates its performance. The performance evaluation showed that allowing the packet loss of 0.4% can improve the flow admission capability by around 40 percent.

• Journal of Communications and Networks
• /
• v.11 no.3
• /
• pp.297-305
• /
• 2009

Multiprotocol label switching (MPLS) networks require dynamic flow admission control to guarantee end-to-end quality of service (QoS) for each Internet protocol (IP) traffic flow. In this paper, we propose to tackle the joint routing and admission control problem for the IP traffic flows in MPLS networks without rerouting already admitted flows. We propose two mathematical programming models for this problem. The first model includes end-to-end delay constraints and the second one, end-to-end packet loss constraints. These end-to-end QoS constraints are imposed not only for the new traffic flow, but also for all already admitted flows in the network. The objective function of both models is to minimize the end-to-end delay for the new flow. Numerical results show that considering end-to-end delay (or packet loss) constraints for all flows has a small impact on the flow blocking rate. Moreover, we reduces significantly the mean end-to-end delay (or the mean packet loss rate) and the proposed approach is able to make its decision within 250 msec.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.215-217
• /
• 2004

In wireless sensor networks, fair allocation of bandwidth among different nodes is one of the critical problems that effects the serviceability of the entire system. Fair bandwidth allocation mechanisms, like fair queuing, usually need to maintain state, manage buffers, and perform packet scheduling on a per flow basis, and this complexity may prevent them from being cost-effectively implemented and widely deployed. It is a very important and difficult technical issue to provide packet scheduling architecture for fairness in wireless sensor networks. In this paper, we propose an packet scheduling architecture for sensor node, called FISN (Fairness Improvement Sensor Network), that significantly reduces this implementation complexity yet still achieves approximately fair bandwidth allocations. Sensor node for sensing estimate the incoming rate of each sensor device and insert a label into each transmission packet header based on this estimate. Sensor node for forwarding maintain no per flow state; they use FIFO packet scheduling augmented by a probabilistic dropping algorithm that uses the packet labels and an estimate of the aggregate traffic at the gathering node. We present the detailed design, implementation, and evaluation of FISN using simulation. We discuss the fairness improvement and practical engineering challenges of implementing FISN in an experimental sensor network test bed based on ns-2.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4B
• /
• pp.255-269
• /
• 2006

The differentiated services(DiffServ) architecture provides packet level service differentiation through the simple and predefined Per-Hop Behaviors(PHBs). The Assured Forwarding(AF) PHB proposed as the assured services uses the RED-in/out(RIO) approach to ensusre the expected capacity specified by the service profile. However, the AF PHB fails to give good QoS and fairness to the TCP flows. This is because OUT(out- of-profile) packet droppings at the RIO buffer are unfair and sporadic during only network congestion while the TCP's congestion control algorithm works with a different round trip time(RTT). In this paper, we propose an Adaptive Regulating Drop(ARD) marker, as a novel dropping strategy at the ingressive edge router, to improve TCP fairness in assured services without a decrease in the link utilization. To drop packets pertinently, the ARD marker adaptively changes a Temporary Permitted Rate(TPR) for aggregate TCP flows. To reduce the excessive use of greedy TCP flows by notifying droppings of their IN packets constantly to them without a decrease in the link utilization, according to the TPR, the ARD marker performs random early fair remarking and dropping of their excessive IN packets at the aggregate flow level. Thus, the throughput of a TCP flow no more depends on only the sporadic and unfair OUT packet droppings at the RIO buffer in the core router. Then, the ARD marker regulates the packet transmission rate of each TCP flow to the contract rate by increasing TCP fairness, without a decrease in the link utilization.

• Journal of information and communication convergence engineering
• /
• v.9 no.4
• /
• pp.411-419
• /
• 2011

In this paper, we propose an Adaptive Regulating Drop (ARD) marker, as a novel dropping strategy at the ingressive edge router, to improve TCP fairness in assured services (ASs) without a decrease in the link utilization. To drop packets pertinently, the ARD marker adaptively changes a Temporary Permitted Rate (TPR) for aggregate TCP flows. The TPR is set larger than the current input IN packet rate of aggregate TCP flows while inversely proportional to the measured input OUT packet rate. To reduce the excessive use of greedy TCP flows by notifying droppings of their IN packets constantly to them without a decrease in the link utilization, the ARD marker performs random early fair remarking of their excessive IN packets to OUT packets at the aggregate flow level according to the TPR. In addition, an aggregate dropper is combined to drop some excessive IN packets fairly and constantly according to the TPR. Thus, the throughput of a TCP flow no more depends on only the sporadic and unfair OUT packet droppings at the RIO buffer in the core router. Then, the ARD marker regulates the packet transmission rate of each TCP flow to the contract rate by increasing TCP fairness, without a decrease in the link utilization.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.1061-1064
• /
• 1999

UDP has likely been used for real-time applications, such as video and audio. UDP supplies minimized transmission delay by omitting the connection setup process, flow control, and retransmission In general, more than 80 percent of the WAN resources are occupied by Transmission Control Protocol(TCP) traffic as opposed to UDP's simplicity, TCP adopts a unique flow control in this paper, I report new methods to minimize a udp packet loss considering TCP flow control on the real-time application the better performance of real time application can be obtained when they reduce a packet size and FIFO buffer scheduling method competing with TCP bandwidth for the bandwidth and buffering.

• Journal of the Optical Society of Korea
• /
• v.18 no.5
• /
• pp.466-471
• /
• 2014

An asynchronous optical packet-switching (AOPS) node with load-balancing capability can achieve better performance in reducing the high packet-loss ratio (PLR) and time delay caused by unbalanced traffic. This paper proposes a novel dynamic load-balancing algorithm for an AOPS node with limited buffer and without wavelength converters, and considering the data flow distribution and service levels. By calculating the occupancy state of the output ports, load state of the input ports, and priorities for data flow, the traffic is balanced accordingly. Simulations demonstrate that asynchronous variant data packets and output traffic can be automatically balanced according to service levels and the data flow distribution. A PLR of less than 0.01% can be achieved, as well as an average time delay of less than 0.46 ns.

• The KIPS Transactions:PartC
• /
• v.18C no.6
• /
• pp.423-432
• /
• 2011

Recently, OpenFlow has been paid attention to as a fundamental technology which provides a function of virtualization and programmability in network. In Korea, deployment of OpenFlow networks in campuses and the interconnection between them through tunneling in layer 3 has been performed. However, the performance of the interconnected networks is decreased due to delay in IP layer. In this paper, we design and deploy nation-wide, not local, OpenFlow networks in a pure layer 2 environment over KREONET. After that, we do end-to-end Round-trip Time measurements and TCP/UDP performance tests in OpenFlow and normal networks, and do comparison and analysis on the test results. The results show that the nation-wide OpenFlow networks provide equal performance to normal networks except for the initial packet loss for UDP streaming. In regards to the performance decrease due to early UDP packet loss, we can mitigate it by implementing exceptional procedures in a controller which deal with the same continuous "Packet_in" events.

• Journal of Communications and Networks
• /
• v.7 no.4
• /
• pp.408-416
• /
• 2005

Quality of service (QoS) provision is an important and indispensable function for multi-service wireless networks. In this paper, we present a new scheduling/admission control frame­work, including an efficient rate-guaranteed opportunistic scheduling (ROS) scheme and a coordinated admission control (ROS­CAC) policy to support statistic QoS guarantee in multi-service wireless networks. Based on our proposed mathematical model, we derive the probability distribution function (PDF) of queue length under ROS and deduce the packet loss rate (PLR) for individual flows. The new admission control policy makes admission decision for a new incoming flow to ensure that the PLR requirements of all flows (including the new flow) are satisfied. The numerical results based on ns-2 simulations demonstrate the effectiveness of the new joint packet scheduling/admission control framework.