• Title/Summary/Keyword: multi-congestion

Search Result 151, Processing Time 0.027 seconds

Dynamic Price-Based Call, Admission Control Algorithm for Multi-Class Communication Networks (다중클래스 통신망을 위한 동적 과금 기반의 호수락 제어 알고리즘)

  • Gong, Seong-Lyong;Lee, Jang-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.8B
    • /
    • pp.681-688
    • /
    • 2008
  • In this paper, we propose a new price-based call admission control algorithm for multi-class communication networks. When a call arrives at the network, it informs the network of the number of requested circuits and the minimum amount of time that it will require. The network provides the optimal price for the arrived call with which it tries to maximize its expected revenue. The optimal price is dynamically adjusted based on the information of the arrived call, and the present and the estimated future congestion level of the network during the reservation time of the call. If the call accepts the price, it is admitted. Otherwise, it is rejected. We compare the performance of our dynamic pricing algorithm with that of the static pricing algorithm by Courcoubetis and Reiman [1], and Paschalidis and Tsitsiklis [2]. By the comparison, we show that our dynamic pricing algorithm has better performance aspects such as higher call admission ratio and lower price than the static pricing algorithm, although these two algorithms result in almost the same revenue as shown in [2]. This implies that, in the competitive situation, the dynamic pricing algorithm can attract more users than the static pricing algorithm, generating more revenue. Moreover, we show that if a certain fixed connection fee is introduced to the price for a call, our dynamic pricing algorithm yields more revenue.

Partial multipath routing Protocol for multi-hop mesh network (멀티홉 메쉬 네트워크를 위한 부분다중경로 라우팅프로토콜)

  • Lee, Kang-Gun;Park, Hyung-Kun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.05a
    • /
    • pp.598-599
    • /
    • 2015
  • For the wireless mesh networks, efficient routing protocol is required to transmit data from source to destination node through multi-hop transmission. Multipath routing enable the stable data transmission even in the case of traffic congestion or unstable link. In this paper, we propose partial multipath routing which does not make a full multipath but partial for some parts of unstable links. This partial multipath routing reduce the number of nodes for routing and minimized the required power.

  • PDF

Traffic Engineering Based on Local States in Internet Protocol-Based Radio Access Networks

  • Barlow David A.;Vassiliou Vasos;Krasser Sven;Owen Henry L.;Grimminger Jochen;Huth Hans-Peter;Sokol Joachim
    • Journal of Communications and Networks
    • /
    • v.7 no.3
    • /
    • pp.377-384
    • /
    • 2005
  • The purpose of this research is to develop and evaluate a traffic engineering architecture that uses local state information. This architecture is applied to an Internet protocol radio access network (RAN) that uses multi-protocol label switching (MPLS) and differentiated services to support mobile hosts. We assume mobility support is provided by a protocol such as the hierarchical mobile Internet protocol. The traffic engineering architecture is router based-meaning that routers on the edges of the network make the decisions onto which paths to place admitted traffic. We propose an algorithm that supports the architecture and uses local network state in order to function. The goal of the architecture is to provide an inexpensive and fast method to reduce network congestion while increasing the quality of service (QoS) level when compared to traditional routing and traffic engineering techniques. We use a number of different mobility scenarios and a mix of different types of traffic to evaluate our architecture and algorithm. We use the network simulator ns-2 as the core of our simulation environment. Around this core we built a system of pre-simulation, during simulation, and post-processing software that enabled us to simulate our traffic engineering architecture with only very minimal changes to the core ns-2 software. Our simulation environment supports a number of different mobility scenarios and a mix of different types of traffic to evaluate our architecture and algorithm.

