• 한국인터넷방송통신학회논문지
• /
• 제18권1호
• /
• pp.15-21
• /
• 2018

데이터센터 네트워크의 자원을 효율적으로 활용하여 플로우들의 지연시간을 줄이기 위해서는 플로우 단위의 스케줄링보다는 패킷단위의 스케줄링이 적합하다. 따라서 최근에는 데이터센터 네트워크의 다중경로를 활용하여 패킷단위로 스케줄링을 수행하는 방식이 많이 제안되었다. 그러나 이로 인해 발생하는 순서 바뀐 패킷들이 표준 TCP 성능에 미치는 부정적인 영향을 줄이기 위해, 대부분의 방식들은 TCP 아래 계층에서 순서를 다시 맞추는 등의 보완방안을 필요로 한다. 본 논문에서는 데이터센터 네트워크의 대표적인 전송계층 프로토콜인 DCTCP가 다중경로상의 패킷단위 분산과 함께 사용될 때 어떤 성능을 보이는지 모의실험을 통해 조사한다. 모의실험 결과는 DCTCP가 큐의 길이를 짧게 유지할 수 있지만 혼잡신호에 따라 혼잡윈도우를 줄이는 방식 때문에 오히려 공평성 등의 측면에서는 기존 TCP보다도 낮은 성능을 가짐을 보여준다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• 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.

• Journal of Communications and Networks
• /
• 제16권1호
• /
• pp.36-44
• /
• 2014

Exploiting the energy-delay tradeoff for energy saving is critical for developing green wireless communication systems. In this paper, we investigate the delay-constrained energy-efficient packet transmission. We aim to minimize the energy consumption of multiple randomly arrived packets in an additive white Gaussian noise channel subject to individual packet delay constraints, by taking into account the practical on-off circuit power consumption at the transmitter. First, we consider the offline case, by assuming that the full packet arrival information is known a priori at the transmitter, and formulate the energy minimization problem as a non-convex optimization problem. By exploiting the specific problem structure, we propose an efficient scheduling algorithm to obtain the globally optimal solution. It is shown that the optimal solution consists of two types of scheduling intervals, namely "selected-off" and "always-on" intervals, which correspond to bits-per-joule energy efficiency maximization and "lazy scheduling" rate allocation, respectively. Next, we consider the practical online case where only causal packet arrival information is available. Inspired by the optimal offline solution, we propose a new online scheme. It is shown by simulations that the proposed online scheme has a comparable performance with the optimal offline one and outperforms the design without considering on-off circuit power as well as the other heuristically designed online schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권12호
• /
• pp.4856-4871
• /
• 2015

Backpressure based scheduling has been considered as a promising technique for improving the throughput of a wide range of communication networks. However, this scheduling technique has not been well studied for heterogeneous wireless networks. In this paper, we propose a virtual-queue based backpressure scheduling (VQB) algorithm for heterogeneous multi-hop wireless networks. The VQB algorithm introduces a simple virtual queue for each flow at a node for backpressure scheduling, whose length depends on the cache size of the node. When calculating flow weights and making scheduling decisions, the length of a virtual queue is used instead of the length of a real queue. We theoretically prove that VQB is throughput-optimal. Simulation results show that the VQB algorithm significantly outperforms a classical backpressure scheduling algorithm in heterogeneous multi-hop wireless networks in terms of the packet delivery ratio, packet delivery time, and average sum of the queue lengths of all nodes per timeslot.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 하계종합학술대회 논문집(1)
• /
• pp.45-48
• /
• 2002

