• 제목/요약/키워드: average end-to-end delay

검색결과 88건 처리시간 0.024초

Supporting Quality of Experience based on Service Level Agreement for Heterogeneous Networks

  • Lee, Moon-Ho;Lee, Jong-Chan
    • 한국컴퓨터정보학회논문지
    • /
    • 제21권7호
    • /
    • pp.17-22
    • /
    • 2016
  • In this paper we propose a novel QoE control scheme based on Service Level Agreement (SLA) which enables to guarantee the user perceived service quality of various high-quality mobile multimedia services such as mobile video streaming and real-time network games to a certain level. For this purpose, a SLA control structure is adopted to provision QoE, and a novel resource management scheme gets coupled with this control structure. Simulation results show that our proposed scheme can decrease the average delay and increase the total throughput by adjusting SLA.

CLSR: Cognitive Link State Routing for CR-based Tactical Ad Hoc Networks

  • Ahn, Hyochun;Kim, Jaebeom;Ko, Young-Bae
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권1호
    • /
    • pp.50-67
    • /
    • 2015
  • The Cognitive Radio (CR) paradigm in tactical ad hoc networks is an important element of future military communications for network-centric warfare. This paper presents a novel Cognitive Link State Routing protocol for CR-based tactical ad hoc networks. The proposed scheme provides prompt and reliable routes for Primary User (PU) activity through procedures that incorporate two main functions: PU-aware power adaptation and channel switching. For the PU-aware power adaptation, closer multipoint relay nodes are selected to prevent network partition and ensure successful PU communication. The PU-aware channel switching is proactively conducted using control messages to switch to a new available channel based on a common channel list. Our simulation study based on the ns-3 simulator demonstrates that the proposed routing scheme delivers significantly improved performance in terms of average end-to-end delay, jitter, and packet delivery ratio.

Implementation of Node Transition Probability based Routing Algorithm for MANET and Performance Analysis using Different Mobility Models

  • Radha, Sankararajan;Shanmugavel, Sethu
    • Journal of Communications and Networks
    • /
    • 제5권3호
    • /
    • pp.202-214
    • /
    • 2003
  • The central challenge in the design of ad-hoc networks is the development of dynamic routing protocol that efficiently finds route between mobile nodes. Several routing protocols such as DSR, AODV and DSDV have been proposed in the literature to facilitate communication in such dynamically changing network topology. In this paper, a Node Transition Probability (NTP) based routing algorithm, which determines stable routes using the received power from all other neighboring nodes is proposed. NTP based routing algorithm is designed and implemented using Global Mobile Simulator (GloMoSim), a scalable network simulator. The performance of this routing algorithm is studied for various mobility models and throughput, control overhead, average end-to-end delay, and percentage of packet dropped are compared with the existing routing protocols. This algorithm shows acceptable performance under all mobility conditions. The results show that this algorithm maximizes the bandwidth utilization during heavy traffic with lesser overhead.

Joint Routing and Channel Assignment in Multi-rate Wireless Mesh Networks

  • Liu, Jiping;Shi, Wenxiao;Wu, Pengxia
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권5호
    • /
    • pp.2362-2378
    • /
    • 2017
  • To mitigate the performance degradation caused by performance anomaly, a number of channel assignment algorithms have been proposed for multi-rate wireless mesh networks. However, network conditions have not been fully considered for routing process in these algorithms. In this paper, a joint scheme called Multi-rate Dijkstra's Shortest path - Rate Separated (MDSRS) is proposed, combining routing metrics and channel assignment algorithm. In MDSRS, the routing metric are determined through the synthesized deliberations of link costs and rate matches; then the rate separated channel assignment is operated based on the determined routing metric. In this way, the competitions between high and low rate links are avoided, and performance anomaly problem is settled, and the network capacity is efficiently improved. Theoretical analysis and NS-3 simulation results indicate that, the proposed MDSRS can significantly improve the network throughput, and decrease the average end-to-end delay as well as packet loss probability. Performance improvements could be achieved even in the heavy load network conditions.

공장 자동화용 혼합형 네트워크를 위한 실시간 동기화 알고리즘의 성능 분석: CAN과 센서 네트워크 (Real-time Synchronization Algorithm for Industrial Hybrid Networks: CAN and Sensor Networks)

  • 정지원;김동성
    • 제어로봇시스템학회논문지
    • /
    • 제16권2호
    • /
    • pp.194-201
    • /
    • 2010
  • This paper discuss a performance evaluation of the synchronization algorithm for hybrid networks in industrial environments. The proposed algorithms minimizes synchronization errors which were caused from channel, Propagation, and frequency delays. The modified RBS and offset synchronization methods can be operated by adjustment parameters. The differential BP (Back-off Period) adjustment can synchronize the local time of each node with master node's time in hybrid networks. For the performance analysis, the data transmission time between the wired and wireless devices are investigated. The experimental results show the performance evaluations in terms of the polling service time and an average end-to-end delay.

