Filters








1,948 Hits in 4.7 sec

Convexity properties of loss and overflow functions

Krishnan Kumaran, Michel Mandjes, Alexander Stolyar
2003 Operations Research Letters  
C e n t r u m v o o r W i s k u n d e e n I n f o r m a t i c a PNA Probability, Networks and Algorithms Probability, Networks and Algorithms Convexity properties of loss and overflow functions  ...  The authors would like to thank Iraj Saniee for insightful comments.  ...  In Section 4 the large deviations regime is examined, and the convexity of the trade-off curve for buffer overflow probability is proved before conclusion in Section 5.  ... 
doi:10.1016/s0167-6377(02)00191-8 fatcat:7wvlxamddjbq7f6tnydsiszo2u

The Effect of Block-wise Feedback on the Throughput-Delay Trade-off in Streaming [article]

Gauri Joshi, Yuval Kochman, Gregory Wornell
2014 arXiv   pre-print
Depending upon the delay-sensitivity and bandwidth limitations of the application, one can choose an appropriate operating point on this trade-off.  ...  We study this trade-off between throughput and in-order decoding delay, and in particular how it is affected by the frequency of block-wise feedback to the source.  ...  The optimal (τ, λ) trade-off when d = 3 is the piecewise linear curve joining points Proof: When d = 3 there are four time-invariant schemes x (1) = [3, 0, 0], x (2) = [2, 1, 0], x (3) = [1, 2, 0] and  ... 
arXiv:1403.0259v1 fatcat:wfgzo5yjwba2pdzmxgfbefzxmq

The effect of block-wise feedback on the throughput-delay trade-off in streaming

Gauri Joshi, Yuval Kochman, Gregory W. Wornell
2014 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)  
Depending upon the delay-sensitivity and bandwidth limitations of the application, one can choose an appropriate operating point on this trade-off.  ...  We study this trade-off between throughput and in-order decoding delay, and in particular how it is affected by the frequency of block-wise feedback to the source.  ...  The optimal (τ, λ) trade-off when d = 3 is the piecewise linear curve joining points Proof: When d = 3 there are four time-invariant schemes x (1) = [3, 0, 0], x (2) = [2, 1, 0], x (3) = [1, 2, 0] and  ... 
doi:10.1109/infcomw.2014.6849236 dblp:conf/infocom/JoshiKW14 fatcat:skm5pwvcnbhdzkg73hxfn24cj4

Dynamic congestion-based pricing of bandwidth and buffer

Nan Jin, G. Venkitachalam, S. Jordan
2005 IEEE/ACM Transactions on Networking  
We analyze the performance of the dynamic pricing policies and show that the gradient algorithm using Newton's method converges more quickly and displays only a few small fluctuations.  ...  Distributed pricing roles are assigned to each user, each network node, and an arbitrager in between the user and the network.  ...  Because the two resources can be traded-off to achieve the same loss, a decrease in would move the minimum cost combination of bandwidth and buffer from point B to point C, on the same loss contour, but  ... 
doi:10.1109/tnet.2005.861252 fatcat:vj3ngwk2u5ffngphtplcre4qqe

Effect of packetization on VoIP performance

Boonchai Ngamwongwattana
2008 2008 5th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology  
Adaptive rate VoIP is a solution that can mitigate the problem. Adaptive rate VoIP has the ability to adapt its transmission rate to match the available network bandwidth.  ...  VoIP over packet-switched networks including the Internet poses problems because the network service is not guaranteed to meet such requirements, i.e. the available bandwidth as well as the delay and loss  ...  The figures demonstrate the effect of packetization. We choose Fig. 4 to explain the findings. The convex curves in the figure show the important inherent trade-off of packetization.  ... 
doi:10.1109/ecticon.2008.4600449 fatcat:udyjfhywkzg7xkvy64gg5tsmo4

Packet Pacing in Short Buffer Optical Packet Switched Networks

V. Sivaraman, H. Elgindy, D. Moreland, D. Ostry
2006 Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications  
The loss-delay trade-off mechanism provided by pacing can help achieve desired OPS network performance.  ...  We first evaluate the impact of short buffers on the performance of real-time and TCP traffic.  ...  ACKNOWLEDGEMENTS The authors would like to thank Craig Russell of CSIRO, together with Mohit Mundhra and Amit Kumar of the Indian Institute of Technology for their help in setting up the TCP experiments  ... 
doi:10.1109/infocom.2006.109 dblp:conf/infocom/SivaramanEMO06 fatcat:5c463spmufbcpn7sbm6iw57rqy

Packet Pacing in Small Buffer Optical Packet Switched Networks

V. Sivaraman, H. Elgindy, D. Moreland, D. Ostry
2009 IEEE/ACM Transactions on Networking  
We argue that the loss-delay trade-off mechanism provided by pacing can be instrumental in overcoming the performance hurdle arising from the scarcity of buffers in OPS networks.  ...  To mitigate the performance degradation resulting from small buffers, this paper proposes that optical edge nodes "pace" the injection of traffic into the OPS core.  ...  which is a very attractive cost-benefit trade-off.  ... 
doi:10.1109/tnet.2008.2005622 fatcat:7zfrxrdcazfr5m52rvx5artjdi

The effect of bandwidth and buffer pricing on resource allocation and QoS

Nan Jin, Scott Jordan
2004 Computer Networks  
We then show that the minimum total cost is a decreasing convex function of loss.  ...  We derive necessary and sufficient conditions for bandwidth and buffer to act as Normal goods, showing that this depends on the shapes of the utility and QoS functions.  ...  First, the substitution effect trades off bandwidth for buffer, moving from A to B. Second, the income effect causes an increase in loss on link 1, moving from B to C. Corollary 3.  ... 
doi:10.1016/j.comnet.2004.03.023 fatcat:xspafnhrnvej7ctmrv5i6ou4ty

