• Title/Summary/Keyword: Packet Delay

Search Result 1,168, Processing Time 0.023 seconds

Wired/Wireless Combination Network Plan for Realtime Wiress Multimedia Application Service (Realtime Wiress Multimedia Application service를 위한 유/무선 통합 네트워크 설계)

  • Eon, Ki-Boo;Lee, Mung-Hoon;Yoe, Hyun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.109-112
    • /
    • 2005
  • As the degree of use of network is increasing the need for building the basic of the stable network service is being needed a lot. Also the engineers require the traffic control for the best application and management and bandwidth management urgently. To solve these problems, there were no other ways of increasing the bandwidth of lines until now. However, this solution has the limit that the cost is too high and the traffic problem is growing continuously. On this study, it is suggested that through the planning the wired /wireless combination network design offering the service of QoS, Multicast, Mobile, realtime multimedia traffic delay without packet loss will be dealth with.

  • PDF

Multi-Objective Handover in LTE Macro/Femto-Cell Networks

  • Roy, Abhishek;Shin, Jitae;Saxena, Navrati
    • Journal of Communications and Networks
    • /
    • v.14 no.5
    • /
    • pp.578-587
    • /
    • 2012
  • One of the key elements in the emerging, packet-based long term evolution (LTE) cellular systems is the deployment of multiple femtocells for the improvement of coverage and data rate. However, arbitrary overlaps in the coverage of these femtocells make the handover operation more complex and challenging. As the existing handover strategy of LTE systems considers only carrier to interference plus noise ratio (CINR), it often suffers from resource constraints in the target femtocell, thereby leading to handover failure. In this paper, we propose a new efficient, multi-objective handover solution for LTE cellular systems. The proposed solution considers multiple parameters like signal strength and available bandwidth in the selection of the optimal target cell. This results in a significant increase in the handover success rate, thereby reducing the blocking of handover and new sessions. The overall handover process is modeled and analyzed by a three-dimensional Markov chain. The analytical results for the major performance metrics closely resemble the simulation results. The simulation results show that the proposed multi-objective handover offers considerable improvement in the session blocking rates, session queuing delay, handover latency, and goodput during handover.

Analysis of Multicast Handover Scheme for Next Generation Access Networks (차세대 광 가입자망에서 멀티캐스트 서비스 지원을 위한 핸드오버 기법)

  • Lee, Young-Suk;Lee, Dong-Soo;Kim, Young-Han
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37C no.12
    • /
    • pp.1303-1309
    • /
    • 2012
  • In this paper, we propose a handover scheme for seamless mobile multicast service in next generation access networks. For this, we drew optimum handover scheme when applying MIP(mobile IP), FMIP(Fast MIP), HMIP(Heterogeneous MIP), PMIP(Proxy MIP) to XG-PON1. And, we analyze handover scheme for seamless mobile multicast service in XG-PON1. The prosed handover scheme remove tunnel convergence and reduces handover delay, packet delivery cost.

Does Higher Datarate Perform Better in IEEE 802.11-based Multihop Ad Hoc Networks?

  • Li, Frank Y.;Hafslund, Andreas;Hauge, Mariann;Engelstad, Paal;Kure, Oivind;Spilling, Pal
    • Journal of Communications and Networks
    • /
    • v.9 no.3
    • /
    • pp.282-295
    • /
    • 2007
  • Due to the nature that high datarate leads to shorter transmission range, the performance enhancement by high datarate 802.11 WLANs may be degraded when applying high datarate to an 802.11 based multihop ad hoc network. In this paper, we evaluate, through extensive simulations, the performance of multihop ad hoc networks at multiple transmission datarates, in terms of the number of hops between source and destination, throughput, end-to-end delay and packet loss. The study is conducted based on both stationary chain topology and mesh topologies with or without node mobility. From numerical results on network performance based on chain topology, we conclude that there is almost no benefit by applying the highest datarate when the chain length is 6 hops or more. With node mobility in mesh topology, the benefit of using high datarate diminishes at even shorter number of hops. To explore the main reasons for this behavior, analyses on multihop end-to-end throughput and network k-connectivity have been conducted later in the paper, and correspondingly an auto-rate adaptation algorithm has been proposed.

Study of High-Speed NGN Resource Control Schemes (NGN 자원제어 스킴의 고속화 방안에 관한 연구)

  • Cha, Young-Wook;Han, Tae-Man;Jeong, You-Hyeon
    • The KIPS Transactions:PartC
    • /
    • v.16C no.3
    • /
    • pp.383-392
    • /
    • 2009
  • Next generation network (NGN) is a packet-based converged network to support session and non-session services in QoS-enabled broadband transport network. QoS based resource control must be defined to support differentiated services for various network users in NGN. This paper defined parallel control schemes for NGN resource control interfaces to minimize session and resource control delays. We simulated the existing and proposed NGN control schemes to measure and analyze control delays and completion ratios. By arrival rate of 120 in two-phase resource control, we checked out that completion ratios of sequential and parallel schemes achieved 100%, and the control delay of parallel scheme was improved by about 21.5% compared to that of sequential scheme.

