• Title/Summary/Keyword: Packets loss rate

Search Result 91, Processing Time 0.025 seconds

A Routing Protocol with Fast-Recovery of Failures Using Backup Paths on MANETs (MANET에서 백업경로를 이용한 빠른 경로복구 능력을 가진 라우팅 프로토콜)

  • Thai, Ahn Tran;Kim, Myung-Kyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.7
    • /
    • pp.1541-1548
    • /
    • 2012
  • This paper proposes a new multipath-based routing protocol on MANETs with Fast-Recovery of failures. The proposed protocol establishes the primary and secondary paths between a source and a destination considering the end-to-end packet reception reliability of routes. The primary path is used to transmit messages, and the secondary path is used to recover the path when detecting failures on the primary path. If a node detects a link failure during message transmission, it can recover the path locally by switching from the primary to the secondary path. By allowing the intermediate nodes to recover locally the route failure, the proposed protocol can reduce the number of packet loss and the amount of control packets for setting up new paths. The simulation result using QualNet simulator shows that the proposed protocol was about 10-20% higher than other protocols in terms of end-to-end message delivery ratio and the fault recovery time in case of link fault was about 3 times faster than the other protocols.

Performance Analysis of Group Scheduling for Core Nodes in Optical Burst Switching Networks (광 버스트 스위칭 네트워크의 코어 노드를 위한 그룹 스케줄링 성능 분석)

  • 신종덕;이재명;김형석
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.8B
    • /
    • pp.721-729
    • /
    • 2004
  • In this paper, we applied a group scheduling algorithm to core nodes in an optical burst switching (OBS) network and measured its performance by simulation. For the case of core nodes with multi-channel input/output ports, performance of the group scheduling has been compared to that of the immediate scheduling. Since the group scheduling has a characteristic of scheduling a group of bursts simultaneously in a time window using information collected from corresponding burst header packets arrived earlier to a core node, simulation results show that the group scheduling outperforms the immediate scheduling in terms of both burst loss probability and channel utilization and the difference gets larger as the load increases. Another node configuration in which wavelength converters are equipped at the output ports has also been considered. In this case, even though both performance metrics of the group scheduling are almost the same as those of the immediate scheduling in the offered load range between 0.1 and 0.9, the group scheduling has lower wavelength conversion rate than the immediate scheduling by at least a factor of seven. This fact leads us to the conclusion that the group scheduling makes it possible to implement more economical OBS core nodes.

(A New Queue Management Algorithm Improving Fairness of the Internet Congestion Control) (인터넷 혼잡제어에서 공정성 향상을 위한 새로운 큐 관리 알고리즘)

  • 구자헌;최웅철;정광수
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.3
    • /
    • pp.437-447
    • /
    • 2003
  • In order to reduce the increasing packet loss rates caused by an exponential increase in network traffic, the IETF(Internet Engineering Task Force) is considering the deployment of active queue management techniques such as RED(Random Early Detection) algorithm. However, RED algorithm simple but does not protect traffic from high-bandwidth flows, which include not only flows that fail to use end-to-end congestion control such as UDP flow, but also short round-trip time TCP flows. In this paper, in order to solve this problem, we propose a simple fairness queue management scheme, called AFQM(Approximate Fair Queue Management) algorithm, that discriminate against the flows which submit more packets/sec than is allowed by their fair share. By doing this, the scheme aims to approximate the fair queueing policy Since it is a small overhead and easy to implement, AFQM algorithm controls unresponsive or misbehaving flows with a minimum overhead.

Adaptive Packet Scheduling Scheme to Support Real-time Traffic in WLAN Mesh Networks

  • Zhu, Rongb;Qin, Yingying;Lai, Chin-Feng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.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.

