Optimal Scheduling and Routing for Maximum Network Throughput
نویسندگان
چکیده
منابع مشابه
Spectrum Scheduling: the Key Factor for Maximum Throughput and Optimal Resource Utilization in Cognitive Radio Network
SPECTRUM SCHEDULING: THE KEY FACTOR FOR MAXIMUM THROUGHPUT AND OPTIMAL RESOURCE UTILIZATION IN COGNITIVE RADIO NETWORK. M. Tahir Mushtaq , M. Shoaib Hanif.M.Saleem Khan. Otto Koudelka Institute of Communication Networks and satellite Communications,TU Graz, Austria Department of Electrical Engineering, University of Mmanagement and Technology, Lahore. 2 Department of Computer Sciences, Governme...
متن کاملThroughput Optimal Network Coding and Scheduling in Wireless Networks
Recently, network coding (NC) emerged as a promising technology for significantly improving throughput and energy efficiency of wireless networks, even for unicast communication. Often, NC schemes are designed as an autonomous layer, independent of the underlying Phy and MAC capabilities and algorithms. Consequently, these schemes are greedy, in the sense that all opportunities of broadcasting ...
متن کاملOptimizing Maximum Flow Time and Maximum Throughput in Broadcast Scheduling
We consider the pull-based broadcast scheduling model. In this model, there are n unit-sized pages of information available at the server. Requests arrive over time at the server asking for a specific page. When the server transmits a page, all outstanding requests for the page are simultaneously satisfied, and this is what distinguishes broadcast scheduling from the standard scheduling setting...
متن کاملMaximum-throughput dynamic network flows
This paper presents and solves the maximum throughput dynamic network flow problem, an infinite horizon integer programming problem which involves network flows evolving over time. The model is a finite network in which the flow on each arc not only has an associated upper and lower bound but also an associated transit time. Flow is to be sent through the network in each period so as to satisfy...
متن کاملThroughput Optimal and Fast Near-Optimal Scheduling with Heterogeneously Delayed Network-State Information (Extended Version)
We consider the problem of distributed schedulingin wireless networks where heterogeneously delayed informationabout queue lengths and channel states of all links are availableat all the transmitters. In an earlier work (by Reddy et al. inQueueing Systems, 2012), a throughput optimal scheduling policy(which we refer to henceforth as the R policy) for this setting wasprop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 2007
ISSN: 1063-6692,1558-2566
DOI: 10.1109/tnet.2007.896486