An Enhanced Message Priority Mechanism in IEEE 802.11p Based Vehicular Networks

  • Liu, Chang;Chung, Sang-Hwa;Jeong, Han-You;Jung, Ik-Joo
    • Journal of Information Processing Systems
    • /
    • v.11 no.3
    • /
    • pp.465-482
    • /
    • 2015
  • IEEE 802.11p is a standard MAC protocol for wireless access in vehicular environments (WAVEs). If a packet collision happens when a safety message is sent out, IEEE 802.11p chooses a random back-off counter value in a fixed-size contention window. However, depending on the random choice of back-off counter value, it is still possible that less important messages are sent out first while more important messages are delayed longer until sent out. In this paper, we present a new scheme for safety message scheduling, called the enhanced message priority mechanism (EMPM). It consists of the following two components: the benefit-value algorithm, which calculates the priority of the messages depending on the speed, deceleration, and message lifetime; and the back-off counter selection algorithm, which chooses the non-uniform back-off counter value in order to reduce the collision probability and to enhance the throughput of the highly beneficial messages. Numerical results show that the EMPM can significantly improve the throughput and delay of messages with high benefits when compared with existing MAC protocols. Consequently, the EMPM can provide better QoS support for the more important and urgent messages.

A study on link-efficiency and Traffic analysis for Packet-switching using the link state algorithm (링크상태 알고리즘을 이용한 패킷스위칭의 트래픽분석과 링크효율에 관한 연구)

  • 황민호;고남영
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.1
    • /
    • pp.30-35
    • /
    • 2002
  • Dynamic routing uses routing protocols to select the best routes and to update the routing table. RP (Routing Information Protocol)using a distance-vector algorithm becomes generally known a routing protocol on the network. RIP selects the route with the lowest "hop count" (metric) as the best route. but RIP has a serious shortcoming. a mP router cannot maintain a complete routing table for a network that has destinations more than 15 hops away. To overcome this defect, It uses the OSPF (Open Shortest Path First) of link -state protocols developed for TCP/IP. It is suitable for very large networks and provides several advantages over RIP. This paper analyzes the traffic and the link efficiency between two protocols such as message delivery and delay, link utilization, message counts on the same network.e network.

Radio Link Protocol Layer For CDMA 2000 Wireless Systems

  • A. S. Pandya;Kim, Pyeoung-Kee;Daniel Esso
    • Journal of information and communication convergence engineering
    • /
    • v.2 no.1
    • /
    • pp.9-14
    • /
    • 2004
  • In this paper the modeling of the RLP layer in CDMA2000 is presented, which uses the NAK based ARQ scheme for Random Error Channels. The RLP performs a partial link recovery through limited number of RLP frame transmission in case of frame error. In case when the RLP fails due to excessive frame error, the control is passed on to the higher (TCP) layer. The TCP layer provides the complete end-to-end recovery. Thus the reliable performance at the TCP/RLP is essential to maintain the required Quality of Service in the DS-CDMA wireless links. The modeling is done for the performance analysis of the system in terms of the throughput and the mean extra delays, which are calculated analytically and are compared with the results generated by the simulations. This paper studies the effect of the random errors over different types of RLP frame formats and also the performance of the NAK based ARQ mechanism used under these conditions. The simulation provides with the over all characteristics of the throughput and the mean extra delay in terms of realistic environment parameters like Eb/No and probability of packet error (PE), based on the channel conditions.

Partial Bicasting with Buffering for Proxy Mobile IPv6 Handover in Wireless Networks

  • Kim, Ji-In;Koh, Seok-Joo
    • Journal of Information Processing Systems
    • /
    • v.7 no.4
    • /
    • pp.627-634
    • /
    • 2011
  • This paper addresses the Proxy Mobile IPv6 (PMIP) handover using bicasting in mobile/wireless networks. The bicasting scheme can be used to support the PMIP handover, which tends to waste the network resources of wireless links and incurs data losses during handover. We propose an enhanced scheme of PMIP handover, called the partial bicasting with buffering for PMIP (PBB-PMIP). In the PBB-PMIP handover, the bicasting is performed in the "partial" region between the Local Mobility Anchor (LMA) and the Mobile Access Gateway (MAG), when a mobile node is in the handover area. The data packets are buffered at the new MAG during handover to reduce data losses and are then forwarded to mobile nodes after handover. By ns-2 simulations, the proposed PBB-PMIP scheme is compared with the existing schemes of PMIP and PMIP with bicasting. The proposed scheme can benefit from the reduction of handover delay and packet loss, and the effective use of the network resources of wireless links, as compared to the existing handover schemes.

Development of Link Cost Function using Neural Network Concept in Sensor Network

  • Lim, Yu-Jin;Kang, Sang-Gil
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.1
    • /
    • pp.141-156
    • /
    • 2011
  • In this paper we develop a link cost function for data delivery in sensor network. Usually most conventional methods determine the optimal coefficients in the cost function without considering the surrounding environment of the node such as the wireless propagation environment or the topological environment. Due to this reason, there are limitations to improve the quality of data delivery such as data delivery ratio and delay of data delivery. To solve this problem, we derive a new cost function using the concept of Partially Connected Neural Network (PCNN) which is modeled according to the input types whether inputs are correlated or uncorrelated. The correlated inputs are connected to the hidden layer of the PCNN in a coupled fashion but the uncoupled inputs are in an uncoupled fashion. We also propose the training technique for finding an optimal weight vector in the link cost function. The link cost function is trained to the direction that the packet transmission success ratio of each node maximizes. In the experimental section, we show that our method outperforms other conventional methods in terms of the quality of data delivery and the energy efficiency.