Performance analysis of CSMA based MAC protocols for underwater communications (수중 통신에 적합한 CSMA기반 매체접근제어 프로토콜 연구)

  • Song, Min-Je;Jang, Youn-Seon
    • Journal of IKEEE
    • /
    • v.22 no.4
    • /
    • pp.1068-1072
    • /
    • 2018
  • In underwater communications, there are many challenges due to energy limitations, long propagation delay, low data rate, and high power loss, unlike terrestrial RF communications. Especially, the propagation delay of underwater acoustic channel is five orders of magnitude higher than in electro-magnetic terrestrial channels due to the low speed of sound(1,500m/s). Thus, the MAC protocols for terrestrial communications are not suitable for underwater network. In this paper, we studied the considerations for MAC protocol in underwater acoustic channel. Here, we concentrated on CSMA based MAC protocols. From the results, we confirmed that the number of control packets has an important effect on the performance in underwater environment. These results would be useful in designing MAC protocols for underwater acoustic communications.

Kriging Regressive Deep Belief WSN-Assisted IoT for Stable Routing and Energy Conserved Data Transmission

  • Muthulakshmi, L.;Banumathi, A.
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.7
    • /
    • pp.91-102
    • /
    • 2022
  • With the evolution of wireless sensor network (WSN) technology, the routing policy has foremost importance in the Internet of Things (IoT). A systematic routing policy is one of the primary mechanics to make certain the precise and robust transmission of wireless sensor networks in an energy-efficient manner. In an IoT environment, WSN is utilized for controlling services concerning data like, data gathering, sensing and transmission. With the advantages of IoT potentialities, the traditional routing in a WSN are augmented with decision-making in an energy efficient manner to concur finer optimization. In this paper, we study how to combine IoT-based deep learning classifier with routing called, Kriging Regressive Deep Belief Neural Learning (KR-DBNL) to propose an efficient data packet routing to cope with scalability issues and therefore ensure robust data packet transmission. The KR-DBNL method includes four layers, namely input layer, two hidden layers and one output layer for performing data transmission between source and destination sensor node. Initially, the KR-DBNL method acquires the patient data from different location. Followed by which, the input layer transmits sensor nodes to first hidden layer where analysis of energy consumption, bandwidth consumption and light intensity are made using kriging regression function to perform classification. According to classified results, sensor nodes are classified into higher performance and lower performance sensor nodes. The higher performance sensor nodes are then transmitted to second hidden layer. Here high performance sensor nodes neighbouring sensor with higher signal strength and frequency are selected and sent to the output layer where the actual data packet transmission is performed. Experimental evaluation is carried out on factors such as energy consumption, packet delivery ratio, packet loss rate and end-to-end delay with respect to number of patient data packets and sensor nodes.

Design and Implementation of Network-Adaptive High Definition MPEG-2 Streaming employing frame-based Prioritized Packetization (프레임 기반의 우선순위화를 적용한 네트워크 적응형 HD MPEG-2 스트리밍의 설계 및 구현)

  • Park SangHoon;Lee Sensjoo;Kim JongWon;Kim WooSuk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.10A
    • /
    • pp.886-895
    • /
    • 2005
  • As the networked media technology have been grown in recent, there have been many research works to deliver high-quality video such as HDV and HDTV over the Internet. To realize high-quality media service over the Internet, however, the network adaptive streaming scheme is required to adopt to the dynamic fluctuation of underlying networks. In this paper, we design and implement the network-adaptive HD(high definition) MPEG-2 streaming system employing the frame-based prioritized packetization. Delivered video is inputted from the JVC HDV camera to the streaming sewer in real-time. It has a bit-rate of 19.2 Mbps and is multiplexed to the MPEG-2 TS (MPEG-2 MP@HL). For the monitoring of network status, the packet loss rate and the average jitter are measured by using parsing of RTP packet header in the streaming client and they are sent to the streaming server periodically The network adaptation manager in the streaming server estimates the current network status from feedback packets and adaptively adjusts the sending rate by frame dropping. For this, we propose the real-time parsing and the frame-based prioritized packetization of the TS packet. The proposed system is implemented in software and evaluated over the LAN testbed. The experimental results show that the proposed system can enhance the end-to-end QoS of HD video streaming over the best-effort network.