TCP/IP 네트워크에서 ARED 알고리즘의 성능 개선 (Improve ARED Algorithm in TCP/IP Network)

  • 남재현
    • 한국컴퓨터정보학회논문지
    • /
    • 제12권3호
    • /
    • pp.177-183
    • /
    • 2007
  • 인터넷에서 종단간 혼잡제어 방식을 지원하기 위해 제안된 라우터에서 큐에 적용되어 패킷을 폐기하는 방법으로 능동적 큐 관리(AQM;Active queue management) 방법이 적용되고 있다. IETF에서 제안된 AQM 알고리즘은 RED(Random Early Detection) 방식이다. RED 알고리즘은 망의 높은 처리율과 낮은 평균 지연을 얻기 위해 네트워크에서 운영된다. 하지만 평균 큐 길이는 네트워크의 혼잡 레벨에 민감한 결과를 갖게 된다. 본 논문에서는 RED 성능에 영향을 미치는 파라메터의 민감성을 감소시키고 성능을 개선시키기 위해 정련된 적응 RED(RARED; Refined Adaptive RED)를 제안한다. 시뮬레이션을 통해 네트워크 전체의 개선된 RARED 알고리즘을 관찰하고 RARED가 패킷 폐기율의 감소와 성공적인 전송률의 개선이 이루어짐을 보여준다.

  • PDF

Performance Variations of AODV, DSDV and DSR Protocols in MANET under CBR Traffic using NS-2.35

  • Chandra, Pankaj;Soni, Santosh
    • International Journal of Computer Science & Network Security
    • /
    • 제22권7호
    • /
    • pp.13-20
    • /
    • 2022
  • Basically Mobile Ad Hoc Network (MANET) is an autonomous system with the collection of mobile nodes, these nodes are connected to each other by using wireless networks. A mobile ad hoc network poses this quality which makes topology in dynamic manner. As this type of network is Ad Hoc in nature hence it doesn't have fixed infrastructure. If a node wishes to transfer data from source node to a sink node in the network, the data must be passed through intermediate nodes to reach the destination node, hence in this process data packet loss occurs in various MANET protocols. This research study gives a comparison of various Mobile Ad Hoc Network routing protocols like proactive (DSDV) and reactive (AODV, DSR) by using random topology with more intermediate nodes using CBR traffic. Our simulation used 50, 100, and 150 nodes variations to examine the performance of the MANET routing protocols. We compared the performance of DSDV, AODV and DSR, MANET routing protocols with the result of existing protocol using NS-2 environment, on the basis of different performance parameters like Packet Delivery Ratio, average throughput and average end to end delay. Finally we found that our results are better in terms of throughput and packet delivery ratio along with low data loss.

Intelligent Traffic Light using Fuzzy Neural Network

  • Park, Myeong-Bok;You-Sik, Hong
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제3권1호
    • /
    • pp.66-71
    • /
    • 2003
  • In the past, when there were few vehicles on the road, the T.O.D.(Time of Day) traffic signal worked very well. The T.O.D. signal operates on a preset signal cycling which cycles on the basis of the average number of average passenger cars in the memory device of an electric signal unit. Today, with increasing traffic and congested roads, the conventional traffic light creates startup-delay time and end lag time so that thirty to forty-five percent efficiency in traffic handling is lost, as well as adding to fuel costs. To solve this problem, this paper proposes a new concept of optimal green time algorithm, which reduces average vehicle waiting time while improving average vehicle speed using fuzzy rules and neural networks. Through computer simulation, this method has been proven to be much more efficient than fixed time interval signals. Fuzzy Neural Network will consistanly improve average waiting time, vehicle speed, and fuel consumption.

A Case for Using Service Availability to Characterize IP Backbone Topologies

  • Keralapura Ram;Moerschell Adam;Chuah Chen Nee;Iannaccone Gianluca;Bhattacharyya Supratik
    • Journal of Communications and Networks
    • /
    • 제8권2호
    • /
    • pp.241-252
    • /
    • 2006
  • Traditional service-level agreements (SLAs), defined by average delay or packet loss, often camouflage the instantaneous performance perceived by end-users. We define a set of metrics for service availability to quantify the performance of Internet protocol (IP) backbone networks and capture the impact of routing dynamics on packet forwarding. Given a network topology and its link weights, we propose a novel technique to compute the associated service availability by taking into account transient routing dynamics and operational conditions, such as border gateway protocol (BGP) table size and traffic distributions. Even though there are numerous models for characterizing topologies, none of them provide insights on the expected performance perceived by end customers. Our simulations show that the amount of service disruption experienced by similar networks (i.e., with similar intrinsic properties such as average out-degree or network diameter) could be significantly different, making it imperative to use new metrics for characterizing networks. In the second part of the paper, we derive goodness factors based on service availability viewed from three perspectives: Ingress node (from one node to many destinations), link (traffic traversing a link), and network-wide (across all source-destination pairs). We show how goodness factors can be used in various applications and describe our numerical results.

Real Time Traffic Signal Plan using Neural Network

  • Choi Myeong-Bok;Hong You-Sik
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제5권4호
    • /
    • pp.360-366
    • /
    • 2005
  • In the past, when there were few vehicles on the road, the T.O.D.(Time of Day) traffic signal worked very well. The T.O.D. signal operates on a preset signal cycling which cycles on the basis of the average number of average passenger cars in the memory device of an electric signal unit. Now days, with increasing many vehicles on restricted roads, the conventional traffic light creates startup-delay time and end-lag-time. The conventional traffic light loses the function of optimal cycle. And so, $30-45\%$ of conventional traffic cycle is not matched to the present traffic cycle. In this paper we proposes electro sensitive traffic light using fuzzy look up table method which will reduce the average vehicle waiting time and improve average vehicle speed. Computer simulation results prove that reducing the average vehicle waiting time which proposed considering passing vehicle length for optimal traffic cycle is better than fixed signal method which doesn't consider vehicle length.