Home  About us  Contact
 

Packet Delay (packet + delay)

Distribution by Scientific Domains
Engineering90%

Kinds of Packet Delay

  • average packet delay
    		•

    Selected Abstracts

    IntServ6: an approach to support QoS over IPv6 wired and wireless networks

    EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, Issue 6 2008
    Jhon J. Padilla
    In this paper we propose a new approach for Quality of Service (QoS) support on Internet. This approach, named IntServ6, is based on the Integrated Services Architecture (ISA). It takes advantage of the IPv6 header flow label field to improve a set of the standard ISA properties such as reservations within tunnels, flows aggregation and interconnection with MPLS transport networks. IntServ6 can be used for QoS support in IPv6 wired and wireless networks. This paper describes the IntServ6 operation and performance evaluation over both environments. Evaluation results show that this approach has a better router performance with respect to the standard IntServ. Thus, IntServ6 reduces the mean packet delay and reduces the packet delay dependence with the mobility. Copyright © 2007 John Wiley & Sons, Ltd. [source]

    Performance of collaborative codes in CSMA/CD environment

    EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, Issue 5 2006
    F. Gebali
    A new medium access control scheme is proposed for implementing collaborative codes in a system using carrier sense multiple access with collision detection protocol (CC-CSMA/CD). We also propose a new backoff algorithm which is simple to implement and to analyse. A discrete-time Markov chain analytical model is developed for CC-CSMA/CD. The resulting model describes the regular CSMA/CD as a special case. Protocol performance measures were studied such as throughput, packet acceptance probability, average packet delay and channel utilisation. It is found that CC-CSMA/CD offers improvements over a system that uses CSMA/CD in terms of throughput, packet acceptance probability, delay and channel utilisation. Copyright © 2006 AEIT. [source]

    Performance of the Dual-Banyan ATM switch under arbitrary traffic patterns,

    EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, Issue 4 2003
    Igor Radusinovic
    Dual-Banyan (DB) is a buffered banyan asynchronous transfer mode (ATM) switch encompassing multiple input-queueing (bifurcated queueing) as its buffering strategy. This paper describes a new analytical model for a performance evaluation of the DB switch under arbitrary traffic patterns. The model developed and presented enables the computation of the switch normalized throughput and the average packet delay by iterative calculations. The efficiency of the given model is verified through a comparison with simulation results, too. We compare throughputs of DB switch and input buffer banyan, and show that DB switch has significantly better performance levels. Copyright © 2003 AEI. [source]

    Hopfield neural-network-based dynamic resource allocation scheme for non-real-time traffic in wireless networks

    INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 2 2009
    José F. Monserrat
    Abstract Dynamic resource allocation (DRA) plays a fundamental role in current and future wireless networks, including 3G systems. In this paper, a scheduling DRA scheme for non-real-time (NRT) packet services in wireless system is proposed based on the use of Hopfield neural networks (HNN). The scheme exploits the fast response time of HNN for solving NP optimization problems and has been particularized for the downlink transmission in a UMTS system, although it could be easily extended to any other radio access technology. The new DRA scheme follows a delay-centric approach, since it maximizes the overall system resource utilization while minimizing the packet delay. Simulation results confirm that the proposed HNN-based DRA scheme is effective in supporting different types of NRT services, while achieving efficient utilization of radio resources. Copyright © 2008 John Wiley & Sons, Ltd. [source]

    Performance comparison between fixed length switching and variable length switching

    INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 5 2008
    Chengchen Hu
    Abstract Fixed length switching (FLS) and variable length switching (VLS) are two main types of switching architecture in high-speed input-queued switches. FLS is based on a cell-by-cell scheduling algorithm, while VLS operates on the variable packet granularity. This paper aims to make a comprehensive comparison between these two switching modes to guide the industrial design and academic research. We use stochastic models, Petri net models, analysis and simulations to investigate various performance measures of interest. Average packet latency, bandwidth utilization, segmentation and reassembly overhead, as well as packet loss are the identified key parameters that influence the outcome of the comparison. The results achieved in this paper are twofold. On one hand, it is shown that FLS enables smaller packet loss and lower packet delay in case of a short packet. On the other hand, VLS favors better bandwidth utilization, reduced implementation complexity and lower average packet delay. We recommend VLS in the conclusion since its disadvantages can be compensated by some methods, while the problems in FLS are difficult to be solved. Copyright © 2007 John Wiley & Sons, Ltd. [source]

    Defining and maximizing PPT,a novel performance parameter for IEEE 802.11 DCF

    INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 9 2006
    Yun Li
    Abstract Much research has been conducted on saturation throughput of IEEE802.11 DCF, and has led to some improvement. But increasing the successful transmission probability of packet is also important for saving stations' battery energy and decreasing the packet delay. In this paper, we define a new performance parameter, named Product of successful transmission Probability and saturation Throughput (PPT), for 802.11 DCF, which binds successful transmission probability and saturation throughput together. An analysis is given to maximize PPT. An expression of optimal minimum contention windows (CWmin) is obtained analytically for maximizing PPT. For simplicity, we give a name DCF-PPT to the 802.11 DCF that sets its CWmin according to this expression. The performance of DCF-PPT is simulated with different stations in terms of saturation throughput, successful transmission probability and PPT. The simulation results indicate that, compared to 802.11 DCF, DCF-PPT can significantly increase the PPT and successful transmission probability (about 0.95) on condition that the saturation throughput is not decreased. Copyright © 2006 John Wiley & Sons, Ltd. [source]

    Performance analysis of the IEEE 802.11 MAC protocol for wireless LANs

    INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 6 2005
    P. Chatzimisios
    Abstract Wireless local area networks (WLANs) are extremely popular being almost everywhere including business, office and home deployments. The IEEE 802.11 protocol is the dominating standard for WLANs. The essential medium access control (MAC) mechanism of 802.11 is called distributed co-ordination function (DCF). This paper provides a simple and accurate analysis using Markov chain modelling to compute IEEE 802.11 DCF performance, in the absence of hidden stations and transmission errors. This mathematical analysis calculates in addition to the throughput efficiency, the average packet delay, the packet drop probability and the average time to drop a packet for both basic access and RTS/CTS medium access schemes. The derived analysis, which takes into account packet retry limits, is validated by comparison with OPNET simulation results. We demonstrate that a Markov chain model presented in the literature, which also calculates throughput and packet delay by introducing an additional transition state to the Markov chain model, does not appear to model IEEE 802.11 correctly, leading to ambiguous conclusions for its performance. We also carry out an extensive and detailed study on the influence on performance of the initial contention window size (CW), maximum CW size and data rate. Performance results are presented to identify the dependence on the backoff procedure parameters and to give insights on the issues affecting IEEE 802.11 DCF performance. Copyright © 2005 John Wiley & Sons, Ltd. [source]

    An Internet friendly transport protocol for continuous media over best effort networks

    INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 10 2002
    Hala ElAarag
    Abstract In this paper, we design and evaluate an Internet friendly transport-level protocol (IFTP) for solving the TCP-friendly problem. IFTP has two modes of operation. In the standard mode, the IFTP connection faithfully emulates the behaviour of TCP in order to roughly obtain a bandwidth equal to that of a TCP connection. In the extended mode, a simple modification is used to grant QoS-differentiated services to selected connections. Connections running in the extended mode can get enhanced bandwidth while still emulating the general behaviour of TCP. We develop an analytical model for the congestion control mechanism of IFTP. We also derive analytically the amount of bandwidth that IFTP may be able to claim from TCP in ideal and non-ideal environments. We evaluate IFTP through simulation and prove its TCP friendliness as well as provide performance results on some of the important metrics such as packet delay, delay jitter, packet loss and link utilization. Copyright © 2002 John Wiley & Sons, Ltd. [source]

    Monitoring and controlling QoS network domains

    INTERNATIONAL JOURNAL OF NETWORK MANAGEMENT, Issue 1 2005
    Ahsan Habib
    Increased performance, fairness, and security remain important goals for service providers. In this work, we design an integrated distributed monitoring, traffic conditioning, and flow control system for higher performance and security of network domains. Edge routers monitor (using tomography techniques) a network domain to detect quality of service (QoS) violations,possibly caused by underprovisioning,as well as bandwidth theft attacks. To bound the monitoring overhead, a router only verifies service level agreement (SLA) parameters such as delay, loss, and throughput when anomalies are detected. The marking component of the edge router uses TCP flow characteristics to protect ,fragile' flows. Edge routers may also regulate unresponsive flows, and may propagate congestion information to upstream domains. Simulation results indicate that this design increases application-level throughput of data applications such as large FTP transfers; achieves low packet delays and response times for Telnet and WWW traffic; and detects bandwidth theft attacks and service violations.,Copyright © 2004 John Wiley & Sons, Ltd. [source]