Utility Bounds of Joint Congestion and Medium Access Control for CSMA based Wireless Networks

  • Wang, Tao;Yao, Zheng;Zhang, Baoxian;Li, Cheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.1
    • /
    • pp.193-214
    • /
    • 2017
  • In this paper, we study the problem of network utility maximization in a CSMA based multi-hop wireless network. Existing work in this aspect typically adopted continuous time Markov model for performance modelling, which fails to consider the channel conflict impact in actual CSMA networks. To maximize the utility of a CSMA based wireless network with channel conflict, in this paper, we first model its weighted network capacity (i.e., network capacity weighted by link queue length) and then propose a distributed link scheduling algorithm, called CSMA based Maximal-Weight Scheduling (C-MWS), to maximize the weighted network capacity. We derive the upper and lower bounds of network utility based on C-MWS. The derived bounds can help us to tune the C-MWS parameters for C-MWS to work in a distributed wireless network. Simulation results show that the joint optimization based on C-MWS can achieve near-optimal network utility when appropriate algorithm parameters are chosen and also show that the derived utility upper bound is very tight.

A Decentralized Optimal Load Current Sharing Method for Power Line Loss Minimization in MT-HVDC Systems

  • Liu, Yiqi;Song, Wenlong;Li, Ningning;Bai, Linquan;Ji, Yanchao
    • Journal of Power Electronics
    • /
    • v.16 no.6
    • /
    • pp.2315-2326
    • /
    • 2016
  • This paper discusses the elimination of DC voltage deviation and the enhancement of load current sharing accuracy in multi-terminal high voltage direct current (MT-HVDC) systems. In order to minimize the power line losses in different parallel network topologies and to insure the stable operation of systems, a decentralized control method based on a modified droop control is presented in this paper. Averaging the DC output voltage and averaging the output current of two neighboring converters are employed to reduce the congestion of the communication network in a control system, and the decentralized control method is implemented. By minimizing the power loss of the cable, the optimal load current sharing proportion is derived in order to achieve rational current sharing among different converters. The validity of the proposed method using a low bandwidth communication (LBC) network for different topologies is verified. The influence of the parameters of the power cable on the control system stability is analyzed in detail. Finally, transient response simulations and experiments are performed to demonstrate the feasibility of the proposed control strategy for a MT-HVDC system.

A Virtual Topology Management Policy in Multi-Stage Reconfigurable Optical Networks (다단계 재구성 가능한 광 네트워크상에서 가상 토폴로지 관리 정책)

  • Ji-Eun Keum;Lin Zhang;Chan-Hyun Youn
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.1
    • /
    • pp.1-8
    • /
    • 2003
  • In this paper. we develop an analytical model to evaluate the virtual topology reconfiguration phase of optical Internet networks. To counter the continual approximation problem brought by traditional heuristic approach, we take the traffic prediction into consideration and propose a new heuristic reconfiguration algorithm called Prediction based Multi-stage Reconfiguration approach. We then use this analytical model to study the different configuration operation policies in response to the changing traffic patterns in the higher layer and the congestion level on the virtual topology. This algorithm persists to decide the optimal instant of reconfiguration easily based on the network state. Simulation results show that our virtual topology management Policy significantly outperforms the conventional one, while the required physical resources are limited.

Designing a Vehicles for Open-Pit Mining with Optimized Scheduling Based on 5G and IoT

  • Alaboudi, Abdulellah A.
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.3
    • /
    • pp.145-152
    • /
    • 2021
  • In the Recent times, various technological enhancements in the field of artificial intelligence and big data has been noticed. This advancement coupled with the evolution of the 5G communication and Internet of Things technologies, has helped in the development in the domain of smart mine construction. The development of unmanned vehicles with enhanced and smart scheduling system for open-pit mine transportation is one such much needed application. Traditional open-pit mining systems, which often cause vehicle delays and congestion, are controlled by human authority. The number of sensors has been used to operate unmanned cars in an open-pit mine. The sensors haves been used to prove the real-time data in large quantity. Using this data, we analyses and create an improved transportation scheduling mechanism so as to optimize the paths for the vehicles. Considering the huge amount the data received and aggregated through various sensors or sources like, the GPS data of the unmanned vehicle, the equipment information, an intelligent, and multi-target, open-pit mine unmanned vehicle schedules model was developed. It is also matched with real open-pit mine product to reduce transport costs, overall unmanned vehicle wait times and fluctuation in ore quality. To resolve the issue of scheduling the transportation, we prefer to use algorithms based on artificial intelligence. To improve the convergence, distribution, and diversity of the classic, rapidly non-dominated genetic trial algorithm, to solve limited high-dimensional multi-objective problems, we propose a decomposition-based restricted genetic algorithm for dominance (DBCDP-NSGA-II).

