FRINK Linked Data Fragments server

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

• W2273509675 abstract "The recent development and expansion of the Internet has created many technical challenges in several diverse research areas. In this thesis, we study recent problems arising in the area of Internet routing and Internet service provision. In the area of Internet routing, we analyze properties of the selfish routing model, which is a mathematical model of users selfishly routing traffic in a network without regard to their effect on other users. Additionally, we study the properties of various random graph models which have been used to model the Internet, and utilize the properties of graphs generated by those random models to develop simple compact routing schemes, which can allow network routing without having each node store very much information. In the area of Internet service provision, we study an online bipartite matching problem, in which a set of servers seeks to provide service to arriving clients with as little interruption as possible. The central theme of this thesis is to analyze precise mathematical models of Internet routing and Internet service provision, and in those models, we show certain properties hold or derive algorithms which work with high probability. The first model we study is the selfish routing model. In the selfish routing model, we analyze the efficiency of users selfishly routing traffic and study a counterintuitive phenomenon known as Braess's Paradox, which states that adding a link to a network with selfish routing may actually increase the latency for all users. We produce tight and nearly tight bounds on the maximum increase in latency that can occur due to Braess's Paradox in single-commodity and multicommodity networks, respectively. We also produce the first nearly tight bounds on the maximum latency that can occur when traffic is routed selfishly in multicommodity networks, relative to the maximum latency that occurs when traffic is routed optimally. In the second part of the thesis, we study random graph models which have been used to model the Internet, and look for properties of graphs generated by those models, which can be used to derive simple compact routing schemes. The goal of compact routing is to derive algorithms which minimize the information stored by nodes in the network, while maintaining the ability of all nodes to route packets to each other along relatively short paths. In this research area, we show that graphs generated by several random graph models used to model the Internet (e.g. the preferential attachment model), can be decomposed in a novel manner, which allows compact routing to be achieved easily. Along the way, we also prove that a Polya urns random process has good load balancing properties, which may be of independent interest. In the last part of the thesis, we study an online bipartite matching problem, which models a problem occurring in the area of Internet service provision. In our online bipartite matching problem, we imagine that we have some servers capable of providing some service, and clients arrive one at a time to request service from a subset of servers capable of servicing their request. The goal of the problem is to assign the arriving clients to servers capable of servicing their requests, all while minimizing the number of times that a client needs to be switched from one server to another server. Although prior worst case analysis for this problem has not yielded interesting results, we show tight bounds on the number of times clients need to be switched under a few natural models. As we analyze these problems arising in the Internet from a precise mathematical perspective, we also seek to reflect on the process used to solve mathematical problems. Although the thought process can sometimes be difficult to describe, in one case, we attempt to provide a step-by-step account of how the final result was proved, and attempt to describe a high level algorithm, which summarizes the methodology that used to prove it." @default.
• W2273509675 created "2016-06-24" @default.
• W2273509675 creator A5013747946 @default.
• W2273509675 creator A5078476534 @default.
• W2273509675 date "2009-01-01" @default.
• W2273509675 modified "2023-09-24" @default.
• W2273509675 title "Internet routing and internet service provision" @default.
• W2273509675 cites W1482864149 @default.
• W2273509675 cites W1501694180 @default.
• W2273509675 cites W1526250527 @default.
• W2273509675 cites W1534602136 @default.
• W2273509675 cites W1547923038 @default.
• W2273509675 cites W1572923654 @default.
• W2273509675 cites W1602427779 @default.
• W2273509675 cites W1610423063 @default.
• W2273509675 cites W1668637896 @default.
• W2273509675 cites W1816822853 @default.
• W2273509675 cites W1855579273 @default.
• W2273509675 cites W1972771074 @default.
• W2273509675 cites W1981107357 @default.
• W2273509675 cites W1981267404 @default.
• W2273509675 cites W1993286459 @default.
• W2273509675 cites W1994032071 @default.
• W2273509675 cites W1996066664 @default.
• W2273509675 cites W1998128290 @default.
• W2273509675 cites W1998475765 @default.
• W2273509675 cites W1999176895 @default.
• W2273509675 cites W2002778126 @default.
• W2273509675 cites W2008620264 @default.
• W2273509675 cites W2011039300 @default.
• W2273509675 cites W2011730242 @default.
• W2273509675 cites W2012551365 @default.
• W2273509675 cites W2027725119 @default.
• W2273509675 cites W2037653791 @default.
• W2273509675 cites W2046793205 @default.
• W2273509675 cites W2053387401 @default.
• W2273509675 cites W2055238258 @default.
• W2273509675 cites W2059879891 @default.
• W2273509675 cites W2071546224 @default.
• W2273509675 cites W2075071286 @default.
• W2273509675 cites W2077787105 @default.
• W2273509675 cites W2082848291 @default.
• W2273509675 cites W2097147952 @default.
• W2273509675 cites W2097568888 @default.
• W2273509675 cites W2106800330 @default.
• W2273509675 cites W2107527903 @default.
• W2273509675 cites W2112269231 @default.
• W2273509675 cites W2117702591 @default.
• W2273509675 cites W2120176025 @default.
• W2273509675 cites W2121907157 @default.
• W2273509675 cites W2125537511 @default.
• W2273509675 cites W2128467914 @default.
• W2273509675 cites W2131951207 @default.
• W2273509675 cites W2142133329 @default.
• W2273509675 cites W2147499094 @default.
• W2273509675 cites W2159759087 @default.
• W2273509675 cites W2162656786 @default.
• W2273509675 cites W2167217653 @default.
• W2273509675 cites W2293001982 @default.
• W2273509675 cites W2406309358 @default.
• W2273509675 cites W2770485470 @default.
• W2273509675 cites W2797415156 @default.
• W2273509675 cites W2913618476 @default.
• W2273509675 cites W6948751 @default.
• W2273509675 cites W77957838 @default.
• W2273509675 cites W1560950108 @default.
• W2273509675 hasPublicationYear "2009" @default.
• W2273509675 type Work @default.
• W2273509675 sameAs 2273509675 @default.
• W2273509675 citedByCount "0" @default.
• W2273509675 crossrefType "journal-article" @default.
• W2273509675 hasAuthorship W2273509675A5013747946 @default.
• W2273509675 hasAuthorship W2273509675A5078476534 @default.
• W2273509675 hasConcept C101396714 @default.
• W2273509675 hasConcept C104954878 @default.
• W2273509675 hasConcept C110875604 @default.
• W2273509675 hasConcept C115443555 @default.
• W2273509675 hasConcept C120314980 @default.
• W2273509675 hasConcept C136764020 @default.
• W2273509675 hasConcept C174336149 @default.
• W2273509675 hasConcept C174809319 @default.
• W2273509675 hasConcept C177818476 @default.
• W2273509675 hasConcept C178086212 @default.
• W2273509675 hasConcept C196423136 @default.
• W2273509675 hasConcept C204948658 @default.
• W2273509675 hasConcept C31258907 @default.
• W2273509675 hasConcept C41008148 @default.
• W2273509675 hasConcept C63969886 @default.
• W2273509675 hasConcept C74172769 @default.
• W2273509675 hasConcept C76522221 @default.
• W2273509675 hasConcept C87044965 @default.
• W2273509675 hasConcept C9659607 @default.
• W2273509675 hasConceptScore W2273509675C101396714 @default.
• W2273509675 hasConceptScore W2273509675C104954878 @default.
• W2273509675 hasConceptScore W2273509675C110875604 @default.
• W2273509675 hasConceptScore W2273509675C115443555 @default.
• W2273509675 hasConceptScore W2273509675C120314980 @default.
• W2273509675 hasConceptScore W2273509675C136764020 @default.
• W2273509675 hasConceptScore W2273509675C174336149 @default.
• W2273509675 hasConceptScore W2273509675C174809319 @default.

• next