This paper presents a QoS-guaranteed traffic control system which supports QoS of realtime packet transmission for the multimedia communication. The traffic control system presented in this paper applies the integrated service model and provides QoS o(packet transmission by means of determining the packet transmission rate with the policy of network manager and the optimal resource allocation according to the end-to-end traffic load. It also provides QoS for the realtime packet transmission through the AWF2Q+ Scheduling algorithm and per-class queuing method.

• 한국통신학회논문지
• /
• 제31권4A호
• /
• pp.412-420
• /
• 2006

다양한 형태의 트래픽이 등장하면서 각 트래픽이 요구하는 서비스 품질을 모두 만족시키기 위한 패킷 스케줄링 연구에 대한 중요성이 커지고 있다. IEEE 802.11 위원회에서는 이러한 요구에 부응하기 위해 IEEE 802.11e 규격을 제정하여 모든 트래픽을 4가지로 분류한 뒤 각 트래픽 별로 차등화된 서비스를 제공하고 있다. 그리고 IEEE 802.11a/g규격에서는 물리계층에서의 전송속도를 무선 단말기 당 최대 54 Mbps까지 지원하고 있다. 하지만 무선 채널환경에서는 전체 대역폭이 제한되어 있기 때문에 주어진 대역폭 내에서 전송효율을 최대화시키는 문제는 항상 풀어야 하는 과제이다. 따라서 본 연구에서는 전송오류가 발생하는 무선통신 환경 하에서 동작하는 무선 LAN 단말기가 패킷 전송을 위해 CSMA-CA 기반으로 동작함에 있어서 CW(Contention Window) 값을 현재 무선채널 상태에 따라 달리 설정함으로써 서비스 처리량(Throughput)을 더욱 극대화할 수 있는 패킷 스케줄링 기법을 제안하였다. 제안된 알고리즘을 NS-2 네트워크 시뮬레이터를 이용하여 성능평가를 수행하였고, 수치 결과를 통해 제안한 알고리즘이 기존 IEEE 802.11e의 성능을 더욱 향상시킬 수 있음을 보였다.

• 한국통신학회논문지
• /
• 제30권7A호
• /
• pp.611-619
• /
• 2005

본 논문은 IEEE 802.16e 기반의 TDD-OFDMA 하향 링크에서의 수율 공평성 및 서비스 커버리지 보장을 위한, WFS(weighted Fair scheduling) 알고리즘과 TGS(Throughput Guarantee Scheduling) 알고리즘을 제안하고, RR(Round Robin), PF(Proportional Fair), FFTH(Fast Fair Throughput), FTH(Fair Throughput) 스케줄링 알고리즘과의 비교를 통한 성능 분석을 수행하였다. 제안된 알고리즘의 성능은 64 kbps와 128 kbps 의 두 개의 최소 사용자 수율 요구 조건에서의 서비스 커버리지, 유효 섹터 수율, 공평성 평가를 통하여 분석되었다. 상대적으로 낮은 64 kbps 요구 조건에서, 제안된 알고리즘은 lxEV-DV 공평성 기준을 만족시키면서, 기존의 스케줄링 방식들보다 서비스 커버리지 내의 가용 사용자 수를 증가시켰다. 또한 128 kbps 요구 조건에서는 PF 스케줄링 방식에 비하여 유효 섹터 수율의 손실이 거의 없이, 서비스 커버리지를 증가시킬 수 있음을 보였다.

• 한국항해항만학회지
• /
• 제28권4호
• /
• pp.299-303
• /
• 2004

In the Internet, to guarantee transmission rate and delay and to achieve fair bandwidth allocation, many per-flow scheduling algorithms, such as fair queueing, which have many desirable properties for congestion control, have been proposed and designed. However, algorithms based on per-flow need maintain rate state, buffer management and packet scheduling, so that it cost great deal ： implement. Therefore, in this paper, to implement routers cost-effectively, we propose CS-FNE algorithm based on FNE in Core-Stateless network We evaluate CS-FNE comparing with four additional algorithms i.e., CSFQ, FRED, RED and DRR, in several different, configurations and traffic sources. Through simulation results, we show that CS-FNE algorithm can allocate fair bandwidth approximately and is simpler and easier to implement than other per-flow basis queueing mechanisms.

• 한국멀티미디어학회논문지
• /
• 제10권12호
• /
• pp.1622-1631
• /
• 2007

To realize the wireless packet scheduler which efficiently considers both the effect of adaptive modulation and coding (AMC) scheme due to variable wireless communication channel information from physical layer and the QoS differentiation of multimedia services from internet protocol (IP) layer, this paper proposes a new downlink AMC-based priority queuing (APQ) scheduler which combines AMC scheme and service priority method in multimedia services at the same time. The result of numerical analysis shows that the proposed APQ algorithm plays a role in increasing the number of services satisfying the mean waiting time requirements per each service in multimedia services because the APQ scheme allows the mean waiting time of each service to be reduced much more than existing packet scheduler having only user selection processor.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권9호
• /
• pp.1492-1512
• /
• 2011

Due to multiple hops, mobility and time-varying channel, supporting delay sensitive real-time traffic in wireless local area network-based (WLAN) mesh networks is a challenging task. In particular for real-time traffic subject to medium access control (MAC) layer control overhead, such as preamble, carrier sense waiting time and the random backoff period, the performance of real-time flows will be degraded greatly. In order to support real-time traffic, an efficient adaptive packet scheduling (APS) scheme is proposed, which aims to improve the system performance by guaranteeing inter-class, intra-class service differentiation and adaptively adjusting the packet length. APS classifies incoming packets by the IEEE 802.11e access class and then queued into a suitable buffer queue. APS employs strict priority service discipline for resource allocation among different service classes to achieve inter-class fairness. By estimating the received signal to interference plus noise ratio (SINR) per bit and current link condition, APS is able to calculate the optimized packet length with bi-dimensional markov MAC model to improve system performance. To achieve the fairness of intra-class, APS also takes maximum tolerable packet delay, transmission requests, and average allocation transmission into consideration to allocate transmission opportunity to the corresponding traffic. Detailed simulation results and comparison with IEEE 802.11e enhanced distributed channel access (EDCA) scheme show that the proposed APS scheme is able to effectively provide inter-class and intra-class differentiate services and improve QoS for real-time traffic in terms of throughput, end-to-end delay, packet loss rate and fairness.