Backhaul transmission scheme for UAV based on improved Nash equilibrium strategy

  • Liu, Lishan;Wu, Duanpo;Jin, Xinyu;Cen, Shuwei;Dong, Fang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.8
    • /
    • pp.2666-2687
    • /
    • 2022
  • As a new alternative communication scheme in 5G, unmanned aerial vehicle (UAV) is used as a relay in the remote base station (BS) for assistant communication. In order to ameliorate the quality of the backhaul link, a UAV backhaul transmission scheme based on improved Nash equilibrium (NE) strategy is proposed. First, the capacity of air-to-ground (A2G) channel by the link preprocess is maximized. Then, the maximum utility function of each UAV is used as the basis of obtaining NE point according to the backhaul channel and the backhaul congestion. Finally, the improved NE strategy is applied in multiple iterations until maximum utility functions of all the UAVs are reached, and the UAVs which are rejected by air-to-air (A2A) link during the process would participate in the source recovery process to construct a multi-hop backhaul network. Simulation results show that average effective backhaul rate, minimum effective backhaul rate increases by 10%, 28.5% respectively in ideal A2G channel, and 11.8%, 42.3% respectively in fading channel, comparing to pure NE strategy. And the average number of iterations is decreased by 5%.

Multi-lane Road Recognition Model Applying Computer Vision (컴퓨터비전을 적용한 다차선 도로 인식 모델)

  • Kim, Do-Young;Jang, Jong-Wook;Jang, Sung-Jin
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2021.10a
    • /
    • pp.317-319
    • /
    • 2021
  • In Korea, an intelligent transportation system(ITS) is established to efficiently operate traffic congestion on roads and is being used for traffic information collection and speed control systems. Currently, designated and dedicated lanes are in place to ensure traffic circulation and traffic safety, and systematic and accurate illegal vehicle crackdown systems with artificial intelligence technology are needed. In this study, we propose a vehicle number recognition model that can improve the efficiency of the traffic of designated vehicles. By applying computer vision technology, we are going to identify three-lane and four-lane multi-lane roads in real time and detect vehicle numbers by car to suggest ways to crack down on vehicles that violate the designated lane system.

  • PDF

Fast Handover Mechanism for Multi-Interface MIPv6 Environments and Performance Evaluation (다중 인터페이스 MIPv6 환경에서의 Fast Handover 방안 및 성능 분석)

  • Park, Man-Kyu;Hwang, An-Kyu;Lee, Jae-Yong;Kim, Byung-Chul
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.12
    • /
    • pp.34-43
    • /
    • 2007
  • Recently, in addition to the sharp increase of mobile nodes, various kinds of wireless technologies are available for mobile nodes. If IPv6 technology is applied to the network, multi-homing terminals which have several public IP addresses on one interface will be common. Accordingly, there are many research activities on mobility management for multi-interface, multi-homming nodes. In this paper we propose an extended fast handover mechanism for multi-interface MIPv6 environments that uses multi-interface FBU (MFBU) message instead of the existing FBU message. The MFBU message has the "tunnel destination" mobility option that points a specific tunnel destination other than NAR, and "T" flag that indicates the existence of tunnel destination option. The proposed mechanism can improve the TCP performance by mitigating packet reordering during FMIPv6 handover that can cause unnecessary congestion control due to 3 duplicate ACKs. In this paper, we implemented a multi-Interface MIPv6 simulator by extending a single-interface MIPv6 simulator in NS-2, and showed that the performance of TCP traffic is improved by using the proposed multi-interface fast MIPv6.