FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2303818269> ?p ?o ?g. }

• W2303818269 abstract "Convex optimization techniques have found important applications in communications and signal processing. Recently, there has been a surge in research activities that apply the latest development in convex optimization to the design and analysis of communication systems. This research focuses on how to apply optimization techniques on both massive content distribution in high-speed Internet core, and cross-layer design in wireless ad hod networks. One of the important trends is that the Internet will be used to transfer content on more and more massive scale. Collaborative distribution techniques such as swarming and parallel download have been invented and effectively applied to end-user file-sharing or media-streaming applications, but mostly for improving end-user performance objectives. We consider the issues that arise from applying these techniques to content distribution networks for improving network objectives, such as reducing network congestion. In particular, we formulate the problem of how to make many-to-many assignment from the sending nodes to the receivers and allocate bandwidth for every connection, subject to the node capacity and receiving rate constraints. The objective is to minimize the worst link congestion over the network, which is equivalent to maximizing the distribution throughput, or minimizing the distribution time. The optimization framework allows us to jointly consider server load balancing, network congestion control, as well as the requirement of the receivers. We develop a special, diagonally-scaled gradient projection algorithm, which has a faster convergence speed, and hence, better scalability with respect to the network size than a standard subgradient algorithm. We provide both a synchronous algorithm and a more practical asynchronous algorithm. However, on the negative side, swarming traffic has made capacity shortage in the backbone networks a genuine possibility, which will be more serious with fiber-based access. The second problem addressed is how to conduct massive content distribution efficiently in the future network environment where the capacity limitation can equally be at the core or the edge. We propose a novel peer-to-peer technique as a main content transport mechanism to achieve efficient network resource utilization. The technique uses multiple trees for distributing different file pieces, which at the heart is a version of swarming. In this chapter, we formulate an optimization problem for determining an optimal set of distribution trees as well as the rate of distribution on each tree under bandwidth limitation at arbitrary places in the network. The optimal solution can be found by a distributed algorithm. The results of the chapter not only provide stand-alone solutions to the massive content distribution problem, but should also help the understanding of existing distribution techniques such as BitTorrent or FastReplica. The joint optimal design of congestion control and wireless MAC-layer scheduling problem in multi-hop wireless networks has become a very active research area in the last few years. We solve this problem using a column generation approach with imperfect scheduling. We point out that the general subgradient algorithm has difficulty in recovering the time-share variables and experiences slower convergence. We first propose a two-timescale algorithm that can recover the optimal time-share values. Most existing algorithms have a component, called global scheduling, which is usually NP-hard. We apply imperfect scheduling and prove that if the imperfect scheduling achieves an approximation ratio ρ, then our algorithm converges to a sub-optimum of the overall problem with the same approximation ratio. By combining the idea of column generation and the two-timescale algorithm, we derive a family of algorithms that allow us to reduce the number of times the global scheduling is needed." @default.
• W2303818269 created "2016-06-24" @default.
• W2303818269 creator A5033098866 @default.
• W2303818269 creator A5053743638 @default.
• W2303818269 date "2008-01-01" @default.
• W2303818269 modified "2023-09-23" @default.
• W2303818269 title "Optimization techniques in communication networks" @default.
• W2303818269 cites W1512056429 @default.
• W2303818269 cites W1559582792 @default.
• W2303818269 cites W1578131866 @default.
• W2303818269 cites W1601770119 @default.
• W2303818269 cites W1603765807 @default.
• W2303818269 cites W1607044975 @default.
• W2303818269 cites W1609138317 @default.
• W2303818269 cites W1656271119 @default.
• W2303818269 cites W1847181667 @default.
• W2303818269 cites W1898800882 @default.
• W2303818269 cites W1901187898 @default.
• W2303818269 cites W1967786783 @default.
• W2303818269 cites W1987497363 @default.
• W2303818269 cites W1988411989 @default.
• W2303818269 cites W1988615825 @default.
• W2303818269 cites W1993721302 @default.
• W2303818269 cites W1997996213 @default.
• W2303818269 cites W2000346548 @default.
• W2303818269 cites W2021136283 @default.
• W2303818269 cites W2026357470 @default.
• W2303818269 cites W2032334504 @default.
• W2303818269 cites W2032775246 @default.
• W2303818269 cites W2035652501 @default.
• W2303818269 cites W2037710455 @default.
• W2303818269 cites W2038564299 @default.
• W2303818269 cites W2054420170 @default.
• W2303818269 cites W2056386972 @default.
• W2303818269 cites W2057456423 @default.
• W2303818269 cites W2061560193 @default.
• W2303818269 cites W2082591111 @default.
• W2303818269 cites W2085443650 @default.
• W2303818269 cites W2096389124 @default.
• W2303818269 cites W2096998282 @default.
• W2303818269 cites W2098779032 @default.
• W2303818269 cites W2101414465 @default.
• W2303818269 cites W2104259309 @default.
• W2303818269 cites W2105310795 @default.
• W2303818269 cites W2106007310 @default.
• W2303818269 cites W2106049515 @default.
• W2303818269 cites W2107905061 @default.
• W2303818269 cites W2109055312 @default.
• W2303818269 cites W2109164986 @default.
• W2303818269 cites W2109545390 @default.
• W2303818269 cites W2111653376 @default.
• W2303818269 cites W2111749847 @default.
• W2303818269 cites W2112952306 @default.
• W2303818269 cites W2114578240 @default.
• W2303818269 cites W2116512712 @default.
• W2303818269 cites W2119462289 @default.
• W2303818269 cites W2119905956 @default.
• W2303818269 cites W2121598558 @default.
• W2303818269 cites W2122519207 @default.
• W2303818269 cites W2122629722 @default.
• W2303818269 cites W2122963563 @default.
• W2303818269 cites W2123893388 @default.
• W2303818269 cites W2126351339 @default.
• W2303818269 cites W2126956578 @default.
• W2303818269 cites W2127494222 @default.
• W2303818269 cites W2127544254 @default.
• W2303818269 cites W2128823163 @default.
• W2303818269 cites W2130338891 @default.
• W2303818269 cites W2135039403 @default.
• W2303818269 cites W2135055886 @default.
• W2303818269 cites W2136885855 @default.
• W2303818269 cites W2138993731 @default.
• W2303818269 cites W2142372059 @default.
• W2303818269 cites W2145289614 @default.
• W2303818269 cites W2146803030 @default.
• W2303818269 cites W2147096535 @default.
• W2303818269 cites W2147524058 @default.
• W2303818269 cites W2154968665 @default.
• W2303818269 cites W2157123777 @default.
• W2303818269 cites W2159049132 @default.
• W2303818269 cites W2159715570 @default.
• W2303818269 cites W2161051913 @default.
• W2303818269 cites W2162961745 @default.
• W2303818269 cites W2164571150 @default.
• W2303818269 cites W2164977831 @default.
• W2303818269 cites W2166245380 @default.
• W2303818269 cites W2167165867 @default.
• W2303818269 cites W2168983077 @default.
• W2303818269 cites W2169156893 @default.
• W2303818269 cites W2170178059 @default.
• W2303818269 cites W2170280226 @default.
• W2303818269 cites W2174430759 @default.
• W2303818269 cites W2176466527 @default.
• W2303818269 cites W2243699487 @default.
• W2303818269 cites W2399307553 @default.
• W2303818269 cites W2464517467 @default.
• W2303818269 cites W2537443178 @default.
• W2303818269 cites W2613173048 @default.
• W2303818269 cites W2787523326 @default.
• W2303818269 hasPublicationYear "2008" @default.

• next