• Title/Summary/Keyword: network queue management

Search Result 119, Processing Time 0.026 seconds

Load Balancing and Interference Delay Aware Routing in IoT Aware Wireless Mesh Networks

  • Jilong Li;Murad Khan;Byeongjik Lee;Kijun Han
    • Journal of Internet Technology
    • /
    • v.20 no.1
    • /
    • pp.293-300
    • /
    • 2019
  • The Internet of Things (IoT) enables embedded devices to connect to the internet either through IP or the web in a physical environment. The increase in performance of wireless access services, adaptive load balancing, and interference routing metric becomes the key challenges in Wireless Mesh Networks (WMN). However, in the case of IoT over WMN, a large number of users generate abundant net flows, which can result in network traffic jam. Therefore, in this paper, we propose a Load Balancing and Interference Delay Aware routing metric algorithm to efficiently address the issues present in the current work. The proposed scheme efficiently utilizes the available mesh station queue information and the number of mesh stations suffering from channel interference in the available path. The simulations results show that the proposed scheme performed superior to the existing routing metrics present in the current literature for similar purposes.

NetDraino: Saving Network Resources via Selective Packet Drops

  • Lee, Jin-Kuk;Shin, Kang-G.
    • Journal of Computing Science and Engineering
    • /
    • v.1 no.1
    • /
    • pp.31-55
    • /
    • 2007
  • Contemporary end-servers and network-routers rely on traffic shaping to deal with server overload and network congestion. Although such traffic shaping provides a means to mitigate the effects of server overload and network congestion, the lack of cooperation between end-servers and network-routers results in waste of network resources. To remedy this problem, we design, implement, and evaluate NetDraino, a novel mechanism that extends the existing queue-management schemes at routers to exploit the link congestion information at downstream end-servers. Specifically, NetDraino distributes the servers' traffic-shaping rules to the congested routers. The routers can then selectively discard those packets-as early as possible-that overloaded downstream servers will eventually drop, thus saving network resources for forwarding in-transit packets destined for non-overloaded servers. The functionality necessary for servers to distribute these filtering rules to routers is implemented within the Linux iptables and iproute2 architectures. Both of our simulation and experimentation results show that NetDraino significantly improves the overall network throughput with minimal overhead.

Optimal management of multi-airport opening non-real time network system

  • Wang, Zhanwei;Heo, Hui-Yeong
    • 한국항공운항학회:학술대회논문집
    • /
    • 2016.05a
    • /
    • pp.269-275
    • /
    • 2016
  • This paper considers the arrival, airport and departure capacity as a whole, through which, the network effect between airports is fully emphasized, the flight action is coordinated, and the flight demand pattern is reasonably assigned. The optimization problem of flight queues in multi-airport is studied in detail; the mathematical model of multi-airport opening non-real time flow management in terminal area is established, and related problems such as the parameters, the simplification and the solving of the model are discussed in detail to some extent. Appropriate decision making variables are taken to make the multi-airport network system linear 0-1 integer programming model, thus, the solving of the model is available and the central flow management is realized. The heuristic implicit enumeration presented in this paper can effectively solve this kind of problems. Through the simulation of some airports network system, we not only validate the algorithm presented in this paper, but also give a deep analysis of the results, which would produce reference for later practicable use. The simulation proves that this algorithm offers a good way to settle the problem of multi-airport flight queue optimization in air traffic management automation system in terminal area.

  • PDF

Initial Investigation on Consolidation with Adaptive Dynamic Threshold for ABR Multicast Connections in ATM Networks (비동기 전송모드 망의 점대다중점연결을 위한 적응동적임계치기반 병합알고리즘)

  • Shin, Soung-Wook;Cho, Kwang-Hyun
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.7 no.11
    • /
    • pp.962-966
    • /
    • 2001
  • The major problem at a branch point for point-to-multipoint available bit rate(ABR) services in asynchronous transfer mode (ATM) networks is how to consolidate backward resource management(BRM) cells from each branch for a multicast connection. In this paper, we propose an efficient feedback consolidation algorithm based on an adaptive dynamic threshold(ADT) to eliminate the consolidation noise and the reduce the consolidation delay. The main idea of the ADT algorithm lies in that each branch point estimates the ABR traffic condition of the network through the virtual queue estimation and the transmission threshold of the queue level in branch points is adaptively controlled according to the estimation. Simulation results show that the proposed ADT algorithm can achieve a faster response in congestion status and a higher link utilization compared with the previous works.

  • PDF

Performance Analysis of a Finite-Buffer Discrete-Time Queueing System with Fixed-Sized Bulk-service

  • Chang, Seok-Ho;Kim, Tae-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.9B
    • /
    • pp.783-792
    • /
    • 2003
  • We consider a finite-buffer discrete-time queueing system with fixed-size bulk-service discipline: Geo/ $G^{B}$1/K+B. The main purpose of this paper is to present a performance analysis of this system that has a wide range of applications in Asynchronous Transfer Mode (ATM) and other related telecommunication systems. For this purpose, we first derive the departure-epoch probabilities based on the embedded Markov chain method. Next, based on simple rate in and rate out argument, we present stable relationships for the steady-state probabilities of the queue length at different epochs: departure, random, and arrival. Finally, based on these relationships, we present various useful performance measures of interest such as the moments of number of packets in the system at three different epochs and the loss probability. The numerical results are presented for a deterministic service-time distribution - a case that has gained importance in recent years.s.

