Results 1 - 10 of 17,865

Maximum End-to-End Delay of QTNPOSS Network for Multimedia Traffic

by Ke Xiong, Yu Zhang, Zhengding Qiu, Shenghui Wang, Dongmei Sun
"... network model by introducing Fractal Leak Bucket (FLB) shaper and Weighted Fair Queuing (WFQ) scheduler. In the proposed model, packets of multimedia traffic are shaped by the FLB shaper and scheduled by the WFQ scheduler. Moreover, the service curve and the Maximum E2E delay of QTNPOSS network are ..."
Abstract - Add to MetaCart
property does. Index Terms—QTNPOSS network, end-to-end delay, multimedia traffic, TNPOSS network, network calculus

ROMA: Determine the Maximum End-to-end Delay Based on a New Resource Rservation Method over Mobile Ipv6 Routing Architecture

by Reza Malekian , Abdul Hanan Abdullah , Ding-Geng Chen , 2011
"... Abstract: The scientific vision is to have a Mobile node (MN) which can offer the same quality of services (QoS) as fixed nodes which is difficult to achieve due to the feature mobility within a MN as well as the fact that Internet protocol was not designed for mobility. Two custom routing methods ..."
Abstract - Add to MetaCart
by using an effective envelope to traffic engineering and determine bound of end-to-end delay between MN and correspondent node (CN).

End-to-End Delay Analysis in Wireless Sensor Networks with Service Vacation

by Ibrahim Alabdulmohsin, Amal Hyadi, Laila Afify, Basem Shihada
"... Abstract—In this paper, a delay-sensitive multi-hop wireless sensor network is considered, employing an M/G/1 with vaca-tions framework. Sensors transmit measurements to a predefined data sink subject to maximum end-to-end delay constraint. In order to prolong the battery lifetime, a sleeping scheme ..."
Abstract - Add to MetaCart
Abstract—In this paper, a delay-sensitive multi-hop wireless sensor network is considered, employing an M/G/1 with vaca-tions framework. Sensors transmit measurements to a predefined data sink subject to maximum end-to-end delay constraint. In order to prolong the battery lifetime, a sleeping

End-to-End Internet Packet Dynamics,”

by Vern Paxson - Proc. SIGCOMM '97, , 1997
"... Abstract We discuss findings from a large-scale study of Internet packet dynamics conducted by tracing 20,000 TCP bulk transfers between 35 Internet sites. Because we traced each 100 Kbyte transfer at both the sender and the receiver, the measurements allow us to distinguish between the end-to-end ..."
Abstract - Cited by 843 (19 self) - Add to MetaCart
Abstract We discuss findings from a large-scale study of Internet packet dynamics conducted by tracing 20,000 TCP bulk transfers between 35 Internet sites. Because we traced each 100 Kbyte transfer at both the sender and the receiver, the measurements allow us to distinguish between the end-to-end

Designing, Modelling and Evaluating Switched Ethernet Networks in Factory Communication Systems

by N. Krommenacker, J. P. Georges, E. Rondeau, T. Divoux
"... The Ethernet network is increasingly used for the industrial communications which are strongly timeconstrained. This paper presents both a method (based on the genetic algorithms) to design switched Ethernet architectures and a method (based on the network calculus) to evaluate these network archite ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
architectures in term of maximum end-to-end delay. 1.

An Optimal Algorithm for Minimizing Energy Consumption while Limiting Maximum Delay in a Mesh Sensor Network

by Reuven Cohen, Boris Kapchits - Proceedings of IEEE International Conference on Computer Communications, INFOCOM , 2007
"... Abstract — This paper presents an algorithm for maximizing the lifetime of a sensor network while guaranteeing an upper bound on the end-to-end delay. We prove that the proposed algorithm is optimal, and that it requires simple computing operations that can be implemented by simple devices. To the b ..."
Abstract - Cited by 7 (1 self) - Add to MetaCart
. To the best of our knowledge, this is the first paper to propose a sensor wake-up frequency that depends on the sensor’s location in the routing paths. Using simulations, we show that the proposed algorithm significantly increases the lifetime of the network, while guaranteeing maximum end-to-end delay. I.

End to End delay analytical estimation of NoC with VBR traffic

by Neila Moussa, Farah Nasri, Rached Tourki
"... Network On Chip (NoC) integrate real time application that require strength performance guaranties, usually enforced by a tight upper bound on the maximum end-to-end delay. The complex and unpredictable nature of data traffic, initiate the use of modeling and analytical prediction. In this paper, a ..."
Abstract - Add to MetaCart
Network On Chip (NoC) integrate real time application that require strength performance guaranties, usually enforced by a tight upper bound on the maximum end-to-end delay. The complex and unpredictable nature of data traffic, initiate the use of modeling and analytical prediction. In this paper, a

Real-Time Scheduling of Switching Nodes Based on Asynchronous Time Sharing

by Jay Hyman, Aurel A. Lazar, Giovanni Pacifici - in Proceedings of the International Teletraffic Congress Seventh Specialist Seminar , 1990
"... The performance of a real-time scheduling algorithm for Asynchronous Time Sharing based switching nodes is presented. Three classes of traffic sources are considered to load the switching nodes: real-time video sources, for which the maximum end-to-end delay S I is guaranteed for all the cells; re ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
The performance of a real-time scheduling algorithm for Asynchronous Time Sharing based switching nodes is presented. Three classes of traffic sources are considered to load the switching nodes: real-time video sources, for which the maximum end-to-end delay S I is guaranteed for all the cells

End-to-end available bandwidth: Measurement methodology, dynamics, and relation with TCP throughput

by Manish Jain, Constantinos Dovrolis - In Proceedings of ACM SIGCOMM , 2002
"... The available bandwidth (avail-bw) in a network path is of major importance in congestion control, streaming applications, QoS verification, server selection, and overlay networks. We describe an end-to-end methodology, called Self-Loading Periodic Streams (SLoPS), for measuring avail-bw. The basic ..."
Abstract - Cited by 414 (20 self) - Add to MetaCart
The available bandwidth (avail-bw) in a network path is of major importance in congestion control, streaming applications, QoS verification, server selection, and overlay networks. We describe an end-to-end methodology, called Self-Loading Periodic Streams (SLoPS), for measuring avail-bw. The basic

Routing in a Delay Tolerant Network

by Sushant Jain, Kevin Fall, Rabin Patra , 2004
"... We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be known in advance. The problem has the added constraints of finite buffers at each node and the general property that no con ..."
Abstract - Cited by 621 (8 self) - Add to MetaCart
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be known in advance. The problem has the added constraints of finite buffers at each node and the general property
Results 1 - 10 of 17,865