Voice Packet Processing Scheme for Voice Quality and Bandwidth Efficiency in VoIP (VoIP의 음성품질/대역효율 개선을 위한 음성패킷 처리)

  • Kim, Jae-Won;Sohn, Dong-Chul
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.7
    • /
    • pp.896-904
    • /
    • 2004
  • In this paper, We present an efficient variable rate speech coder for spectral efficiency and packet processing technique for packet loss compensation of a voice codec with 10msec frame in VoIP service. Through disconnecting the users from the spectral resource during silence interval of about 60% period, a variable rate voice coder based on a voice activity detection(VAD) can increase spectral gain by two times. The performance of the method was analyzed by variation of detected voice activity factor and degraded speech frame ratio under various background noise level, and compared those of G.729B of ITU-T 8kbps standard speech codec. A method to compensate lost packets utilized addition of recovery data to a main stream and error concealment scheme for speech quality enhancement, the performance is verified by reconstructed speech quality. The proposed scheme can achieve spectral gain by two times or enhance speech quality by 3dB through reserved bandwidth of VAD. Therefore, the proposed method can enhance a spectral efficiency or speech quality of VoIP.

  • PDF

Efficient Transmission of Scalable Video Streams Using Dual-Channel Structure (듀얼 채널 구조를 이용한 Scalable 비디오(SVC)의 전송 성능 향상)

  • Yoo, Homin;Lee, Jaemyoun;Park, Juyoung;Han, Sanghwa;Kang, Kyungtae
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.2 no.9
    • /
    • pp.381-392
    • /
    • 2013
  • During the last decade, the multitude of advances attained in terminal computers, along with the introduction of mobile hand-held devices, and the deployment of high speed networks have led to a recent surge of interest in Quality of Service (QoS) for video applications. The main difficulty is that mobile devices experience disparate channel conditions, which results in different rates and patterns of packet loss. One way of making more efficient use of network resources in video services over wireless channels with heterogeneous characteristics to heterogeneous types of mobile device is to use a scalable video coding (SVC). An SVC divides a video stream into a base layer and a single or multiple enhancement layers. We have to ensure that the base layer of the video stream is successfully received and decoded by the subscribers, because it provides the basis for the subsequent decoding of the enhancement layer(s). At the same time, a system should be designed so that the enhancement layer(s) can be successfully decoded by as many users as possible, so that the average QoS is as high as possible. To accommodate these characteristics, we propose an efficient transmission scheme which incorporates SVC-aware dual-channel repetition to improve the perceived quality of services. We repeat the base-layer data over two channels, with different characteristics, to exploit transmission diversity. On the other hand, those channels are utilized to increase the data rate of enhancement layer data. This arrangement reduces service disruption under poor channel conditions by protecting the data that is more important to video decoding. Simulations show that our scheme safeguards the important packets and improves perceived video quality at a mobile device.

PSS Movement Prediction Algorithm for Seamless hando (휴대인터넷에서 seamless handover를 위한 단말 이동 예측 알고리즘)

  • Lee, Ho-Jeong;Yun, Chan-Young;Oh, Young-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.12 s.354
    • /
    • pp.53-60
    • /
    • 2006
  • Handover of WiBro is based on 802.16e hard handover scheme. When PSS is handover, it is handover that confirm neighbor's cell condition and RAS ID in neighbor advertisement message. Serving RAS transmits HO-notification message to neighbor RAS. Transmiting HO-notification message to neighbor RAS, it occurs many signaling traffics. Also, When WiBro is handover, It occurs many packet loss. Therefore, user suffer service degradation. LPM handover is supporting seamless handover because it buffers data packets during handover. So It is proposed scheme that predicts is LPM handover and reserves target RAS with pre-authentication. These schemes occur many signaling traffics. In this paper, we propose PSS Movement Prediction to solve signaling traffic. Target RAS is decided by old data in history cache. When serving RAS receives HO-notification-RSP message to target RAS, target RAS inform to crossover node. And crossover node bicast data packet. If handover is over, target RAS forward data packet. Therefore, It reduces signaling traffics but increase handover success rate. When history cache success, It decrease about 48% total traffic. But When history cache fails, It increase about 6% total traffic