Design and Implementation of an Intelligent Agent for RFID-based Home Network Management (RFID 기반의 홈 네트워크 관리를 위한 지능형 에이전트의 설계 및 구현)

  • Kim, Ju-Il;Lee, Woo-Jin;Chong, Ki-Won
    • The Journal of Society for e-Business Studies
    • /
    • v.12 no.4
    • /
    • pp.71-84
    • /
    • 2007
  • The architecture for RFID-based home network and an intelligent agent for efficiently managing home network are proposed in this paper. The agent consists of six modules-Agent Manager, Data Collector, Execution Controller, Data Storage, Data Queue and User Interface. Agent Manager manages the tasks of modules, and Data Collector collects the data from home appliances through the RFID readersm Execution Controller determines the operations home appliances according to the conditions of the home environment and transfers the operations to the appliances through the RFID readers. Moreover, Data Storage keeps the data which is necessary for the operations of the agent, and Data Queue temporarily stores the data which is collected from home appliances. Lastly, User Interface provides the graphical user interface in which an individual can directly control and monitor the home network. The proposed intelligent agent autonomously learns the circumstances of a home network by analyzing the data about the state of home appliances, and controls home appliances according to the preference of the user. Therefore, the user can live in the best-suited home environment without direct appliance control if he/she performs home networking through the agent.

  • PDF

A Study on the Voice Traffic Efficiency and Buffer Management by Priority Control in ATM Multiplexer (ATM 멀티플렉서에서 우선순위 제어에 의한 음성전송효율 및 버퍼관리에 관한 연구)

  • 이동수;최창수;강준길
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.2
    • /
    • pp.354-363
    • /
    • 1994
  • This paper describes the method that voice traffic is served efficiently in BISDN. Voice is divided into talkspurt and silent period, and it is possible to transmit olny talksurt by the speech activity detection. This paper described the voice traffic control algorithm in the ATM network where cell discarding method is applied to the embedded ADPCM voice data. For traffic control, the cell discarding was used over low priority cells when it overflows the queue threshold. To estimate the efficiency of traffic control algorithm, the computer simuation was performed with cell loss probability, queue length and mean delay as performance parameters. The embedded ADPCM voice coding and cell disscarding resulted in improving the voice cell traffic efficiency and the dynamic control over network congestion.

  • PDF

Multipath TCP performance improvement using AQM in heterogeneous networks with bufferbloat (버퍼블로트를 가지는 이종 망에서 AQM을 이용한 Multipath TCP 성능 개선)

  • Hyeon, Dong Min;Jang, Jeong Hun;Kim, Min Sub;Han, Ki Moon;Lee, Jae Yong;Kim, Byung Chul
    • Journal of Satellite, Information and Communications
    • /
    • v.12 no.4
    • /
    • pp.131-140
    • /
    • 2017
  • Multipath TCP (MPTCP) is a transport layer protocol that simultaneously transmits data using multiple interfaces. MPTCP is superior to existing TCP in network environment with homogeneous subflows, but it shows worse performance compared to existing TCP in network environment with bufferbloat. If a bufferbloat occurs in one of the MPTCP multipaths, the packet will not arrive at the MPTCP receive buffer due to a sudden increase in delay time, resulting in a HoL blocking phenomenon. It makes the receive window of the other path to be zero. In this paper, we apply Adaptive Random Early Detection (ARED), Controlled Delay (CoDel) and Proportional Integral Controller Enhanced (PIE) among the proposed Active Queue Management (AQM) to limit the delay of bufferbloat path. Experiments were conducted to improve the performance of MPTCP in heterogeneous networks. In order to carry out the experiment, we constructed a Linux-based testbed and compared the MPTCP performance with that of the existing droptail.

Stochastic Traffic Congestion Evaluation of Korean Highway Traffic Information System with Structural Changes

  • Lee, Yongwoong;Jeon, Saebom;Park, Yousung
    • Asia pacific journal of information systems
    • /
    • v.26 no.3
    • /
    • pp.427-448
    • /
    • 2016
  • The stochastic phenomena of traffic network condition, such as traffic speed and density, are affected not only by exogenous traffic control but also by endogenous changes in service time during congestion. In this paper, we propose a mixed M/G/1 queuing model by introducing a condition-varying parameter of traffic congestion to reflect structural changes in the traffic network. We also develop congestion indices to evaluate network efficiency in terms of traffic flow and economic cost in traffic operating system using structure-changing queuing model, and perform scenario analysis according to various traffic network improvement policies. Empirical analysis using Korean highway traffic operating system shows that our suggested model better captures structural changes in the traffic queue. The scenario analysis also shows that occasional reversible lane operation during peak times can be more efficient and feasible than regular lane extension in Korea.

Enhanced ERICA Switch Algorithm using Buffer Management Scheme (버퍼 관리 기법을 이용한 개선된 ERICA 스위치 알고리즘)

  • 양기원;오창석
    • The Journal of the Korea Contents Association
    • /
    • v.2 no.2
    • /
    • pp.73-84
    • /
    • 2002
  • In this paper, we propose a enhanced ERICA switch algorithm using the buffer management scheme which can reduce the queue length, support the efficiency link utilization and the fair share. It has three different buffer thresholds which are low threshold, congestion notification threshold and high threshold. According to the each buffer threshold status, switch announced congestion notification to the source differently. So, sources could know the congestion more quickly and fast remover from network congestion. As a experimental results, it is proved that proposed algorithm is the more efficient than ERICA. Especially, proposed switch algorithm provides congestion control mechanism to make the best use of with keeping fairness and reduce queue length.

  • PDF