Downlink Power Allocation for Stored Variable-Bit-Rate Videos [article]

Yingsong Huang, Shiwen Mao, Yihan Li
2011 arXiv   pre-print
The formulated problem is a nonlinear nonconvex optimization problem. We analyze the convexity conditions for the formulated problem and propose a two-step greedy approach to solve the problem.  ...  The objective is to derive the optimal downlink power allocation for the VBR video sessions, such that the video data can be delivered in a timely fashion without causing playout buffer overflow and underflow  ...  In [25] , the authors studied the frequency of jitters under both network and video system constraint and provided a framework for quantifying the trade-offs among several system parameters.  ... 
arXiv:1105.0476v1 fatcat:eamegpm7fjhkrjaeuz4wh5pdga

Downlink Power Allocation for Stored Variable-Bit-Rate Videos [chapter]

Yingsong Huang, Shiwen Mao, Yihan Li
2012 Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering  
The formulated problem is a nonlinear nonconvex optimization problem. We analyze the convexity conditions for the formulated problem and propose a two-step greedy approach to solve the problem.  ...  The objective is to derive the optimal downlink power allocation for the VBR video sessions, such that the video data can be delivered in a timely fashion without causing playout buffer overflow and underflow  ...  This work is supported in part by the US National Science Foundation (NSF) under Grants CNS-0953513, ECCS-0802113, IIP-1032002, and IIP-1127952, and through the NSF Wireless Internet Center for Advanced  ... 
doi:10.1007/978-3-642-29222-4_34 fatcat:5oyi5brzr5ejjhqitwq5qjzgby

Allocating commodity resources in aggregate traffic networks

N.G. Duffield, S.H. Low
2004 Performance evaluation (Print)  
We examine the relation between cost and quality in networks which carry aggregate traffic. A powerful tool in this is the burstiness or indifference curve associated with a stochastic traffic flow.  ...  An example is motivated by the Controlled Load service specification.  ...  Thus the trade-off between bandwidth and buffer allocation has the potential to be achieved whenever resources are allocated to a flow, rather than at the level of provisioning the network.  ... 
doi:10.1016/j.peva.2003.10.009 fatcat:2md7foqwgfdk5dmetsjcpc52r4

Quality of Service on Queueing Networks for the Internet

Hans W. Gottinger
2013 iBusiness  
Most studies of resource allocation mechanisms in Internet traffic have used a performance model of the resource provided, where the very concept of the resource is defined in terms of measurable qualities  ...  One novelty introduced by an economic mechanism design approach is to craft a demand-driven system which takes into account the diverse QoS requirements of users, and therefore, uses multiobjective (utility  ...  Bandwidth can be traded for buffer space and vice versa to provide the same QoS. If a bandwidth is scarce, then a resource pair that uses less bandwidth and more buffer space should be used.  ... 
doi:10.4236/ib.2013.53012 fatcat:h6crhgx7gjhhxc7irm2wy4uek4

PCRTT Enhancement for Off-Line Video Smoothing

Ofer Hadar, Reuven Cohen
2001 Real-time imaging  
E-PCRTT is shown to construct transmission rate-plans with smaller buffer sizes, as compared to the original PCRTT, and alternatively, for the same buffer size, e-PCRTT reduces the number of bandwidth  ...  A n enhancement of the Piecewise Constant Rate Transmission and Transport (PCRTT) algorithm for reducing the burstiness of a video stream based on smoothing constant intervals is proposed.  ...  Wu-chi Feng from the Department of Computer and Information Science, Ohio State University for the video streams database.  ... 
doi:10.1006/rtim.2001.0229 fatcat:iwf436qcobafhf2v5grebtp6vm

Practical lazy scheduling in sensor networks

Ramana Rao Kompella, Alex C. Snoeren
2003 Proceedings of the first international conference on Embedded networked sensor systems - SenSys '03  
The optimal per-packet transmission rate in a multi-node network is governed in practice by the available bit rates of the given transceiver(s), the nodes' delay tolerance, and the offered load at every  ...  Experience has shown that the power consumption of sensors and other wireless computational devices is often dominated by their communication patterns.  ...  Acknowledgments This paper benefited greatly from discussions with Geoff Voelker, Stefan Savage, and Rajesh Gupta, and comments from the anonymous reviewers and our shepherd, Mani Srivastava.  ... 
doi:10.1145/958522.958524 fatcat:oxfptl7suzgszeq5f6uylga7hy

Practical lazy scheduling in sensor networks

Ramana Rao Kompella, Alex C. Snoeren
2003 Proceedings of the first international conference on Embedded networked sensor systems - SenSys '03  
The optimal per-packet transmission rate in a multi-node network is governed in practice by the available bit rates of the given transceiver(s), the nodes' delay tolerance, and the offered load at every  ...  Experience has shown that the power consumption of sensors and other wireless computational devices is often dominated by their communication patterns.  ...  Acknowledgments This paper benefited greatly from discussions with Geoff Voelker, Stefan Savage, and Rajesh Gupta, and comments from the anonymous reviewers and our shepherd, Mani Srivastava.  ... 
doi:10.1145/958491.958524 dblp:conf/sensys/KompellaS03 fatcat:2tguk4mwf5hctkdf5zohtqocvq
« Previous Showing results 1 — 15 out of 1,948 results