+publisher:"Delft University of Technology" +contributor:("Van Mieghem, P.F.A.")

1. Imamdi, R.M.A. (author). Robustness Analysis and Capacity Management of the KPN (PS) Mobile Core Network.

Degree: 2010, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:5026ac00-085f-495e-980e-f99cd0384030

► This thesis has two main topics. On the one hand it discusses how the robustness of a network can be increased as efficient as possible,… (more)

Subjects/Keywords: robustness; clgebraic-connectivity; cdge-connectivity; certex-connectivity; cactus-representation; capacity; KPN; vertex-criticality; CTA-edge-betweenness; Survey

10 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Imamdi, R. M. A. (. (2010). Robustness Analysis and Capacity Management of the KPN (PS) Mobile Core Network. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:5026ac00-085f-495e-980e-f99cd0384030

Chicago Manual of Style (16^th Edition):

Imamdi, R M A (author). “Robustness Analysis and Capacity Management of the KPN (PS) Mobile Core Network.” 2010. Masters Thesis, Delft University of Technology. Accessed January 15, 2021. http://resolver.tudelft.nl/uuid:5026ac00-085f-495e-980e-f99cd0384030.

MLA Handbook (7^th Edition):

Imamdi, R M A (author). “Robustness Analysis and Capacity Management of the KPN (PS) Mobile Core Network.” 2010. Web. 15 Jan 2021.

Vancouver:

Imamdi RMA(. Robustness Analysis and Capacity Management of the KPN (PS) Mobile Core Network. [Internet] [Masters thesis]. Delft University of Technology; 2010. [cited 2021 Jan 15]. Available from: http://resolver.tudelft.nl/uuid:5026ac00-085f-495e-980e-f99cd0384030.

Council of Science Editors:

Imamdi RMA(. Robustness Analysis and Capacity Management of the KPN (PS) Mobile Core Network. [Masters Thesis]. Delft University of Technology; 2010. Available from: http://resolver.tudelft.nl/uuid:5026ac00-085f-495e-980e-f99cd0384030

Delft University of Technology

2. He, Z. Performance of complex networks: Efficiency and Robustness.

Degree: 2020, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:a9ae2b62-0cf8-4cf3-86af-abd33bc99080 ; urn:NBN:nl:ui:24-uuid:a9ae2b62-0cf8-4cf3-86af-abd33bc99080 ; a9ae2b62-0cf8-4cf3-86af-abd33bc99080 ; 10.4233/uuid:a9ae2b62-0cf8-4cf3-86af-abd33bc99080 ; urn:isbn:978-94-6384-1 ; urn:NBN:nl:ui:24-uuid:a9ae2b62-0cf8-4cf3-86af-abd33bc99080 ; http://resolver.tudelft.nl/uuid:a9ae2b62-0cf8-4cf3-86af-abd33bc99080

► Network performance is determined by the interplay of underlying structures and overlying dynamic processes on networks. This thesis mainly considers two types of collective dynamics… (more)

▼ Network performance is determined by the interplay of underlying structures and overlying dynamic processes on networks. This thesis mainly considers two types of collective dynamics on networks, spread and transport, which are ubiquitous in our daily lives, ranging from information propagation, disease spreading, to molecular motors on cytoskeleton and urban traffic. Exploring the approaches on optimizing the network performance is the fundamental motivation of this work, which helps to control processes on networks and to upgrade network-based services. Although the properties of phase transition in Susceptible-Infected-Susceptible (SIS) processes have been investigated intensively, the time-dependent behavior of epidemics is still an open question. This thesis starts with the investigation of the spreading time (Chapter 2), which is the time when the number of infected nodes in the metastable state is first reached, starting from the outbreak of the epidemics. We observe that the spreading time resembles a lognormal-like distribution both for the Markovian and the non-Markovian infection processes. As a follow-up work of Chapter 2, we identify the fastest initial spreaders with the shortest average spreading time in epidemics on a network, which helps to ensure an efficient spreading (Chapter 3). We show that the fastest spreader changes with the effective infection rate of a SIS epidemic process, which means that the time-dependent influence of a node is usually strongly coupled to the dynamic process and the underlying network. We propose the spreading efficiency as a metric to quantify the efficiency of a spreader and identify the fastest spreader, which is adaptive to different infection rates in general networks. For maximizing the utility of spread, we introduce induced spreading, which aims to maximize the infection probabilities of some target nodes by adjusting the nodal infection rates (Chapter 4). We assume that the adjustment of the nodal infection rates has an associated cost and formulate the induced spreading for SIS epidemics in networks as an optimization problem under a constraint on the total cost. We address both a static model and a dynamic model for the optimization of the induced SIS spreading. We show that the infection rate increment on each node is coupled to both the degree and the average hops to the target nodes in the static optimization method. In the dynamic method, the effective resistance is a good metric to indicate the minimum total cost for targeting a single node. The average fraction of infected nodes in the NIMFA steady state, also called the steady-state prevalence, in terms of the effective infection rate can be expanded into a power series around the NIMFA epidemic threshold. Practically, we can faster compute the nodal infection probability of the NIMFA steady-state by the truncated expansion with enough terms and an effective infection rate within the radius of convergence. Thus, we investigate the radius of convergence that… Advisors/Committee Members: F.A.%22%29&pagesize-30">Van Mieghem, P.F.A..

Subjects/Keywords: Complex Networks; Network Robustness; Epidemic Spreading; Transport; Network Optimization

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

He, Z. (2020). Performance of complex networks: Efficiency and Robustness. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:a9ae2b62-0cf8-4cf3-86af-abd33bc99080 ; urn:NBN:nl:ui:24-uuid:a9ae2b62-0cf8-4cf3-86af-abd33bc99080 ; a9ae2b62-0cf8-4cf3-86af-abd33bc99080 ; 10.4233/uuid:a9ae2b62-0cf8-4cf3-86af-abd33bc99080 ; urn:isbn:978-94-6384-1 ; urn:NBN:nl:ui:24-uuid:a9ae2b62-0cf8-4cf3-86af-abd33bc99080 ; http://resolver.tudelft.nl/uuid:a9ae2b62-0cf8-4cf3-86af-abd33bc99080

Chicago Manual of Style (16^th Edition):

He, Z. “Performance of complex networks: Efficiency and Robustness.” 2020. Doctoral Dissertation, Delft University of Technology. Accessed January 15, 2021. http://resolver.tudelft.nl/uuid:a9ae2b62-0cf8-4cf3-86af-abd33bc99080 ; urn:NBN:nl:ui:24-uuid:a9ae2b62-0cf8-4cf3-86af-abd33bc99080 ; a9ae2b62-0cf8-4cf3-86af-abd33bc99080 ; 10.4233/uuid:a9ae2b62-0cf8-4cf3-86af-abd33bc99080 ; urn:isbn:978-94-6384-1 ; urn:NBN:nl:ui:24-uuid:a9ae2b62-0cf8-4cf3-86af-abd33bc99080 ; http://resolver.tudelft.nl/uuid:a9ae2b62-0cf8-4cf3-86af-abd33bc99080.

MLA Handbook (7^th Edition):

He, Z. “Performance of complex networks: Efficiency and Robustness.” 2020. Web. 15 Jan 2021.

Vancouver:

He Z. Performance of complex networks: Efficiency and Robustness. [Internet] [Doctoral dissertation]. Delft University of Technology; 2020. [cited 2021 Jan 15]. Available from: http://resolver.tudelft.nl/uuid:a9ae2b62-0cf8-4cf3-86af-abd33bc99080 ; urn:NBN:nl:ui:24-uuid:a9ae2b62-0cf8-4cf3-86af-abd33bc99080 ; a9ae2b62-0cf8-4cf3-86af-abd33bc99080 ; 10.4233/uuid:a9ae2b62-0cf8-4cf3-86af-abd33bc99080 ; urn:isbn:978-94-6384-1 ; urn:NBN:nl:ui:24-uuid:a9ae2b62-0cf8-4cf3-86af-abd33bc99080 ; http://resolver.tudelft.nl/uuid:a9ae2b62-0cf8-4cf3-86af-abd33bc99080.

Council of Science Editors:

He Z. Performance of complex networks: Efficiency and Robustness. [Doctoral Dissertation]. Delft University of Technology; 2020. Available from: http://resolver.tudelft.nl/uuid:a9ae2b62-0cf8-4cf3-86af-abd33bc99080 ; urn:NBN:nl:ui:24-uuid:a9ae2b62-0cf8-4cf3-86af-abd33bc99080 ; a9ae2b62-0cf8-4cf3-86af-abd33bc99080 ; 10.4233/uuid:a9ae2b62-0cf8-4cf3-86af-abd33bc99080 ; urn:isbn:978-94-6384-1 ; urn:NBN:nl:ui:24-uuid:a9ae2b62-0cf8-4cf3-86af-abd33bc99080 ; http://resolver.tudelft.nl/uuid:a9ae2b62-0cf8-4cf3-86af-abd33bc99080

Delft University of Technology

3. Hekmat, R. Fundamental Properties of Wireless Mobile Ad-hoc Networks.

Degree: 2005, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:4b80dec5-66be-4b00-904d-e064ca35406b ; urn:NBN:nl:ui:24-uuid:4b80dec5-66be-4b00-904d-e064ca35406b ; urn:NBN:nl:ui:24-uuid:4b80dec5-66be-4b00-904d-e064ca35406b ; http://resolver.tudelft.nl/uuid:4b80dec5-66be-4b00-904d-e064ca35406b

► Wireless mobile ad-hoc networks are formed by mobile devices that set up a possibly short-lived network for communication needs of the moment. Ad-hoc networks are… (more)

▼ Wireless mobile ad-hoc networks are formed by mobile devices that set up a possibly short-lived network for communication needs of the moment. Ad-hoc networks are decentralized, self-organizing networks capable of forming a communication network without relying on any fixed infrastructure. Each node in an ad-hoc network is equipped with a radio transmitter and receiver which allows it to communicate with other nodes over wireless channels. All nodes can function, if needed, as relay stations for data packets to be routed to their final destination. In other words, ad-hoc networks allow for multi-hop transmission of data between nodes outside the direct radio reach of each other. Ad-hoc networks have distinct advantages over traditional communication networks. For example, ad-hoc networks can be more economical as they eliminate fixed infrastructure costs, and they can be more robust because of their non-hierarchical distributed control and management mechanisms. Ad-hoc networks increase mobility and flexibility, as they can be brought up and torn down in a very short time. Ad-hoc networks form a relatively new and very diverse field of research. In this thesis we focus our attention on the fundamental properties of ad-hoc networks. For an ad-hoc network to function properly in the first place it must be connected, or mostly connected. Otherwise the network would consist of scattered isolated islands and could not support networking applications. Secondly, the ad-hoc network must have enough capacity to transport the required amount of data between network nodes. By fundamental properties we mean those properties of the network that directly and substantially affect the connectivity or the capacity of the network. In this thesis we have introduced a new mathematical model for ad-hoc networks which is based on realistic assumptions for radio propagation. By using this model we were able to modify connectivity theorems for wireless ad-hoc networks, and have contributed substantially to a better understanding of degree distribution and hopcount in ad-hoc networks. Another novel aspect in this thesis is a new method proposed for the calculation of interference statistics. Also, we have shown that interference in ad-hoc networks is upper bounded and have derived a mathematical formula for this upper bound. Our interference calculation methods have allowed us to investigate the capacity of ad-hoc networks. We have found capacity limits for ad-hoc networks and have established that in multi-hop ad-hoc networks there is a trade-off between the network size and the maximum input bit rate possible per node. Large ad-hoc networks, consisting of thousands of nodes, can only support low-bit-rate applications. Advisors/Committee Members: F.A.%22%29&pagesize-30">Van Mieghem, P.F.A..

Subjects/Keywords: ad-hoc networks; graph theory; connectivity; degree; hopcount; interference capacity

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Hekmat, R. (2005). Fundamental Properties of Wireless Mobile Ad-hoc Networks. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:4b80dec5-66be-4b00-904d-e064ca35406b ; urn:NBN:nl:ui:24-uuid:4b80dec5-66be-4b00-904d-e064ca35406b ; urn:NBN:nl:ui:24-uuid:4b80dec5-66be-4b00-904d-e064ca35406b ; http://resolver.tudelft.nl/uuid:4b80dec5-66be-4b00-904d-e064ca35406b

Chicago Manual of Style (16^th Edition):

Hekmat, R. “Fundamental Properties of Wireless Mobile Ad-hoc Networks.” 2005. Doctoral Dissertation, Delft University of Technology. Accessed January 15, 2021. http://resolver.tudelft.nl/uuid:4b80dec5-66be-4b00-904d-e064ca35406b ; urn:NBN:nl:ui:24-uuid:4b80dec5-66be-4b00-904d-e064ca35406b ; urn:NBN:nl:ui:24-uuid:4b80dec5-66be-4b00-904d-e064ca35406b ; http://resolver.tudelft.nl/uuid:4b80dec5-66be-4b00-904d-e064ca35406b.

MLA Handbook (7^th Edition):

Hekmat, R. “Fundamental Properties of Wireless Mobile Ad-hoc Networks.” 2005. Web. 15 Jan 2021.

Vancouver:

Hekmat R. Fundamental Properties of Wireless Mobile Ad-hoc Networks. [Internet] [Doctoral dissertation]. Delft University of Technology; 2005. [cited 2021 Jan 15]. Available from: http://resolver.tudelft.nl/uuid:4b80dec5-66be-4b00-904d-e064ca35406b ; urn:NBN:nl:ui:24-uuid:4b80dec5-66be-4b00-904d-e064ca35406b ; urn:NBN:nl:ui:24-uuid:4b80dec5-66be-4b00-904d-e064ca35406b ; http://resolver.tudelft.nl/uuid:4b80dec5-66be-4b00-904d-e064ca35406b.

Council of Science Editors:

Hekmat R. Fundamental Properties of Wireless Mobile Ad-hoc Networks. [Doctoral Dissertation]. Delft University of Technology; 2005. Available from: http://resolver.tudelft.nl/uuid:4b80dec5-66be-4b00-904d-e064ca35406b ; urn:NBN:nl:ui:24-uuid:4b80dec5-66be-4b00-904d-e064ca35406b ; urn:NBN:nl:ui:24-uuid:4b80dec5-66be-4b00-904d-e064ca35406b ; http://resolver.tudelft.nl/uuid:4b80dec5-66be-4b00-904d-e064ca35406b

Delft University of Technology

4. Fu, B. Traffic engineering and quality of service in the internet.

Degree: 2009, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:4dc692f2-47ca-4724-9b9f-f75f484db22d ; urn:NBN:nl:ui:24-uuid:4dc692f2-47ca-4724-9b9f-f75f484db22d ; urn:NBN:nl:ui:24-uuid:4dc692f2-47ca-4724-9b9f-f75f484db22d ; http://resolver.tudelft.nl/uuid:4dc692f2-47ca-4724-9b9f-f75f484db22d

Subjects/Keywords: traffic engineering; quality of service

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Fu, B. (2009). Traffic engineering and quality of service in the internet. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:4dc692f2-47ca-4724-9b9f-f75f484db22d ; urn:NBN:nl:ui:24-uuid:4dc692f2-47ca-4724-9b9f-f75f484db22d ; urn:NBN:nl:ui:24-uuid:4dc692f2-47ca-4724-9b9f-f75f484db22d ; http://resolver.tudelft.nl/uuid:4dc692f2-47ca-4724-9b9f-f75f484db22d

Chicago Manual of Style (16^th Edition):

Fu, B. “Traffic engineering and quality of service in the internet.” 2009. Doctoral Dissertation, Delft University of Technology. Accessed January 15, 2021. http://resolver.tudelft.nl/uuid:4dc692f2-47ca-4724-9b9f-f75f484db22d ; urn:NBN:nl:ui:24-uuid:4dc692f2-47ca-4724-9b9f-f75f484db22d ; urn:NBN:nl:ui:24-uuid:4dc692f2-47ca-4724-9b9f-f75f484db22d ; http://resolver.tudelft.nl/uuid:4dc692f2-47ca-4724-9b9f-f75f484db22d.

MLA Handbook (7^th Edition):

Fu, B. “Traffic engineering and quality of service in the internet.” 2009. Web. 15 Jan 2021.

Vancouver:

Fu B. Traffic engineering and quality of service in the internet. [Internet] [Doctoral dissertation]. Delft University of Technology; 2009. [cited 2021 Jan 15]. Available from: http://resolver.tudelft.nl/uuid:4dc692f2-47ca-4724-9b9f-f75f484db22d ; urn:NBN:nl:ui:24-uuid:4dc692f2-47ca-4724-9b9f-f75f484db22d ; urn:NBN:nl:ui:24-uuid:4dc692f2-47ca-4724-9b9f-f75f484db22d ; http://resolver.tudelft.nl/uuid:4dc692f2-47ca-4724-9b9f-f75f484db22d.

Council of Science Editors:

Fu B. Traffic engineering and quality of service in the internet. [Doctoral Dissertation]. Delft University of Technology; 2009. Available from: http://resolver.tudelft.nl/uuid:4dc692f2-47ca-4724-9b9f-f75f484db22d ; urn:NBN:nl:ui:24-uuid:4dc692f2-47ca-4724-9b9f-f75f484db22d ; urn:NBN:nl:ui:24-uuid:4dc692f2-47ca-4724-9b9f-f75f484db22d ; http://resolver.tudelft.nl/uuid:4dc692f2-47ca-4724-9b9f-f75f484db22d

Delft University of Technology

5. Kleiberg, T.J. Flow-based Networking and Quality of Service.

Degree: 2009, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:8d1284e2-1f65-450e-96a9-19d7e065b826 ; urn:NBN:nl:ui:24-uuid:8d1284e2-1f65-450e-96a9-19d7e065b826 ; urn:NBN:nl:ui:24-uuid:8d1284e2-1f65-450e-96a9-19d7e065b826 ; http://resolver.tudelft.nl/uuid:8d1284e2-1f65-450e-96a9-19d7e065b826

► During the past two decades the Internet has been widely deployed and integrated into the society, radically altering the way people communicate and exchange information.… (more)

▼ During the past two decades the Internet has been widely deployed and integrated into the society, radically altering the way people communicate and exchange information. Although the Internet was intended as a research network between few a institutions in the United States, it has grown to take a central role in day-to-day communications and is by now considered indispensable. The last decade we have seen a migration of the classic telecommunication services, telephony, radio and television, to the Internet and the emergence of new services, such as online gaming and e-government. Hence, the Internet is replacing the existing, dedicated telecommunication networks and embodies a single medium for all (wired) communications. The low latencies and losses for which the dedicated networks were optimized, cannot be guaranteed by the Internet, which philosophy relies on best-effort routing. Packets in the Internet can literally travel across the entire network, making it very hard to predict where the packets may travel, yielding tremendous uncertainties regarding packet-delays and loss. In flow-based communications, the packets from a source to a destination that belong the same stream are forced along the same path, offering a better control over the packets and an improved quality control. In this thesis we study the performance of networks using flow-based communication and we show by means of measurements that the current Internet can yield highly unpredictable behavior in packet delivery. Based on traceroute measurements we show that the best-effort environment of the Internet can lead to highly unpredictable behavior of packets. The measurements indicate that the routes that the packets in the Internet follow are very changeable due to dynamics in the routing plane. This unpredictable behavior may hamper the performance of real-time applications and serves as a motivation for the flow-based networking used in this thesis. We introduce a new model that describes the network performance by using an analogy with queueing theory. The analysis of network performance is complicated by the many dependencies between the properties of a network. The objective is to express the network performance in terms of these properties and reveal the root of the problem. The model facilitates to express the emergent performance characteristics, such as the blocking rate of traffic flows and the maximum throughput of the network, in terms of network parameters that are given by design, such as the number of nodes. The model considers the network as a black box and minimizes the degrees of freedom in order to reduce the dependencies and improve the comprehensibility of the model. Due to the small number of parameters, we are able to discern the influence of these parameters on the performance. In addition, we address the difficulties of studying network dynamics, which can be traced back to the dependencies between the links and the importance of traffic fluctuations in the network on the overall performance. Advisors/Committee Members: F.A.%22%29&pagesize-30">Van Mieghem, P.F.A..

Subjects/Keywords: QoS; flows; network performance

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Kleiberg, T. J. (2009). Flow-based Networking and Quality of Service. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:8d1284e2-1f65-450e-96a9-19d7e065b826 ; urn:NBN:nl:ui:24-uuid:8d1284e2-1f65-450e-96a9-19d7e065b826 ; urn:NBN:nl:ui:24-uuid:8d1284e2-1f65-450e-96a9-19d7e065b826 ; http://resolver.tudelft.nl/uuid:8d1284e2-1f65-450e-96a9-19d7e065b826

Chicago Manual of Style (16^th Edition):

Kleiberg, T J. “Flow-based Networking and Quality of Service.” 2009. Doctoral Dissertation, Delft University of Technology. Accessed January 15, 2021. http://resolver.tudelft.nl/uuid:8d1284e2-1f65-450e-96a9-19d7e065b826 ; urn:NBN:nl:ui:24-uuid:8d1284e2-1f65-450e-96a9-19d7e065b826 ; urn:NBN:nl:ui:24-uuid:8d1284e2-1f65-450e-96a9-19d7e065b826 ; http://resolver.tudelft.nl/uuid:8d1284e2-1f65-450e-96a9-19d7e065b826.

MLA Handbook (7^th Edition):

Kleiberg, T J. “Flow-based Networking and Quality of Service.” 2009. Web. 15 Jan 2021.

Vancouver:

Kleiberg TJ. Flow-based Networking and Quality of Service. [Internet] [Doctoral dissertation]. Delft University of Technology; 2009. [cited 2021 Jan 15]. Available from: http://resolver.tudelft.nl/uuid:8d1284e2-1f65-450e-96a9-19d7e065b826 ; urn:NBN:nl:ui:24-uuid:8d1284e2-1f65-450e-96a9-19d7e065b826 ; urn:NBN:nl:ui:24-uuid:8d1284e2-1f65-450e-96a9-19d7e065b826 ; http://resolver.tudelft.nl/uuid:8d1284e2-1f65-450e-96a9-19d7e065b826.

Council of Science Editors:

Kleiberg TJ. Flow-based Networking and Quality of Service. [Doctoral Dissertation]. Delft University of Technology; 2009. Available from: http://resolver.tudelft.nl/uuid:8d1284e2-1f65-450e-96a9-19d7e065b826 ; urn:NBN:nl:ui:24-uuid:8d1284e2-1f65-450e-96a9-19d7e065b826 ; urn:NBN:nl:ui:24-uuid:8d1284e2-1f65-450e-96a9-19d7e065b826 ; http://resolver.tudelft.nl/uuid:8d1284e2-1f65-450e-96a9-19d7e065b826

Delft University of Technology

6. Dhillon, S.S. Ant routing, searching and topology estimation algorithms for ad hoc networks.

Degree: 2008, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:b0b83041-c5af-4df3-88f2-8efee983346f ; urn:NBN:nl:ui:24-uuid:b0b83041-c5af-4df3-88f2-8efee983346f ; urn:NBN:nl:ui:24-uuid:b0b83041-c5af-4df3-88f2-8efee983346f ; http://resolver.tudelft.nl/uuid:b0b83041-c5af-4df3-88f2-8efee983346f

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Dhillon, S. S. (2008). Ant routing, searching and topology estimation algorithms for ad hoc networks. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:b0b83041-c5af-4df3-88f2-8efee983346f ; urn:NBN:nl:ui:24-uuid:b0b83041-c5af-4df3-88f2-8efee983346f ; urn:NBN:nl:ui:24-uuid:b0b83041-c5af-4df3-88f2-8efee983346f ; http://resolver.tudelft.nl/uuid:b0b83041-c5af-4df3-88f2-8efee983346f

Chicago Manual of Style (16^th Edition):

Dhillon, S S. “Ant routing, searching and topology estimation algorithms for ad hoc networks.” 2008. Doctoral Dissertation, Delft University of Technology. Accessed January 15, 2021. http://resolver.tudelft.nl/uuid:b0b83041-c5af-4df3-88f2-8efee983346f ; urn:NBN:nl:ui:24-uuid:b0b83041-c5af-4df3-88f2-8efee983346f ; urn:NBN:nl:ui:24-uuid:b0b83041-c5af-4df3-88f2-8efee983346f ; http://resolver.tudelft.nl/uuid:b0b83041-c5af-4df3-88f2-8efee983346f.

MLA Handbook (7^th Edition):

Dhillon, S S. “Ant routing, searching and topology estimation algorithms for ad hoc networks.” 2008. Web. 15 Jan 2021.

Vancouver:

Dhillon SS. Ant routing, searching and topology estimation algorithms for ad hoc networks. [Internet] [Doctoral dissertation]. Delft University of Technology; 2008. [cited 2021 Jan 15]. Available from: http://resolver.tudelft.nl/uuid:b0b83041-c5af-4df3-88f2-8efee983346f ; urn:NBN:nl:ui:24-uuid:b0b83041-c5af-4df3-88f2-8efee983346f ; urn:NBN:nl:ui:24-uuid:b0b83041-c5af-4df3-88f2-8efee983346f ; http://resolver.tudelft.nl/uuid:b0b83041-c5af-4df3-88f2-8efee983346f.

Council of Science Editors:

Dhillon SS. Ant routing, searching and topology estimation algorithms for ad hoc networks. [Doctoral Dissertation]. Delft University of Technology; 2008. Available from: http://resolver.tudelft.nl/uuid:b0b83041-c5af-4df3-88f2-8efee983346f ; urn:NBN:nl:ui:24-uuid:b0b83041-c5af-4df3-88f2-8efee983346f ; urn:NBN:nl:ui:24-uuid:b0b83041-c5af-4df3-88f2-8efee983346f ; http://resolver.tudelft.nl/uuid:b0b83041-c5af-4df3-88f2-8efee983346f

Delft University of Technology

7. Tang, S. Information Propagation in Peer-to-Peer Networking: Modeling and Empirical Studies.

Degree: 2010, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:bb4426a9-69c3-4c72-a96a-7d472735badf ; urn:NBN:nl:ui:24-uuid:bb4426a9-69c3-4c72-a96a-7d472735badf ; urn:NBN:nl:ui:24-uuid:bb4426a9-69c3-4c72-a96a-7d472735badf ; http://resolver.tudelft.nl/uuid:bb4426a9-69c3-4c72-a96a-7d472735badf

► Although being a young technology, peer-to-peer (P2P) networking has spurred dramatic evolution on the Internet over the recent twenty years. Unlike traditional server-client mode, P2P… (more)

▼ Although being a young technology, peer-to-peer (P2P) networking has spurred dramatic evolution on the Internet over the recent twenty years. Unlike traditional server-client mode, P2P networking applications are user-centric. Users (peers) generate their own content and share it with others across the Internet. Be it a P2P file-sharing network, a streaming delivery system, a video-on-demand application or an online social networking site, all of the aforementioned applications aim to fulfil a fundamental goal - that is, to deliver content to peers in a decentralized manner. In this thesis, we are motivated to study the information (or content) propagation process from the following two aspects: 1. Make use of existing techniques and propose models that are applicable in P2P networking. 2. Conduct empirical studies with emerging P2P applications regarding their methodologies of information propagation. First of all, we study gossip-based information propagation in decentralized P2P overlay networks. We illustrate the difficulty of performing an exact analysis of gossip-based information dissemination in large-scale and dynamic P2P networks, where each peer only communicates with a subset of peers in the network. We show that, describing the gossip-based information propagation process in the aforementioned networks requires a very large state space, which is computationally not feasible. To guarantee the reliability of gossip-based information dissemination, we perform exact analytic modeling of the gossip-based information dissemination algorithms under the assumption of uniform neighbor selection over the entire distributed network. The model is extended to the case where random communication with multiple peers is allowed. We incorporate different network conditions and peer behaviors in the model. Important performance metrics and design parameters are also determined analytically. The proposed model is applicable for both content propagation and content searching in decentralized P2P networks. The derived metrics can be used to assess the coverage and the effectiveness of content dissemination and search. We also study the content retrieval process provided that, m peers possessing the desired content are discovered. The effect of selecting a most nearby peer, which is assessed by hopcount and delay, among the group of m peers on P2P networking during content retrieval is analyzed. Our analysis answers the question of how many replicas of a particular content need to be distributed (or how many peers possessing the desired content need to be discovered), so that an acceptable quality of service (in terms of hopcount and delay) can be offered. The gossip-based information propagation model discussed above conveys the basic idea of P2P networking. However, due to the rapid evolution of P2P networking techniques, applications with new features have been launched and user characteristics start to play an important role. Hence, we carry out two empirical studies that are designed to disclose important design issues… Advisors/Committee Members: F.A.%22%29&pagesize-30">Van Mieghem, P.F.A..

Subjects/Keywords: information propagation; distributed/peer-to-peer networking; modeling; empirical analysis

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Tang, S. (2010). Information Propagation in Peer-to-Peer Networking: Modeling and Empirical Studies. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:bb4426a9-69c3-4c72-a96a-7d472735badf ; urn:NBN:nl:ui:24-uuid:bb4426a9-69c3-4c72-a96a-7d472735badf ; urn:NBN:nl:ui:24-uuid:bb4426a9-69c3-4c72-a96a-7d472735badf ; http://resolver.tudelft.nl/uuid:bb4426a9-69c3-4c72-a96a-7d472735badf

Chicago Manual of Style (16^th Edition):

Tang, S. “Information Propagation in Peer-to-Peer Networking: Modeling and Empirical Studies.” 2010. Doctoral Dissertation, Delft University of Technology. Accessed January 15, 2021. http://resolver.tudelft.nl/uuid:bb4426a9-69c3-4c72-a96a-7d472735badf ; urn:NBN:nl:ui:24-uuid:bb4426a9-69c3-4c72-a96a-7d472735badf ; urn:NBN:nl:ui:24-uuid:bb4426a9-69c3-4c72-a96a-7d472735badf ; http://resolver.tudelft.nl/uuid:bb4426a9-69c3-4c72-a96a-7d472735badf.

MLA Handbook (7^th Edition):

Tang, S. “Information Propagation in Peer-to-Peer Networking: Modeling and Empirical Studies.” 2010. Web. 15 Jan 2021.

Vancouver:

Tang S. Information Propagation in Peer-to-Peer Networking: Modeling and Empirical Studies. [Internet] [Doctoral dissertation]. Delft University of Technology; 2010. [cited 2021 Jan 15]. Available from: http://resolver.tudelft.nl/uuid:bb4426a9-69c3-4c72-a96a-7d472735badf ; urn:NBN:nl:ui:24-uuid:bb4426a9-69c3-4c72-a96a-7d472735badf ; urn:NBN:nl:ui:24-uuid:bb4426a9-69c3-4c72-a96a-7d472735badf ; http://resolver.tudelft.nl/uuid:bb4426a9-69c3-4c72-a96a-7d472735badf.

Council of Science Editors:

Tang S. Information Propagation in Peer-to-Peer Networking: Modeling and Empirical Studies. [Doctoral Dissertation]. Delft University of Technology; 2010. Available from: http://resolver.tudelft.nl/uuid:bb4426a9-69c3-4c72-a96a-7d472735badf ; urn:NBN:nl:ui:24-uuid:bb4426a9-69c3-4c72-a96a-7d472735badf ; urn:NBN:nl:ui:24-uuid:bb4426a9-69c3-4c72-a96a-7d472735badf ; http://resolver.tudelft.nl/uuid:bb4426a9-69c3-4c72-a96a-7d472735badf

Delft University of Technology

8. Beshir, A.A. Survivability and Impairment-aware Routing in Optical Networks: An Algorithmic Study.

Degree: 2011, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:bd322e9c-5354-4f0a-b922-037e5f6c2bc1 ; urn:NBN:nl:ui:24-uuid:bd322e9c-5354-4f0a-b922-037e5f6c2bc1 ; urn:NBN:nl:ui:24-uuid:bd322e9c-5354-4f0a-b922-037e5f6c2bc1 ; http://resolver.tudelft.nl/uuid:bd322e9c-5354-4f0a-b922-037e5f6c2bc1

► Optical networks employing Wavelength Division Multiplexing (WDM) technology allow the multiplexing of several independent wavelength channels into a fiber. Since each wavelength channel operates independently… (more)

▼ Optical networks employing Wavelength Division Multiplexing (WDM) technology allow the multiplexing of several independent wavelength channels into a fiber. Since each wavelength channel operates independently at several Gb/s, WDM optical networks offer a tremendous transport capacity (which is in the order of several Tb/s), which makes them suitable candidates for future networks. A lightpath is made up of wavelength channels between the source and destination nodes to transfer a large amount of data. Routing in WDM networks involves assigning both paths and wavelengths, and is called routing and wavelength assignment (RWA). In WDM optical networks, there are two vital RWA issues that have garnered a lot of interest from researchers as well as network operators. 1) Survivability: Lightpaths in WDM networks usually transport a tremendous amount of data. If a lightpath fails due to various natural or man-made disasters, the data loss can be costly. Hence, survivability, which is the ability to reconfigure and resume communication is indispensable. 2) Impairment-aware routing: As an optical signal traverses its path, it encounters noise and signal distortions along its way. These physical impairments cause bit errors, which may make the signal unrecognizable at the receiving end. In order to reverse the effect of physical impairments, the signal needs to be regenerated at intermediate nodes. Unlike traditional RWA, impairment-aware RWA, takes into account the effect of physical impairments. Impairment-aware RWA entails two important issues: a) Impairment-aware path selection: how to find a feasible path from the source to the destination node? b) Regenerators placement: how many regenerators are required and where to place them in the network? The main focus of this thesis is to study various problems associated with survivability and impairment-aware RWA both in intra-domain (i.e., within in a single domain) and inter-domain (i.e., across domains) WDM networks. Especially, for intra-domain networks, it makes a detailed study of survivable and impairment-aware RWA issues, separately or combined. For the various problems studied in this thesis, the complexity of the problems is analyzed in detail, and accordingly exact, approximation or heuristic algorithms are proposed for solving them. In addition, a case study of survivable and impairment-aware routing is made on a realistic network that connects research and educational institutes in the Netherlands using data obtained from the network. The work done in this thesis will not only help us gain insight into the various problems in WDM networks, but it may also be applicable to corresponding problems in other types of networks, or even to problems in other areas. Advisors/Committee Members: F.A.%22%29&pagesize-30">Van Mieghem, P.F.A..

Subjects/Keywords: Optical Networks; Wavelength Division Multiplexing; Survivable Routing; Impairment-aware Routing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Beshir, A. A. (2011). Survivability and Impairment-aware Routing in Optical Networks: An Algorithmic Study. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:bd322e9c-5354-4f0a-b922-037e5f6c2bc1 ; urn:NBN:nl:ui:24-uuid:bd322e9c-5354-4f0a-b922-037e5f6c2bc1 ; urn:NBN:nl:ui:24-uuid:bd322e9c-5354-4f0a-b922-037e5f6c2bc1 ; http://resolver.tudelft.nl/uuid:bd322e9c-5354-4f0a-b922-037e5f6c2bc1

Chicago Manual of Style (16^th Edition):

Beshir, A A. “Survivability and Impairment-aware Routing in Optical Networks: An Algorithmic Study.” 2011. Doctoral Dissertation, Delft University of Technology. Accessed January 15, 2021. http://resolver.tudelft.nl/uuid:bd322e9c-5354-4f0a-b922-037e5f6c2bc1 ; urn:NBN:nl:ui:24-uuid:bd322e9c-5354-4f0a-b922-037e5f6c2bc1 ; urn:NBN:nl:ui:24-uuid:bd322e9c-5354-4f0a-b922-037e5f6c2bc1 ; http://resolver.tudelft.nl/uuid:bd322e9c-5354-4f0a-b922-037e5f6c2bc1.

MLA Handbook (7^th Edition):

Beshir, A A. “Survivability and Impairment-aware Routing in Optical Networks: An Algorithmic Study.” 2011. Web. 15 Jan 2021.

Vancouver:

Beshir AA. Survivability and Impairment-aware Routing in Optical Networks: An Algorithmic Study. [Internet] [Doctoral dissertation]. Delft University of Technology; 2011. [cited 2021 Jan 15]. Available from: http://resolver.tudelft.nl/uuid:bd322e9c-5354-4f0a-b922-037e5f6c2bc1 ; urn:NBN:nl:ui:24-uuid:bd322e9c-5354-4f0a-b922-037e5f6c2bc1 ; urn:NBN:nl:ui:24-uuid:bd322e9c-5354-4f0a-b922-037e5f6c2bc1 ; http://resolver.tudelft.nl/uuid:bd322e9c-5354-4f0a-b922-037e5f6c2bc1.

Council of Science Editors:

Beshir AA. Survivability and Impairment-aware Routing in Optical Networks: An Algorithmic Study. [Doctoral Dissertation]. Delft University of Technology; 2011. Available from: http://resolver.tudelft.nl/uuid:bd322e9c-5354-4f0a-b922-037e5f6c2bc1 ; urn:NBN:nl:ui:24-uuid:bd322e9c-5354-4f0a-b922-037e5f6c2bc1 ; urn:NBN:nl:ui:24-uuid:bd322e9c-5354-4f0a-b922-037e5f6c2bc1 ; http://resolver.tudelft.nl/uuid:bd322e9c-5354-4f0a-b922-037e5f6c2bc1

Delft University of Technology

9. Janic, M. Multicast in Network and Application Layer.

Degree: 2005, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:ef9441e1-31b9-4be3-acd6-8c4569cbe90f ; urn:NBN:nl:ui:24-uuid:ef9441e1-31b9-4be3-acd6-8c4569cbe90f ; urn:NBN:nl:ui:24-uuid:ef9441e1-31b9-4be3-acd6-8c4569cbe90f ; http://resolver.tudelft.nl/uuid:ef9441e1-31b9-4be3-acd6-8c4569cbe90f

Subjects/Keywords: IP multicast; Application Layer multicast; Shortest Path Tree; Steiner Minimum Tree; traceroute

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Janic, M. (2005). Multicast in Network and Application Layer. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:ef9441e1-31b9-4be3-acd6-8c4569cbe90f ; urn:NBN:nl:ui:24-uuid:ef9441e1-31b9-4be3-acd6-8c4569cbe90f ; urn:NBN:nl:ui:24-uuid:ef9441e1-31b9-4be3-acd6-8c4569cbe90f ; http://resolver.tudelft.nl/uuid:ef9441e1-31b9-4be3-acd6-8c4569cbe90f

Chicago Manual of Style (16^th Edition):

Janic, M. “Multicast in Network and Application Layer.” 2005. Doctoral Dissertation, Delft University of Technology. Accessed January 15, 2021. http://resolver.tudelft.nl/uuid:ef9441e1-31b9-4be3-acd6-8c4569cbe90f ; urn:NBN:nl:ui:24-uuid:ef9441e1-31b9-4be3-acd6-8c4569cbe90f ; urn:NBN:nl:ui:24-uuid:ef9441e1-31b9-4be3-acd6-8c4569cbe90f ; http://resolver.tudelft.nl/uuid:ef9441e1-31b9-4be3-acd6-8c4569cbe90f.

MLA Handbook (7^th Edition):

Janic, M. “Multicast in Network and Application Layer.” 2005. Web. 15 Jan 2021.

Vancouver:

Janic M. Multicast in Network and Application Layer. [Internet] [Doctoral dissertation]. Delft University of Technology; 2005. [cited 2021 Jan 15]. Available from: http://resolver.tudelft.nl/uuid:ef9441e1-31b9-4be3-acd6-8c4569cbe90f ; urn:NBN:nl:ui:24-uuid:ef9441e1-31b9-4be3-acd6-8c4569cbe90f ; urn:NBN:nl:ui:24-uuid:ef9441e1-31b9-4be3-acd6-8c4569cbe90f ; http://resolver.tudelft.nl/uuid:ef9441e1-31b9-4be3-acd6-8c4569cbe90f.

Council of Science Editors:

Janic M. Multicast in Network and Application Layer. [Doctoral Dissertation]. Delft University of Technology; 2005. Available from: http://resolver.tudelft.nl/uuid:ef9441e1-31b9-4be3-acd6-8c4569cbe90f ; urn:NBN:nl:ui:24-uuid:ef9441e1-31b9-4be3-acd6-8c4569cbe90f ; urn:NBN:nl:ui:24-uuid:ef9441e1-31b9-4be3-acd6-8c4569cbe90f ; http://resolver.tudelft.nl/uuid:ef9441e1-31b9-4be3-acd6-8c4569cbe90f

Delft University of Technology

10. van Adrichem, N.L.M. Resilience and Application Deployment in Software-Defined Networks.

Degree: 2017, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:318d88af-e25e-4a7e-8d37-18770fe980c4 ; urn:NBN:nl:ui:24-uuid:318d88af-e25e-4a7e-8d37-18770fe980c4 ; 318d88af-e25e-4a7e-8d37-18770fe980c4 ; 10.4233/uuid:318d88af-e25e-4a7e-8d37-18770fe980c4 ; urn:isbn:978-94-6186-784-1 ; urn:NBN:nl:ui:24-uuid:318d88af-e25e-4a7e-8d37-18770fe980c4 ; http://resolver.tudelft.nl/uuid:318d88af-e25e-4a7e-8d37-18770fe980c4

► In the past century, numerous iterations of automation have changed our society significantly. In that perspective, the professional and personal availability of computing devices interconnected… (more)

▼ In the past century, numerous iterations of automation have changed our society significantly. In that perspective, the professional and personal availability of computing devices interconnected through the Internet has changed the way we eat, live and treat each other. Today, the Internet is a service as crucial to our society as public access to electricity, gas and water supplies. Due to its successful adoption, the Internet now serves applications that were unthinkable at the time of its initial designs when social media, online global market places and video streaming were still far out of reasonable imaginary reach. Early research initiatives worked on realizing a global network of interconnected computers, an aim clearly realized by the successful implementation of the Internet and the fact that the infrastructure still suffices to provide connectivity to an unforeseen growth and change in usage. The research field of future Internet aims at long-term improvements of the Internet architecture, trying to improve the network infrastructure such that it will also facilitate future growth and applications. In this dissertation, we have contributed to the field of future Internet by proposing, implementing and evaluating infrastructure improvements. Most of our work revolves around Software-Defined Networking (SDN), a network management architecture aiming at logical centralization and softwarization of network control through the separation of data plane and control plane functionality. In particular, we have assessed the feasibility and accuracy of network monitoring through SDN (see chapter 3), as well as contributed to the robustness and recovery of such networks under topology failure by speeding up failure detection and recovery (see chapter 4) and precomputation of network-wide per-failure protection paths (see chapter 5). In addition to SDN, we have contributed to Information-Centric Networking (ICN), a network architecture optimizing content distribution by implementing network-layer forwarding techniques and cache-placement strategies based on content identifiers. We have contributed to this field by introducing a globally-accessible namespace maintaining a feasible global-routing-table size through separation and translation of context-related and location-aggregated name components (see chapter 6). Considering the same demand for centralization and softwarization of network control found in SDN applies to other network architectures, we have designed a protocol-agnostic SDN scheme enabling fine-grained control of application-specific forwarding schemes. With our prototype, we evaluate an implementation of such an SDN-controlled ICN, demonstrating correct functionality in both partial and fully upgraded networks (see chapter 7). Besides working on future Internet topics, we have also taken a step aside and looked at more recent Internet architecture improvements. Specifically, we have performed measurements on the Domain Name System’s Security Extensions (DNSSEC). From these… Advisors/Committee Members: F.A.%22%29&pagesize-30">Van Mieghem, P.F.A., Kuipers, F.A..

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

van Adrichem, N. L. M. (2017). Resilience and Application Deployment in Software-Defined Networks. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:318d88af-e25e-4a7e-8d37-18770fe980c4 ; urn:NBN:nl:ui:24-uuid:318d88af-e25e-4a7e-8d37-18770fe980c4 ; 318d88af-e25e-4a7e-8d37-18770fe980c4 ; 10.4233/uuid:318d88af-e25e-4a7e-8d37-18770fe980c4 ; urn:isbn:978-94-6186-784-1 ; urn:NBN:nl:ui:24-uuid:318d88af-e25e-4a7e-8d37-18770fe980c4 ; http://resolver.tudelft.nl/uuid:318d88af-e25e-4a7e-8d37-18770fe980c4

Chicago Manual of Style (16^th Edition):

van Adrichem, N L M. “Resilience and Application Deployment in Software-Defined Networks.” 2017. Doctoral Dissertation, Delft University of Technology. Accessed January 15, 2021. http://resolver.tudelft.nl/uuid:318d88af-e25e-4a7e-8d37-18770fe980c4 ; urn:NBN:nl:ui:24-uuid:318d88af-e25e-4a7e-8d37-18770fe980c4 ; 318d88af-e25e-4a7e-8d37-18770fe980c4 ; 10.4233/uuid:318d88af-e25e-4a7e-8d37-18770fe980c4 ; urn:isbn:978-94-6186-784-1 ; urn:NBN:nl:ui:24-uuid:318d88af-e25e-4a7e-8d37-18770fe980c4 ; http://resolver.tudelft.nl/uuid:318d88af-e25e-4a7e-8d37-18770fe980c4.

MLA Handbook (7^th Edition):

van Adrichem, N L M. “Resilience and Application Deployment in Software-Defined Networks.” 2017. Web. 15 Jan 2021.

Vancouver:

van Adrichem NLM. Resilience and Application Deployment in Software-Defined Networks. [Internet] [Doctoral dissertation]. Delft University of Technology; 2017. [cited 2021 Jan 15]. Available from: http://resolver.tudelft.nl/uuid:318d88af-e25e-4a7e-8d37-18770fe980c4 ; urn:NBN:nl:ui:24-uuid:318d88af-e25e-4a7e-8d37-18770fe980c4 ; 318d88af-e25e-4a7e-8d37-18770fe980c4 ; 10.4233/uuid:318d88af-e25e-4a7e-8d37-18770fe980c4 ; urn:isbn:978-94-6186-784-1 ; urn:NBN:nl:ui:24-uuid:318d88af-e25e-4a7e-8d37-18770fe980c4 ; http://resolver.tudelft.nl/uuid:318d88af-e25e-4a7e-8d37-18770fe980c4.

Council of Science Editors:

van Adrichem NLM. Resilience and Application Deployment in Software-Defined Networks. [Doctoral Dissertation]. Delft University of Technology; 2017. Available from: http://resolver.tudelft.nl/uuid:318d88af-e25e-4a7e-8d37-18770fe980c4 ; urn:NBN:nl:ui:24-uuid:318d88af-e25e-4a7e-8d37-18770fe980c4 ; 318d88af-e25e-4a7e-8d37-18770fe980c4 ; 10.4233/uuid:318d88af-e25e-4a7e-8d37-18770fe980c4 ; urn:isbn:978-94-6186-784-1 ; urn:NBN:nl:ui:24-uuid:318d88af-e25e-4a7e-8d37-18770fe980c4 ; http://resolver.tudelft.nl/uuid:318d88af-e25e-4a7e-8d37-18770fe980c4

Delft University of Technology

11. Meier, J.M. The Relation Between Structure and Function in Brain Networks: A network science perspective.

Degree: 2017, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; urn:NBN:nl:ui:24-uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; 31b25b38-45e9-4469-810b-79fe19905a4d ; 10.4233/uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; urn:isbn:978-94-028-0638-0 ; urn:NBN:nl:ui:24-uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; http://resolver.tudelft.nl/uuid:31b25b38-45e9-4469-810b-79fe19905a4d

► Over the last two decades the field of network science has been evolving fast. Many useful applications in a wide variety of disciplines have been… (more)

▼ Over the last two decades the field of network science has been evolving fast. Many useful applications in a wide variety of disciplines have been found. The application of network science to the brain initiated the interdisciplinary field of complex brain networks. On a macroscopic level, brain regions are taken as nodes in a network. The analysis of pairwise connections between the brain regions as links has provided a new perspective on many problems. The application of network science to neuroscience data helped, for example, to identify the disruptions due to different neurological disorders when comparing healthy and abnormal brain networks. In this dissertation, we focus on the macroscopic level of brain regions and analyze their pairwise connections from a network science perspective. We address different general research questions from network science and exploit their application possibilities towards brain networks. Due to different measurement techniques, one can construct many different representations of brain networks. We thereby distinguish between the structural and functional brain network. Structural brain networks map the anatomical connections between the regions, which we could interpret as the ’streets’ of the brain. On top of these streets, we can measure the traffic with techniques like e.g. magnetoencephalography (MEG) or functional Magnetic Resonance Imaging (fMRI) resulting in so-called functional brain networks. However, the relation between the structural and the functional brain networks is still insufficiently understood. The first main research question of this dissertation focuses on the functional network layer and tries to identify the most important links and motifs of these networks. For this purpose, we propose the union of shortest path trees (USPT) as a new sampling method extracting all the shortest paths of a network (Chapter 2 and 3). After constructing the USPT, we compare the individual functional brain networks of multiple sclerosis patients and healthy controls (Chapter 2). Furthermore, we generalize this sampling method and present a new ranking of all the links based on the USPT (Chapter 3). Regarding the higher-order building blocks of the functional brain networks, we analyze the so-called information flow motifs based on MEG data from different frequency bands (Chapter 4). After researching the local properties of the functional brain networks, we analyze the influence of the underlying structural connections on the emerging information flow. Thus, the second main research question concerns the relationship between the functional and the underlying structural connectivity. Specifically, we analyze which topological properties of the structural networks drive the functional interactions. First, this question is approached in a mathematical and straightforward manner by assuming that an analytic function between the two networks exists (Chapter 5). We investigate this mapping function and its reverse by evaluating empirical individual and group-averaged multimodal… Advisors/Committee Members: F.A.%22%29&pagesize-30">Van Mieghem, P.F.A., Stam, C.J..

Subjects/Keywords: structural brain networks; functional brain networks; effective connectivity; information flow; network motifs; shortest paths; epidemic spreading model

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Meier, J. M. (2017). The Relation Between Structure and Function in Brain Networks: A network science perspective. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; urn:NBN:nl:ui:24-uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; 31b25b38-45e9-4469-810b-79fe19905a4d ; 10.4233/uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; urn:isbn:978-94-028-0638-0 ; urn:NBN:nl:ui:24-uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; http://resolver.tudelft.nl/uuid:31b25b38-45e9-4469-810b-79fe19905a4d

Chicago Manual of Style (16^th Edition):

Meier, J M. “The Relation Between Structure and Function in Brain Networks: A network science perspective.” 2017. Doctoral Dissertation, Delft University of Technology. Accessed January 15, 2021. http://resolver.tudelft.nl/uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; urn:NBN:nl:ui:24-uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; 31b25b38-45e9-4469-810b-79fe19905a4d ; 10.4233/uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; urn:isbn:978-94-028-0638-0 ; urn:NBN:nl:ui:24-uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; http://resolver.tudelft.nl/uuid:31b25b38-45e9-4469-810b-79fe19905a4d.

MLA Handbook (7^th Edition):

Meier, J M. “The Relation Between Structure and Function in Brain Networks: A network science perspective.” 2017. Web. 15 Jan 2021.

Vancouver:

Meier JM. The Relation Between Structure and Function in Brain Networks: A network science perspective. [Internet] [Doctoral dissertation]. Delft University of Technology; 2017. [cited 2021 Jan 15]. Available from: http://resolver.tudelft.nl/uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; urn:NBN:nl:ui:24-uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; 31b25b38-45e9-4469-810b-79fe19905a4d ; 10.4233/uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; urn:isbn:978-94-028-0638-0 ; urn:NBN:nl:ui:24-uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; http://resolver.tudelft.nl/uuid:31b25b38-45e9-4469-810b-79fe19905a4d.

Council of Science Editors:

Meier JM. The Relation Between Structure and Function in Brain Networks: A network science perspective. [Doctoral Dissertation]. Delft University of Technology; 2017. Available from: http://resolver.tudelft.nl/uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; urn:NBN:nl:ui:24-uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; 31b25b38-45e9-4469-810b-79fe19905a4d ; 10.4233/uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; urn:isbn:978-94-028-0638-0 ; urn:NBN:nl:ui:24-uuid:31b25b38-45e9-4469-810b-79fe19905a4d ; http://resolver.tudelft.nl/uuid:31b25b38-45e9-4469-810b-79fe19905a4d

Delft University of Technology

12. Muhammad Iqbal, M.A.F. Routing and Disaster Awareness in Optical Networks.

Degree: 2016, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:64cd0a44-acc7-49bc-905a-017c4855511a ; urn:NBN:nl:ui:24-uuid:64cd0a44-acc7-49bc-905a-017c4855511a ; 64cd0a44-acc7-49bc-905a-017c4855511a ; 10.4233/uuid:64cd0a44-acc7-49bc-905a-017c4855511a ; urn:isbn:978-94-6186-704-9 ; urn:NBN:nl:ui:24-uuid:64cd0a44-acc7-49bc-905a-017c4855511a ; http://resolver.tudelft.nl/uuid:64cd0a44-acc7-49bc-905a-017c4855511a

► Optical networks facilitate the configurations of high-speed network connections with tremendous bandwidth between the optical switches. Optical switches are interconnected by optical fibers that act… (more)

▼ Optical networks facilitate the configurations of high-speed network connections with tremendous bandwidth between the optical switches. Optical switches are interconnected by optical fibers that act as the mediums in which data are transferred using lightpaths. Due to the importance of optical networks to many societal needs, e.g., the Internet and banking services, network connections must be configured as efficient and reliable as possible. This thesis focus on two important research topics related to the management and survivability of network connections, namely routing and disaster awareness. Routing enables the assignment of the optimal end-to-end path to each network connection, while disaster awareness increases the preparedness of network operators in ensuring that network connections are protected against the adverse impacts of disasters. The first part of the thesis, namely Chapters 2, 3 and 4 relate to the topic of routing, specifically on technology-aware routing, impairment-aware routing and risk-averse routing. Technology-aware routing is required for establishing network connections across multi-domain networks with technology incompatibilities, impairment-aware routing enables network operators to establish network connections in the presence of transmission impairments, and risk-averse routing enables connections to be assigned with the safest paths (against failing due to disasters). The second part of the thesis, namely Chapters 4 and 5 relate to the topic of disaster awareness, by proposing approaches for ensuring the survivability of network connections in the risk of disasters, such as modeling of (spatiotemporal) disasters, identifying vulnerable connections, detecting spatially-close fiber segments, computing spatially-close intervals of spatially close fibers, and grouping spatially-close fibers efficiently. Though the thesis emphasizes on optical network use cases, the provided insights and contributions in each chapter are general enough to be extended for application in other network types as well. Advisors/Committee Members: F.A.%22%29&pagesize-30">Van Mieghem, P.F.A., Kuipers, F.A..

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Muhammad Iqbal, M. A. F. (2016). Routing and Disaster Awareness in Optical Networks. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:64cd0a44-acc7-49bc-905a-017c4855511a ; urn:NBN:nl:ui:24-uuid:64cd0a44-acc7-49bc-905a-017c4855511a ; 64cd0a44-acc7-49bc-905a-017c4855511a ; 10.4233/uuid:64cd0a44-acc7-49bc-905a-017c4855511a ; urn:isbn:978-94-6186-704-9 ; urn:NBN:nl:ui:24-uuid:64cd0a44-acc7-49bc-905a-017c4855511a ; http://resolver.tudelft.nl/uuid:64cd0a44-acc7-49bc-905a-017c4855511a

Chicago Manual of Style (16^th Edition):

Muhammad Iqbal, M A F. “Routing and Disaster Awareness in Optical Networks.” 2016. Doctoral Dissertation, Delft University of Technology. Accessed January 15, 2021. http://resolver.tudelft.nl/uuid:64cd0a44-acc7-49bc-905a-017c4855511a ; urn:NBN:nl:ui:24-uuid:64cd0a44-acc7-49bc-905a-017c4855511a ; 64cd0a44-acc7-49bc-905a-017c4855511a ; 10.4233/uuid:64cd0a44-acc7-49bc-905a-017c4855511a ; urn:isbn:978-94-6186-704-9 ; urn:NBN:nl:ui:24-uuid:64cd0a44-acc7-49bc-905a-017c4855511a ; http://resolver.tudelft.nl/uuid:64cd0a44-acc7-49bc-905a-017c4855511a.

MLA Handbook (7^th Edition):

Muhammad Iqbal, M A F. “Routing and Disaster Awareness in Optical Networks.” 2016. Web. 15 Jan 2021.

Vancouver:

Muhammad Iqbal MAF. Routing and Disaster Awareness in Optical Networks. [Internet] [Doctoral dissertation]. Delft University of Technology; 2016. [cited 2021 Jan 15]. Available from: http://resolver.tudelft.nl/uuid:64cd0a44-acc7-49bc-905a-017c4855511a ; urn:NBN:nl:ui:24-uuid:64cd0a44-acc7-49bc-905a-017c4855511a ; 64cd0a44-acc7-49bc-905a-017c4855511a ; 10.4233/uuid:64cd0a44-acc7-49bc-905a-017c4855511a ; urn:isbn:978-94-6186-704-9 ; urn:NBN:nl:ui:24-uuid:64cd0a44-acc7-49bc-905a-017c4855511a ; http://resolver.tudelft.nl/uuid:64cd0a44-acc7-49bc-905a-017c4855511a.

Council of Science Editors:

Muhammad Iqbal MAF. Routing and Disaster Awareness in Optical Networks. [Doctoral Dissertation]. Delft University of Technology; 2016. Available from: http://resolver.tudelft.nl/uuid:64cd0a44-acc7-49bc-905a-017c4855511a ; urn:NBN:nl:ui:24-uuid:64cd0a44-acc7-49bc-905a-017c4855511a ; 64cd0a44-acc7-49bc-905a-017c4855511a ; 10.4233/uuid:64cd0a44-acc7-49bc-905a-017c4855511a ; urn:isbn:978-94-6186-704-9 ; urn:NBN:nl:ui:24-uuid:64cd0a44-acc7-49bc-905a-017c4855511a ; http://resolver.tudelft.nl/uuid:64cd0a44-acc7-49bc-905a-017c4855511a

Delft University of Technology

13. Van de Bovenkamp, R. Epidemic Processes on Complex Networks: Modelling, Simulation and Algorithms.

Degree: 2015, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:7239014b-2338-4568-9965-23fc5352eb8c ; urn:NBN:nl:ui:24-uuid:7239014b-2338-4568-9965-23fc5352eb8c ; urn:NBN:nl:ui:24-uuid:7239014b-2338-4568-9965-23fc5352eb8c ; http://resolver.tudelft.nl/uuid:7239014b-2338-4568-9965-23fc5352eb8c

► Local interactions on a graph will lead to global dynamic behaviour. In this thesis we focus on two types of dynamic processes on graphs: the… (more)

▼ Local interactions on a graph will lead to global dynamic behaviour. In this thesis we focus on two types of dynamic processes on graphs: the Susceptible-Infected-Susceptilbe (SIS) virus spreading model, and gossip style epidemic algorithms. The largest part of this thesis is devoted to the SIS model. We first introduce the SIS model in chapter 2. Even though the SIS model is a Markov process, and good mathematical tools exist to analyse Markov processes, the exploding state space of the SIS model make many of the standard approaches infeasible. Mean-field approximations and simulations are usually our best bet when trying to solve for the average fraction of infected nodes during an outbreak. We compare two of the mean-field approximations commonly used in literature, and benchmark them against a modified version of the SIS model, the "-SIS model. We show that especially around the epidemic threshold, which separates a regime where the virus dies out quickly from a regime where it stays in the network for a very long time (called the meta-stable state), the two approximations can deviate from the true value. In general, the NIMFA approximation has the upper hand in terms of accuracy. Although the time behaviour of the SIS model is used loosely in the description of the meta-stable state and the epidemic threshold, it has received less attention in research than the average fraction of infected nodes in meta-stable state. In chapter 3 we show that the survival time of an SIS process is exponentially distributed, and derive exact expressions for the average survival time in the complete and the star graph. We also propose a definition of the epidemic threshold using the survival time, and show in the star graph and the complete graph that it is accurate. In general, viruses do not live in isolation. In chapter 4 we show that two viruses competing for the same healthy nodes in a network form a rich dynamic system. If the viruses are prevented from dying out, one will completely dominate the other in terms of the number of infected nodes, but this domination will not last. Even if the dominated virus is down to only a few infected nodes, it will regain strength and eventually dominate the other virus. We compute the average domination time and show that it depends on the number of infected nodes at the start of a domination period. Also, we show that weaker or slower viruses can still dominate their stronger or quicker competitors, but for shorter periods of time. Real world spreading phenomena generally have infection and curing processes that are not well modelled by Poisson processes. In the context of content propagation, for example, it has been shown that human (online) behaviour is bursty: long periods of inactivity are followed by short periods of intense activity. In chapter 5, we analyse the effect of non exponential inter-arrival time distributions on the behaviour of an SIS process using a Weibull distribution. As the exponential distribution is a special case of the Weibull distribution, we can gradually… Advisors/Committee Members: F.A.%22%29&pagesize-30">Van Mieghem, P.F.A., Kuipers, F.A..

Subjects/Keywords: epidemics; SIS model; survival time; gossip algorithms

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Van de Bovenkamp, R. (2015). Epidemic Processes on Complex Networks: Modelling, Simulation and Algorithms. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:7239014b-2338-4568-9965-23fc5352eb8c ; urn:NBN:nl:ui:24-uuid:7239014b-2338-4568-9965-23fc5352eb8c ; urn:NBN:nl:ui:24-uuid:7239014b-2338-4568-9965-23fc5352eb8c ; http://resolver.tudelft.nl/uuid:7239014b-2338-4568-9965-23fc5352eb8c

Chicago Manual of Style (16^th Edition):

Van de Bovenkamp, R. “Epidemic Processes on Complex Networks: Modelling, Simulation and Algorithms.” 2015. Doctoral Dissertation, Delft University of Technology. Accessed January 15, 2021. http://resolver.tudelft.nl/uuid:7239014b-2338-4568-9965-23fc5352eb8c ; urn:NBN:nl:ui:24-uuid:7239014b-2338-4568-9965-23fc5352eb8c ; urn:NBN:nl:ui:24-uuid:7239014b-2338-4568-9965-23fc5352eb8c ; http://resolver.tudelft.nl/uuid:7239014b-2338-4568-9965-23fc5352eb8c.

MLA Handbook (7^th Edition):

Van de Bovenkamp, R. “Epidemic Processes on Complex Networks: Modelling, Simulation and Algorithms.” 2015. Web. 15 Jan 2021.

Vancouver:

Van de Bovenkamp R. Epidemic Processes on Complex Networks: Modelling, Simulation and Algorithms. [Internet] [Doctoral dissertation]. Delft University of Technology; 2015. [cited 2021 Jan 15]. Available from: http://resolver.tudelft.nl/uuid:7239014b-2338-4568-9965-23fc5352eb8c ; urn:NBN:nl:ui:24-uuid:7239014b-2338-4568-9965-23fc5352eb8c ; urn:NBN:nl:ui:24-uuid:7239014b-2338-4568-9965-23fc5352eb8c ; http://resolver.tudelft.nl/uuid:7239014b-2338-4568-9965-23fc5352eb8c.

Council of Science Editors:

Van de Bovenkamp R. Epidemic Processes on Complex Networks: Modelling, Simulation and Algorithms. [Doctoral Dissertation]. Delft University of Technology; 2015. Available from: http://resolver.tudelft.nl/uuid:7239014b-2338-4568-9965-23fc5352eb8c ; urn:NBN:nl:ui:24-uuid:7239014b-2338-4568-9965-23fc5352eb8c ; urn:NBN:nl:ui:24-uuid:7239014b-2338-4568-9965-23fc5352eb8c ; http://resolver.tudelft.nl/uuid:7239014b-2338-4568-9965-23fc5352eb8c

Delft University of Technology

14. Li, C. Characterization and Design of Complex Networks.

Degree: 2014, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:c3a4b57e-8679-4393-a78e-7a8658f62090 ; urn:NBN:nl:ui:24-uuid:c3a4b57e-8679-4393-a78e-7a8658f62090 ; urn:NBN:nl:ui:24-uuid:c3a4b57e-8679-4393-a78e-7a8658f62090 ; http://resolver.tudelft.nl/uuid:c3a4b57e-8679-4393-a78e-7a8658f62090

Subjects/Keywords: complex networks; network metrics; spectral metrics; metric correlations; eigen-values/eigenvectors; epidemic threshold; brain networks; opinion model; network design

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Li, C. (2014). Characterization and Design of Complex Networks. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:c3a4b57e-8679-4393-a78e-7a8658f62090 ; urn:NBN:nl:ui:24-uuid:c3a4b57e-8679-4393-a78e-7a8658f62090 ; urn:NBN:nl:ui:24-uuid:c3a4b57e-8679-4393-a78e-7a8658f62090 ; http://resolver.tudelft.nl/uuid:c3a4b57e-8679-4393-a78e-7a8658f62090

Chicago Manual of Style (16^th Edition):

Li, C. “Characterization and Design of Complex Networks.” 2014. Doctoral Dissertation, Delft University of Technology. Accessed January 15, 2021. http://resolver.tudelft.nl/uuid:c3a4b57e-8679-4393-a78e-7a8658f62090 ; urn:NBN:nl:ui:24-uuid:c3a4b57e-8679-4393-a78e-7a8658f62090 ; urn:NBN:nl:ui:24-uuid:c3a4b57e-8679-4393-a78e-7a8658f62090 ; http://resolver.tudelft.nl/uuid:c3a4b57e-8679-4393-a78e-7a8658f62090.

MLA Handbook (7^th Edition):

Li, C. “Characterization and Design of Complex Networks.” 2014. Web. 15 Jan 2021.

Vancouver:

Li C. Characterization and Design of Complex Networks. [Internet] [Doctoral dissertation]. Delft University of Technology; 2014. [cited 2021 Jan 15]. Available from: http://resolver.tudelft.nl/uuid:c3a4b57e-8679-4393-a78e-7a8658f62090 ; urn:NBN:nl:ui:24-uuid:c3a4b57e-8679-4393-a78e-7a8658f62090 ; urn:NBN:nl:ui:24-uuid:c3a4b57e-8679-4393-a78e-7a8658f62090 ; http://resolver.tudelft.nl/uuid:c3a4b57e-8679-4393-a78e-7a8658f62090.

Council of Science Editors:

Li C. Characterization and Design of Complex Networks. [Doctoral Dissertation]. Delft University of Technology; 2014. Available from: http://resolver.tudelft.nl/uuid:c3a4b57e-8679-4393-a78e-7a8658f62090 ; urn:NBN:nl:ui:24-uuid:c3a4b57e-8679-4393-a78e-7a8658f62090 ; urn:NBN:nl:ui:24-uuid:c3a4b57e-8679-4393-a78e-7a8658f62090 ; http://resolver.tudelft.nl/uuid:c3a4b57e-8679-4393-a78e-7a8658f62090

Delft University of Technology

15. Blenn, N. Content Propagation in Online Social Networks.

Degree: 2014, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:bf5e9273-c503-448d-8358-62cb2d168f28 ; urn:NBN:nl:ui:24-uuid:bf5e9273-c503-448d-8358-62cb2d168f28 ; urn:NBN:nl:ui:24-uuid:bf5e9273-c503-448d-8358-62cb2d168f28 ; http://resolver.tudelft.nl/uuid:bf5e9273-c503-448d-8358-62cb2d168f28

► This thesis presents methods and techniques to analyze content propagation within online social networks (OSNs) using a graph theoretical approach. Important factors and different techniques… (more)

▼ This thesis presents methods and techniques to analyze content propagation within online social networks (OSNs) using a graph theoretical approach. Important factors and different techniques to analyze and describe content propagation, starting from the smallest entity in a network, representing a user-account, up to complete friendship graphs and traces of content are described. All individuals and their attributes are stating the basic elements for statistical analysis of user behavior and individuals interests. When trying to identify the opinion of the population of a country for example, a random sample or data from everyone within the population is needed, a task which is not trivial because of different activity patterns and the fact that individuals may either do not provide information about themselves or obscure their data by supplying bogus information. This thesis shows that obtaining a random sample of the population of the Netherlands is possible in terms of certain parameters like the location, family and first names of users. Such a sample is likely not to be “random” in terms of the age of inhabitants and the usage of gathered data in order to predict the outcome of elections may be questioned. The representation of an individual's view onto an OSN is called an ego-centric network. It contains all friends and relations between friends of an ego within a sub-graph. Within such graphs, the influence between friends can be estimated improving the usability of recommendation systems which also raises concerns about the privacy of users. This thesis describes possibilities to reconstruct private information of a user if only a few friends of the individual share their data publicly because most friendships are created between persons having similar interests. Therefore the current way of dealing with privacy concerns, by enabling users to protect their data, is not sufficient. The structure of ego-centric networks also unveils the ability of egos to spread and control the spread of information as a person completely embedded in a group has less control over disseminating content than a person connecting multiple groups. A snapshot of a whole network of an OSN includes all user-accounts (nodes) and friendships (links) at a certain point in time. But as OSNs may contain millions of nodes the process of obtaining data by crawling is likely to be skewed depending on the used method and duration. Therefore a new way of traversing the graph called “Mutual Friend Crawling” is proposed in which certain network metrics converge faster to the final value by also detecting communities of users while traversing the graph. When analyzing the diffusion process of content in multiple OSNs, only a limited fraction of the neighbors of a user (i.e. friends) are ”useful” in terms of spreading content to their peers. Commonly used network metrics which reflect the centrality of a node are shown to have no correlation with the ability to repeatedly succeed in passing messages to a high number of users. The reason lies in the… Advisors/Committee Members: F.A.%22%29&pagesize-30">Van Mieghem, P.F.A., Doerr, C..

Subjects/Keywords: Online Social Network Analysis

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Blenn, N. (2014). Content Propagation in Online Social Networks. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:bf5e9273-c503-448d-8358-62cb2d168f28 ; urn:NBN:nl:ui:24-uuid:bf5e9273-c503-448d-8358-62cb2d168f28 ; urn:NBN:nl:ui:24-uuid:bf5e9273-c503-448d-8358-62cb2d168f28 ; http://resolver.tudelft.nl/uuid:bf5e9273-c503-448d-8358-62cb2d168f28

Chicago Manual of Style (16^th Edition):

Blenn, N. “Content Propagation in Online Social Networks.” 2014. Doctoral Dissertation, Delft University of Technology. Accessed January 15, 2021. http://resolver.tudelft.nl/uuid:bf5e9273-c503-448d-8358-62cb2d168f28 ; urn:NBN:nl:ui:24-uuid:bf5e9273-c503-448d-8358-62cb2d168f28 ; urn:NBN:nl:ui:24-uuid:bf5e9273-c503-448d-8358-62cb2d168f28 ; http://resolver.tudelft.nl/uuid:bf5e9273-c503-448d-8358-62cb2d168f28.

MLA Handbook (7^th Edition):

Blenn, N. “Content Propagation in Online Social Networks.” 2014. Web. 15 Jan 2021.

Vancouver:

Blenn N. Content Propagation in Online Social Networks. [Internet] [Doctoral dissertation]. Delft University of Technology; 2014. [cited 2021 Jan 15]. Available from: http://resolver.tudelft.nl/uuid:bf5e9273-c503-448d-8358-62cb2d168f28 ; urn:NBN:nl:ui:24-uuid:bf5e9273-c503-448d-8358-62cb2d168f28 ; urn:NBN:nl:ui:24-uuid:bf5e9273-c503-448d-8358-62cb2d168f28 ; http://resolver.tudelft.nl/uuid:bf5e9273-c503-448d-8358-62cb2d168f28.

Council of Science Editors:

Blenn N. Content Propagation in Online Social Networks. [Doctoral Dissertation]. Delft University of Technology; 2014. Available from: http://resolver.tudelft.nl/uuid:bf5e9273-c503-448d-8358-62cb2d168f28 ; urn:NBN:nl:ui:24-uuid:bf5e9273-c503-448d-8358-62cb2d168f28 ; urn:NBN:nl:ui:24-uuid:bf5e9273-c503-448d-8358-62cb2d168f28 ; http://resolver.tudelft.nl/uuid:bf5e9273-c503-448d-8358-62cb2d168f28

Delft University of Technology

16. Wang, X. Robustness of complex networks: Theory and application.

Degree: 2016, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:c107cc92-d275-45df-ad56-b754e8ead98c ; urn:NBN:nl:ui:24-uuid:c107cc92-d275-45df-ad56-b754e8ead98c ; c107cc92-d275-45df-ad56-b754e8ead98c ; 10.4233/uuid:c107cc92-d275-45df-ad56-b754e8ead98c ; urn:isbn:978-94-6186-775-9 ; urn:NBN:nl:ui:24-uuid:c107cc92-d275-45df-ad56-b754e8ead98c ; http://resolver.tudelft.nl/uuid:c107cc92-d275-45df-ad56-b754e8ead98c

► Failures of networks, such as power outages in power systems, congestions in transportation networks, paralyse our daily life and introduce a tremendous cascading effect on… (more)

Subjects/Keywords: Complex Networks; Robustness of Networks; Graph Spectra; Power Grids; Metro Networks; Line Graph; Eigenvectors/Eigenvalues; Interdependent Networks

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Wang, X. (2016). Robustness of complex networks: Theory and application. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:c107cc92-d275-45df-ad56-b754e8ead98c ; urn:NBN:nl:ui:24-uuid:c107cc92-d275-45df-ad56-b754e8ead98c ; c107cc92-d275-45df-ad56-b754e8ead98c ; 10.4233/uuid:c107cc92-d275-45df-ad56-b754e8ead98c ; urn:isbn:978-94-6186-775-9 ; urn:NBN:nl:ui:24-uuid:c107cc92-d275-45df-ad56-b754e8ead98c ; http://resolver.tudelft.nl/uuid:c107cc92-d275-45df-ad56-b754e8ead98c

Chicago Manual of Style (16^th Edition):

Wang, X. “Robustness of complex networks: Theory and application.” 2016. Doctoral Dissertation, Delft University of Technology. Accessed January 15, 2021. http://resolver.tudelft.nl/uuid:c107cc92-d275-45df-ad56-b754e8ead98c ; urn:NBN:nl:ui:24-uuid:c107cc92-d275-45df-ad56-b754e8ead98c ; c107cc92-d275-45df-ad56-b754e8ead98c ; 10.4233/uuid:c107cc92-d275-45df-ad56-b754e8ead98c ; urn:isbn:978-94-6186-775-9 ; urn:NBN:nl:ui:24-uuid:c107cc92-d275-45df-ad56-b754e8ead98c ; http://resolver.tudelft.nl/uuid:c107cc92-d275-45df-ad56-b754e8ead98c.

MLA Handbook (7^th Edition):

Wang, X. “Robustness of complex networks: Theory and application.” 2016. Web. 15 Jan 2021.

Vancouver:

Wang X. Robustness of complex networks: Theory and application. [Internet] [Doctoral dissertation]. Delft University of Technology; 2016. [cited 2021 Jan 15]. Available from: http://resolver.tudelft.nl/uuid:c107cc92-d275-45df-ad56-b754e8ead98c ; urn:NBN:nl:ui:24-uuid:c107cc92-d275-45df-ad56-b754e8ead98c ; c107cc92-d275-45df-ad56-b754e8ead98c ; 10.4233/uuid:c107cc92-d275-45df-ad56-b754e8ead98c ; urn:isbn:978-94-6186-775-9 ; urn:NBN:nl:ui:24-uuid:c107cc92-d275-45df-ad56-b754e8ead98c ; http://resolver.tudelft.nl/uuid:c107cc92-d275-45df-ad56-b754e8ead98c.

Council of Science Editors:

Wang X. Robustness of complex networks: Theory and application. [Doctoral Dissertation]. Delft University of Technology; 2016. Available from: http://resolver.tudelft.nl/uuid:c107cc92-d275-45df-ad56-b754e8ead98c ; urn:NBN:nl:ui:24-uuid:c107cc92-d275-45df-ad56-b754e8ead98c ; c107cc92-d275-45df-ad56-b754e8ead98c ; 10.4233/uuid:c107cc92-d275-45df-ad56-b754e8ead98c ; urn:isbn:978-94-6186-775-9 ; urn:NBN:nl:ui:24-uuid:c107cc92-d275-45df-ad56-b754e8ead98c ; http://resolver.tudelft.nl/uuid:c107cc92-d275-45df-ad56-b754e8ead98c

Delft University of Technology

17. Yang, S. Routing in Optical and Stochastic Networks.

Degree: 2015, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:e31a01c0-f549-48c2-bc5b-b03dcc0f2bf2 ; urn:NBN:nl:ui:24-uuid:e31a01c0-f549-48c2-bc5b-b03dcc0f2bf2 ; urn:NBN:nl:ui:24-uuid:e31a01c0-f549-48c2-bc5b-b03dcc0f2bf2 ; http://resolver.tudelft.nl/uuid:e31a01c0-f549-48c2-bc5b-b03dcc0f2bf2

► In most types of networks (e.g., optical or transportation networks), finding one or more best paths from a source to a destination, is one of… (more)

▼ In most types of networks (e.g., optical or transportation networks), finding one or more best paths from a source to a destination, is one of the biggest concerns of network users and providers. This process is known as routing. The routing problems differ accordingly depending on different application scenarios with their respective routing goals. For example, in the field of data communication networks, with many communication applications emerging (such as Cloud Computing, Internet Protocol Television (IPTV), Video-On-Demand), finding optimum routing paths has been considered in the bandwidth-limited network or when it is expensive to increase the capacity of the existing hardware. Moreover, for network providers, the Service Level Agreements (SLA) determine the level of service that is promised to the network user. The routing problems should also incorporate these SLAs (e.g., connection availability). The energy consumption of the data communication networks is another example, due to its impact on the environment (e.g., green house effect). Energy-aware routings have been considered as one approach to efficiently deal with this issue. Apart from that, the network itself is likely to behave in a stochastic manner. For instance, especially in large networks, it is difficult to obtain an accurate view on the link characteristics like bandwidth utilization or latency, because their dynamics are usually of the same order as the time it would take to distribute information on the link state throughout the network. The routing problems become more difficult to solve if the network dynamics have to be considered. This thesis deals with routing problems in two kinds of networks, namely, (1) (deterministic) optical networks and (2) stochastic networks. Optical networks have been widely deployed because of their high capacity, low bit rate, etc. Wavelength Division Multiplexing (WDM) technology enabled optical networks divides the capacity of a fiber into several non-overlapping wavelength channels that can transport data independently. These wavelength channels make up lightpaths, which are used to establish optical connections that may span several fiber links. Chapters 2 and 3 study the energyaware path selection problem in IP-over-WDM optical networks and the energy-efficient network design problem, respectively. In Chapter 4, a more flexible optical network enabled by OFDM technology is introduced, which is here called spectrum-sliced elastic optical path (SLICE) network. In this kind of network, the capacity of a fiber link is divided into a fixed number of (overlapping) low data rate transporting units, which are called subcarriers. Subsequently, Chapter 4 studies the routing problem in SLICE networks. Connection availability, which is defined as the probability that the corresponding connection is available, is a key element of many SLAs. Establishing a path over a connection should obey the availability agreements to avoid the loss of revenue. Chapter 5 studies the availability-based path selection problem. The… Advisors/Committee Members: F.A.%22%29&pagesize-30">Van Mieghem, P.F.A., Kuipers, F.A..

Subjects/Keywords: Routing; Optical Networks; Energy-efficiency; Availability; Survivability; Stochastic Networks; Convex Optimization; Maximum Flow; Min-Cut

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Yang, S. (2015). Routing in Optical and Stochastic Networks. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:e31a01c0-f549-48c2-bc5b-b03dcc0f2bf2 ; urn:NBN:nl:ui:24-uuid:e31a01c0-f549-48c2-bc5b-b03dcc0f2bf2 ; urn:NBN:nl:ui:24-uuid:e31a01c0-f549-48c2-bc5b-b03dcc0f2bf2 ; http://resolver.tudelft.nl/uuid:e31a01c0-f549-48c2-bc5b-b03dcc0f2bf2

Chicago Manual of Style (16^th Edition):

Yang, S. “Routing in Optical and Stochastic Networks.” 2015. Doctoral Dissertation, Delft University of Technology. Accessed January 15, 2021. http://resolver.tudelft.nl/uuid:e31a01c0-f549-48c2-bc5b-b03dcc0f2bf2 ; urn:NBN:nl:ui:24-uuid:e31a01c0-f549-48c2-bc5b-b03dcc0f2bf2 ; urn:NBN:nl:ui:24-uuid:e31a01c0-f549-48c2-bc5b-b03dcc0f2bf2 ; http://resolver.tudelft.nl/uuid:e31a01c0-f549-48c2-bc5b-b03dcc0f2bf2.

MLA Handbook (7^th Edition):

Yang, S. “Routing in Optical and Stochastic Networks.” 2015. Web. 15 Jan 2021.

Vancouver:

Yang S. Routing in Optical and Stochastic Networks. [Internet] [Doctoral dissertation]. Delft University of Technology; 2015. [cited 2021 Jan 15]. Available from: http://resolver.tudelft.nl/uuid:e31a01c0-f549-48c2-bc5b-b03dcc0f2bf2 ; urn:NBN:nl:ui:24-uuid:e31a01c0-f549-48c2-bc5b-b03dcc0f2bf2 ; urn:NBN:nl:ui:24-uuid:e31a01c0-f549-48c2-bc5b-b03dcc0f2bf2 ; http://resolver.tudelft.nl/uuid:e31a01c0-f549-48c2-bc5b-b03dcc0f2bf2.

Council of Science Editors:

Yang S. Routing in Optical and Stochastic Networks. [Doctoral Dissertation]. Delft University of Technology; 2015. Available from: http://resolver.tudelft.nl/uuid:e31a01c0-f549-48c2-bc5b-b03dcc0f2bf2 ; urn:NBN:nl:ui:24-uuid:e31a01c0-f549-48c2-bc5b-b03dcc0f2bf2 ; urn:NBN:nl:ui:24-uuid:e31a01c0-f549-48c2-bc5b-b03dcc0f2bf2 ; http://resolver.tudelft.nl/uuid:e31a01c0-f549-48c2-bc5b-b03dcc0f2bf2

Delft University of Technology

18. Kuipers, F.A. Quality of service routing in the internet; theory, complexity and algorithms.

Degree: 2004, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:b97b2fd9-8fec-4086-a4f4-fb3409db9412 ; urn:NBN:nl:ui:24-uuid:b97b2fd9-8fec-4086-a4f4-fb3409db9412 ; b97b2fd9-8fec-4086-a4f4-fb3409db9412 ; urn:isbn:90-407-2523-3 ; urn:NBN:nl:ui:24-uuid:b97b2fd9-8fec-4086-a4f4-fb3409db9412 ; http://resolver.tudelft.nl/uuid:b97b2fd9-8fec-4086-a4f4-fb3409db9412

Subjects/Keywords: Diss. prom. aan TU Delft

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Kuipers, F. A. (2004). Quality of service routing in the internet; theory, complexity and algorithms. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:b97b2fd9-8fec-4086-a4f4-fb3409db9412 ; urn:NBN:nl:ui:24-uuid:b97b2fd9-8fec-4086-a4f4-fb3409db9412 ; b97b2fd9-8fec-4086-a4f4-fb3409db9412 ; urn:isbn:90-407-2523-3 ; urn:NBN:nl:ui:24-uuid:b97b2fd9-8fec-4086-a4f4-fb3409db9412 ; http://resolver.tudelft.nl/uuid:b97b2fd9-8fec-4086-a4f4-fb3409db9412

Chicago Manual of Style (16^th Edition):

Kuipers, F A. “Quality of service routing in the internet; theory, complexity and algorithms.” 2004. Doctoral Dissertation, Delft University of Technology. Accessed January 15, 2021. http://resolver.tudelft.nl/uuid:b97b2fd9-8fec-4086-a4f4-fb3409db9412 ; urn:NBN:nl:ui:24-uuid:b97b2fd9-8fec-4086-a4f4-fb3409db9412 ; b97b2fd9-8fec-4086-a4f4-fb3409db9412 ; urn:isbn:90-407-2523-3 ; urn:NBN:nl:ui:24-uuid:b97b2fd9-8fec-4086-a4f4-fb3409db9412 ; http://resolver.tudelft.nl/uuid:b97b2fd9-8fec-4086-a4f4-fb3409db9412.

MLA Handbook (7^th Edition):

Kuipers, F A. “Quality of service routing in the internet; theory, complexity and algorithms.” 2004. Web. 15 Jan 2021.

Vancouver:

Kuipers FA. Quality of service routing in the internet; theory, complexity and algorithms. [Internet] [Doctoral dissertation]. Delft University of Technology; 2004. [cited 2021 Jan 15]. Available from: http://resolver.tudelft.nl/uuid:b97b2fd9-8fec-4086-a4f4-fb3409db9412 ; urn:NBN:nl:ui:24-uuid:b97b2fd9-8fec-4086-a4f4-fb3409db9412 ; b97b2fd9-8fec-4086-a4f4-fb3409db9412 ; urn:isbn:90-407-2523-3 ; urn:NBN:nl:ui:24-uuid:b97b2fd9-8fec-4086-a4f4-fb3409db9412 ; http://resolver.tudelft.nl/uuid:b97b2fd9-8fec-4086-a4f4-fb3409db9412.

Council of Science Editors:

Kuipers FA. Quality of service routing in the internet; theory, complexity and algorithms. [Doctoral Dissertation]. Delft University of Technology; 2004. Available from: http://resolver.tudelft.nl/uuid:b97b2fd9-8fec-4086-a4f4-fb3409db9412 ; urn:NBN:nl:ui:24-uuid:b97b2fd9-8fec-4086-a4f4-fb3409db9412 ; b97b2fd9-8fec-4086-a4f4-fb3409db9412 ; urn:isbn:90-407-2523-3 ; urn:NBN:nl:ui:24-uuid:b97b2fd9-8fec-4086-a4f4-fb3409db9412 ; http://resolver.tudelft.nl/uuid:b97b2fd9-8fec-4086-a4f4-fb3409db9412

Delft University of Technology

19. Winterbach, W. Topology of molecular networks.

Degree: 2014, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:863253bb-a341-4445-96fd-4e83dc31baca ; urn:NBN:nl:ui:24-uuid:863253bb-a341-4445-96fd-4e83dc31baca ; urn:NBN:nl:ui:24-uuid:863253bb-a341-4445-96fd-4e83dc31baca ; http://resolver.tudelft.nl/uuid:863253bb-a341-4445-96fd-4e83dc31baca

Subjects/Keywords: graph; network; biology; molecular; disease; robustness

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Winterbach, W. (2014). Topology of molecular networks. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:863253bb-a341-4445-96fd-4e83dc31baca ; urn:NBN:nl:ui:24-uuid:863253bb-a341-4445-96fd-4e83dc31baca ; urn:NBN:nl:ui:24-uuid:863253bb-a341-4445-96fd-4e83dc31baca ; http://resolver.tudelft.nl/uuid:863253bb-a341-4445-96fd-4e83dc31baca

Chicago Manual of Style (16^th Edition):

Winterbach, W. “Topology of molecular networks.” 2014. Doctoral Dissertation, Delft University of Technology. Accessed January 15, 2021. http://resolver.tudelft.nl/uuid:863253bb-a341-4445-96fd-4e83dc31baca ; urn:NBN:nl:ui:24-uuid:863253bb-a341-4445-96fd-4e83dc31baca ; urn:NBN:nl:ui:24-uuid:863253bb-a341-4445-96fd-4e83dc31baca ; http://resolver.tudelft.nl/uuid:863253bb-a341-4445-96fd-4e83dc31baca.

MLA Handbook (7^th Edition):

Winterbach, W. “Topology of molecular networks.” 2014. Web. 15 Jan 2021.

Vancouver:

Winterbach W. Topology of molecular networks. [Internet] [Doctoral dissertation]. Delft University of Technology; 2014. [cited 2021 Jan 15]. Available from: http://resolver.tudelft.nl/uuid:863253bb-a341-4445-96fd-4e83dc31baca ; urn:NBN:nl:ui:24-uuid:863253bb-a341-4445-96fd-4e83dc31baca ; urn:NBN:nl:ui:24-uuid:863253bb-a341-4445-96fd-4e83dc31baca ; http://resolver.tudelft.nl/uuid:863253bb-a341-4445-96fd-4e83dc31baca.

Council of Science Editors:

Winterbach W. Topology of molecular networks. [Doctoral Dissertation]. Delft University of Technology; 2014. Available from: http://resolver.tudelft.nl/uuid:863253bb-a341-4445-96fd-4e83dc31baca ; urn:NBN:nl:ui:24-uuid:863253bb-a341-4445-96fd-4e83dc31baca ; urn:NBN:nl:ui:24-uuid:863253bb-a341-4445-96fd-4e83dc31baca ; http://resolver.tudelft.nl/uuid:863253bb-a341-4445-96fd-4e83dc31baca

Delft University of Technology

20. Wu, J. (author). Evolving Properties of Growing Networks.

Degree: 2009, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:ac67cd08-0c39-49b9-8967-12186175a644

► Complex networks describe a wide range of systems and structures in the world. Any real network can be modeled as graph, expressed by an adjacency… (more)

Subjects/Keywords: complex network

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Wu, J. (. (2009). Evolving Properties of Growing Networks. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:ac67cd08-0c39-49b9-8967-12186175a644

Chicago Manual of Style (16^th Edition):

Wu, J (author). “Evolving Properties of Growing Networks.” 2009. Masters Thesis, Delft University of Technology. Accessed January 15, 2021. http://resolver.tudelft.nl/uuid:ac67cd08-0c39-49b9-8967-12186175a644.

MLA Handbook (7^th Edition):

Wu, J (author). “Evolving Properties of Growing Networks.” 2009. Web. 15 Jan 2021.

Vancouver:

Wu J(. Evolving Properties of Growing Networks. [Internet] [Masters thesis]. Delft University of Technology; 2009. [cited 2021 Jan 15]. Available from: http://resolver.tudelft.nl/uuid:ac67cd08-0c39-49b9-8967-12186175a644.

Council of Science Editors:

Wu J(. Evolving Properties of Growing Networks. [Masters Thesis]. Delft University of Technology; 2009. Available from: http://resolver.tudelft.nl/uuid:ac67cd08-0c39-49b9-8967-12186175a644

Delft University of Technology

21. Liu, Q. Spreading on Networks.

Degree: 2019, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:155cd8db-619f-49f6-a3db-1bdb6036420c ; urn:NBN:nl:ui:24-uuid:155cd8db-619f-49f6-a3db-1bdb6036420c ; 155cd8db-619f-49f6-a3db-1bdb6036420c ; 10.4233/uuid:155cd8db-619f-49f6-a3db-1bdb6036420c ; urn:isbn:978-94-6384-074-3 ; urn:NBN:nl:ui:24-uuid:155cd8db-619f-49f6-a3db-1bdb6036420c ; http://resolver.tudelft.nl/uuid:155cd8db-619f-49f6-a3db-1bdb6036420c

► Spreading phenomena such as spreading of diseases, information and computer viruses are ubiquitous in nature and man-made systems, but the understanding of them is still… (more)

▼ Spreading phenomena such as spreading of diseases, information and computer viruses are ubiquitous in nature and man-made systems, but the understanding of them is still insufficient. This dissertation focuses on the analysis of a basic mathematical model of spreading phenomena running on underlying network structures and aims to complete the basic theory of spreading processes. Specifically, we explore the Susceptible-Infected-Susceptible (SIS) model from several interesting perspectives to contribute to the state-of-the-art understanding of the model. Our first main contribution is related to temporal correlations. In most of the studies, the influence of time in the SIS spreading process is omitted because the specific value of the infection and curing rates does not influence the first-moment metastable properties, such as the infection probability of each node. Only the ratio between the two rates matters. In this dissertation, we show that the temporal correlation can be analyzed with the mean-field approaches, although mean-field methods are meant to only analyze first-moment properties. We derive the autocorrelation of the nodal infection state both in the steady and transient states under the mean-field approximation. By analyzing the autocorrelation, we indicate the influence of the underlying network and the value of the infection and curing rates on the temporal properties of the spreading process. We also show that the infection and curing rates can be calculated by measuring the infection state of each node. Second, we relax the Markovian assumption in the SIS process by extending the Poisson infection process to a Weibull renewal process. The Poisson infection process is just a special case of the Weibullian renewal process. Under this Weibullian framework, we can parameterize the non-Markovian infection behavior and show some new features raised by it. We specifically focus on an extreme (limiting) case of the Weibullian SIS process where the distribution of the infection time is a Dirac delta function. The analysis of the extreme case leads to the largest possible epidemic threshold for non-Poissonian infection processes. We further discuss the epidemic threshold for different infection processes with Weibull, lognormal and Gamma distributed infection time, which fit realistic spreading phenomena well, under a previous non-Markovian mean-field method based on renewal theory. We show consistency between our results and previous theory and that those different infection processes behave similarly. Third, we dive into the localization phenomena in networks from the viewpoint of SIS spreading processes. Localization of the spreading process appears just above the epidemic threshold in networks whose principal eigenvector of the adjacency matrix is localized. In the localized spreading, the prevalence (order parameter), which is the expected fraction of infected nodes, converges to zero with the increase of network size but the number of infected nodes is non-zero. Thus, the… Advisors/Committee Members: F.A.%22%29&pagesize-30">Van Mieghem, P.F.A., Delft University of Technology.

Subjects/Keywords: Spreading Process; Complex Networks; Stochastic Simulation

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Liu, Q. (2019). Spreading on Networks. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:155cd8db-619f-49f6-a3db-1bdb6036420c ; urn:NBN:nl:ui:24-uuid:155cd8db-619f-49f6-a3db-1bdb6036420c ; 155cd8db-619f-49f6-a3db-1bdb6036420c ; 10.4233/uuid:155cd8db-619f-49f6-a3db-1bdb6036420c ; urn:isbn:978-94-6384-074-3 ; urn:NBN:nl:ui:24-uuid:155cd8db-619f-49f6-a3db-1bdb6036420c ; http://resolver.tudelft.nl/uuid:155cd8db-619f-49f6-a3db-1bdb6036420c

Chicago Manual of Style (16^th Edition):

Liu, Q. “Spreading on Networks.” 2019. Doctoral Dissertation, Delft University of Technology. Accessed January 15, 2021. http://resolver.tudelft.nl/uuid:155cd8db-619f-49f6-a3db-1bdb6036420c ; urn:NBN:nl:ui:24-uuid:155cd8db-619f-49f6-a3db-1bdb6036420c ; 155cd8db-619f-49f6-a3db-1bdb6036420c ; 10.4233/uuid:155cd8db-619f-49f6-a3db-1bdb6036420c ; urn:isbn:978-94-6384-074-3 ; urn:NBN:nl:ui:24-uuid:155cd8db-619f-49f6-a3db-1bdb6036420c ; http://resolver.tudelft.nl/uuid:155cd8db-619f-49f6-a3db-1bdb6036420c.

MLA Handbook (7^th Edition):

Liu, Q. “Spreading on Networks.” 2019. Web. 15 Jan 2021.

Vancouver:

Liu Q. Spreading on Networks. [Internet] [Doctoral dissertation]. Delft University of Technology; 2019. [cited 2021 Jan 15]. Available from: http://resolver.tudelft.nl/uuid:155cd8db-619f-49f6-a3db-1bdb6036420c ; urn:NBN:nl:ui:24-uuid:155cd8db-619f-49f6-a3db-1bdb6036420c ; 155cd8db-619f-49f6-a3db-1bdb6036420c ; 10.4233/uuid:155cd8db-619f-49f6-a3db-1bdb6036420c ; urn:isbn:978-94-6384-074-3 ; urn:NBN:nl:ui:24-uuid:155cd8db-619f-49f6-a3db-1bdb6036420c ; http://resolver.tudelft.nl/uuid:155cd8db-619f-49f6-a3db-1bdb6036420c.

Council of Science Editors:

Liu Q. Spreading on Networks. [Doctoral Dissertation]. Delft University of Technology; 2019. Available from: http://resolver.tudelft.nl/uuid:155cd8db-619f-49f6-a3db-1bdb6036420c ; urn:NBN:nl:ui:24-uuid:155cd8db-619f-49f6-a3db-1bdb6036420c ; 155cd8db-619f-49f6-a3db-1bdb6036420c ; 10.4233/uuid:155cd8db-619f-49f6-a3db-1bdb6036420c ; urn:isbn:978-94-6384-074-3 ; urn:NBN:nl:ui:24-uuid:155cd8db-619f-49f6-a3db-1bdb6036420c ; http://resolver.tudelft.nl/uuid:155cd8db-619f-49f6-a3db-1bdb6036420c

Delft University of Technology

22. Maheshwari, D. (author). Robust Offshore Networks for Oil and Gas Facilities.

Degree: MS, 2010, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:9cdfa8d4-ab0e-4776-bbe2-407c4cd6cdf2

► Offshore Communication Networks utilize multiple of communication technologies to eradicate any possibilities of failures, when the network is operational. Offshore Oil and Gas platforms and… (more)

▼ Offshore Communication Networks utilize multiple of communication technologies to eradicate any possibilities of failures, when the network is operational. Offshore Oil and Gas platforms and Wind parks (manned / unmanned) have strict and tight requirements for robust communication. Robustness of communication networks can be evaluated by the analysis of either transmission networks on the physical layer or by the network protocols and techniques run over the transmission network on higher layers. Offshore Oil and Gas facilities aim for continuous production to achieve the desired goals and a robust transmission network is very important to avoid production losses. In general, offshore transmission networks last for longer periods, which means transmission technologies must be robust with maximum availability against repair and replacement time and costs to evade interruptions, especially in catastrophic situations. But in reality a network can face multiple of problems, which can halt or interrupt communication for seconds, minutes, hours and in some cases days. In this thesis, the robustness of offshore transmission networks for Oil and Gas facilities is evaluated for normal and catastrophic situations to avoid maximum disruptions in communication by comparing three technologies (Optical, Microwave LOS, and Satellite communication) in terms of availability, repair and replacement time and costs, and by applying network graph theory to overcome technological differences. The results of the analysis show that the offshore transmission technologies have some predetermined trends, impacts and risks associated with different kind of manmade and natural hazards at different geographic locations, which can be prevented by applying network graph theory with a combination of transmission technologies for both normal as well as catastrophic situations. This thesis highlights the importance of robustness related to repair and replacement time and costs due to catastrophic calamities and will serve offshore industry to make an efficient decision while designing or extending transmission networks for offshore Oil and Gas facilities. p>Master of Science p>Telecommunications p>Electrical Engineering, Mathematics and Computer Sciencep> Advisors/Committee Members: Heijden, F. (mentor), F.A.%22%29&pagesize-30">Van Mieghem, P.F.A. (mentor), Kuipers, F. (mentor).

Subjects/Keywords: Offshore Comunication; Robust transmission networks; Algebraic connectivity

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Maheshwari, D. (. (2010). Robust Offshore Networks for Oil and Gas Facilities. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:9cdfa8d4-ab0e-4776-bbe2-407c4cd6cdf2

Chicago Manual of Style (16^th Edition):

Maheshwari, D (author). “Robust Offshore Networks for Oil and Gas Facilities.” 2010. Masters Thesis, Delft University of Technology. Accessed January 15, 2021. http://resolver.tudelft.nl/uuid:9cdfa8d4-ab0e-4776-bbe2-407c4cd6cdf2.

MLA Handbook (7^th Edition):

Maheshwari, D (author). “Robust Offshore Networks for Oil and Gas Facilities.” 2010. Web. 15 Jan 2021.

Vancouver:

Maheshwari D(. Robust Offshore Networks for Oil and Gas Facilities. [Internet] [Masters thesis]. Delft University of Technology; 2010. [cited 2021 Jan 15]. Available from: http://resolver.tudelft.nl/uuid:9cdfa8d4-ab0e-4776-bbe2-407c4cd6cdf2.

Council of Science Editors:

Maheshwari D(. Robust Offshore Networks for Oil and Gas Facilities. [Masters Thesis]. Delft University of Technology; 2010. Available from: http://resolver.tudelft.nl/uuid:9cdfa8d4-ab0e-4776-bbe2-407c4cd6cdf2

Delft University of Technology

23. Cetinay-Iyicil, H. Analysis and planning of power grids: A network perspective.

Degree: 2018, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:97657389-0ee5-4de7-82b6-6647470160a5 ; urn:NBN:nl:ui:24-uuid:97657389-0ee5-4de7-82b6-6647470160a5 ; 97657389-0ee5-4de7-82b6-6647470160a5 ; 10.4233/uuid:97657389-0ee5-4de7-82b6-6647470160a5 ; urn:isbn:978-94-6186-969-2 ; urn:NBN:nl:ui:24-uuid:97657389-0ee5-4de7-82b6-6647470160a5 ; http://resolver.tudelft.nl/uuid:97657389-0ee5-4de7-82b6-6647470160a5

► Electric power has become an essential part of daily life: we plug our electronic devices in, switch our lights on, and expect to have power.… (more)

▼ Electric power has become an essential part of daily life: we plug our electronic devices in, switch our lights on, and expect to have power. As the availability of power is usually taken for granted in modern societies, we mostly feel annoyed at its absence and perceive the importance of power during outages which have severe effects on the public order. Blackouts have had disastrous consequences for many countries and they continue to occur frequently. Such examples demonstrate the necessity for careful analysis and planning of power grids, to ultimately increase the reliability of power grids. The power grids have evolved due to economic, environmental and human-caused factors. In addition to the contingency analysis, nowadays, the operation and planning of power grids are facing many other challenges (such as demand growth, targeted attacks, cascading failures, and renewable energy integration). Thus, many questions arise, including: which buses (nodes) to connect with a new line (link)? What are the impacts of malicious attacks on power grids? How may an initial failure result in a cascade of failures? How to prepare for the integration of renewable energy? Answering such questions requires developing new concepts and tools for analysing and planning of power grids. Power grids are one of the largest and the most complex man-made systems on earth. The complex nature of power grids and its underlying structure make it possible to analyse power grids relying on network science. The applications of network science on power grids have shown the promising potential to capture the interdependencies between components and to understand the collective emergent behaviour of complex power grids. This thesis is motivated by the increasing need of reliable power grids and the merits of network science on the investigation of power grids. In this context, relying on network science, we model and analyse the power grid and its near-future challenges in terms of line removals/additions, malicious attacks, cascading failures, and renewable integration. Advisors/Committee Members: F.A.%22%29&pagesize-30">Van Mieghem, P.F.A., Kuipers, F.A., Delft University of Technology.

Subjects/Keywords: network science; power grids; cascading failures; wind power; sensitivity analyses; targeted attacks; centrality metrics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Cetinay-Iyicil, H. (2018). Analysis and planning of power grids: A network perspective. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:97657389-0ee5-4de7-82b6-6647470160a5 ; urn:NBN:nl:ui:24-uuid:97657389-0ee5-4de7-82b6-6647470160a5 ; 97657389-0ee5-4de7-82b6-6647470160a5 ; 10.4233/uuid:97657389-0ee5-4de7-82b6-6647470160a5 ; urn:isbn:978-94-6186-969-2 ; urn:NBN:nl:ui:24-uuid:97657389-0ee5-4de7-82b6-6647470160a5 ; http://resolver.tudelft.nl/uuid:97657389-0ee5-4de7-82b6-6647470160a5

Chicago Manual of Style (16^th Edition):

Cetinay-Iyicil, H. “Analysis and planning of power grids: A network perspective.” 2018. Doctoral Dissertation, Delft University of Technology. Accessed January 15, 2021. http://resolver.tudelft.nl/uuid:97657389-0ee5-4de7-82b6-6647470160a5 ; urn:NBN:nl:ui:24-uuid:97657389-0ee5-4de7-82b6-6647470160a5 ; 97657389-0ee5-4de7-82b6-6647470160a5 ; 10.4233/uuid:97657389-0ee5-4de7-82b6-6647470160a5 ; urn:isbn:978-94-6186-969-2 ; urn:NBN:nl:ui:24-uuid:97657389-0ee5-4de7-82b6-6647470160a5 ; http://resolver.tudelft.nl/uuid:97657389-0ee5-4de7-82b6-6647470160a5.

MLA Handbook (7^th Edition):

Cetinay-Iyicil, H. “Analysis and planning of power grids: A network perspective.” 2018. Web. 15 Jan 2021.

Vancouver:

Cetinay-Iyicil H. Analysis and planning of power grids: A network perspective. [Internet] [Doctoral dissertation]. Delft University of Technology; 2018. [cited 2021 Jan 15]. Available from: http://resolver.tudelft.nl/uuid:97657389-0ee5-4de7-82b6-6647470160a5 ; urn:NBN:nl:ui:24-uuid:97657389-0ee5-4de7-82b6-6647470160a5 ; 97657389-0ee5-4de7-82b6-6647470160a5 ; 10.4233/uuid:97657389-0ee5-4de7-82b6-6647470160a5 ; urn:isbn:978-94-6186-969-2 ; urn:NBN:nl:ui:24-uuid:97657389-0ee5-4de7-82b6-6647470160a5 ; http://resolver.tudelft.nl/uuid:97657389-0ee5-4de7-82b6-6647470160a5.

Council of Science Editors:

Cetinay-Iyicil H. Analysis and planning of power grids: A network perspective. [Doctoral Dissertation]. Delft University of Technology; 2018. Available from: http://resolver.tudelft.nl/uuid:97657389-0ee5-4de7-82b6-6647470160a5 ; urn:NBN:nl:ui:24-uuid:97657389-0ee5-4de7-82b6-6647470160a5 ; 97657389-0ee5-4de7-82b6-6647470160a5 ; 10.4233/uuid:97657389-0ee5-4de7-82b6-6647470160a5 ; urn:isbn:978-94-6186-969-2 ; urn:NBN:nl:ui:24-uuid:97657389-0ee5-4de7-82b6-6647470160a5 ; http://resolver.tudelft.nl/uuid:97657389-0ee5-4de7-82b6-6647470160a5

Delft University of Technology

24. Märtens, M. Information Propagation in Complex Networks: Structures and Dynamics.

Degree: 2018, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:b1a1ead7-a631-4f05-b9a9-17a1be6e15e1 ; urn:NBN:nl:ui:24-uuid:b1a1ead7-a631-4f05-b9a9-17a1be6e15e1 ; b1a1ead7-a631-4f05-b9a9-17a1be6e15e1 ; 10.4233/uuid:b1a1ead7-a631-4f05-b9a9-17a1be6e15e1 ; urn:isbn:978-94-028-0907-7 ; urn:NBN:nl:ui:24-uuid:b1a1ead7-a631-4f05-b9a9-17a1be6e15e1 ; http://resolver.tudelft.nl/uuid:b1a1ead7-a631-4f05-b9a9-17a1be6e15e1

► This thesis is a contribution to a deeper understanding of how information propagates and what this process entails. At its very core is the concept… (more)

▼ This thesis is a contribution to a deeper understanding of how information propagates and what this process entails. At its very core is the concept of the network: a collection of nodes and links, which describes the structure of the systems under investigation. The network is a mathematical model which allows to focus on a very fundamental property: the mutual relations (links) between information exchanging agents (nodes). This simplicity makes networks elegant, as no specifics of any supporting hardware are needed to reason on this high level of abstraction. The developing field of network science led to countless applications of the network model to all sorts of complex systems in nature and technology. Naturally, it became an essential part of many multi-disciplinary research projects. Therefore, understanding how information propagates in networks enables us to learn and conceivably control the intricate processes, which we observe in complex systems. Since complex systems are the driver for this research, the first three chapters of this thesis are studies based on data collected from vastly different application domains, after more fundamental research is addressed in the later parts. Chapter 2 deals with the interaction of players of a popular multiplayer online game. Due to the competitive design of the game, teams are formed ad-hoc and compete with each other for victory. Some of the players exhibit anti-social behavior towards their teammates, which is known as toxicity. We analyze how toxicity in player networks emerges by developing a toxicity detector, highlighting possible triggers and analyze the disposition of players towards toxic teammates. Furthermore, we show how toxicity is linked to game success. Chapter 3 continues with a study of the human brain as a functional network. Information processing in the brain is measurable with technologies like magnetoencephalography. From such measurements that were collected from a group of subjects, the phase transfer entropy is computed as a quantity that reflects information exchange. When associated with the links between brain regions, unusual high numbers of certain substructures are observed in this network. We find that one of these substructures, the bi-directional two-hop path, to be highly abundant and robust within different frequencies bands, which highlights its importance for the propagation of brain activity. A clustering of the network based on these frequent substructures reveals a spatially coherent organization of important brain regions. A common symbol of propagation is the virus, which is at the center of the third data-driven analysis of this thesis in Chapter 4. More precisely, we research the digital version of the virus, the computer worm, and analyze its propagation by epidemic network models. With epidemic models, the state of the nodes in a network can be described as susceptible or infected. An infection process and a curing process determine how the nodes are changing between those states. We extend… Advisors/Committee Members: F.A.%22%29&pagesize-30">Van Mieghem, P.F.A., Kuipers, F.A., Delft University of Technology.

Subjects/Keywords: information propagation; functional brain networks; toxicity; multiplayer online games; network epidemics; epidemic spreading model; complex networks; symbolic regression

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Märtens, M. (2018). Information Propagation in Complex Networks: Structures and Dynamics. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:b1a1ead7-a631-4f05-b9a9-17a1be6e15e1 ; urn:NBN:nl:ui:24-uuid:b1a1ead7-a631-4f05-b9a9-17a1be6e15e1 ; b1a1ead7-a631-4f05-b9a9-17a1be6e15e1 ; 10.4233/uuid:b1a1ead7-a631-4f05-b9a9-17a1be6e15e1 ; urn:isbn:978-94-028-0907-7 ; urn:NBN:nl:ui:24-uuid:b1a1ead7-a631-4f05-b9a9-17a1be6e15e1 ; http://resolver.tudelft.nl/uuid:b1a1ead7-a631-4f05-b9a9-17a1be6e15e1

Chicago Manual of Style (16^th Edition):

Märtens, M. “Information Propagation in Complex Networks: Structures and Dynamics.” 2018. Doctoral Dissertation, Delft University of Technology. Accessed January 15, 2021. http://resolver.tudelft.nl/uuid:b1a1ead7-a631-4f05-b9a9-17a1be6e15e1 ; urn:NBN:nl:ui:24-uuid:b1a1ead7-a631-4f05-b9a9-17a1be6e15e1 ; b1a1ead7-a631-4f05-b9a9-17a1be6e15e1 ; 10.4233/uuid:b1a1ead7-a631-4f05-b9a9-17a1be6e15e1 ; urn:isbn:978-94-028-0907-7 ; urn:NBN:nl:ui:24-uuid:b1a1ead7-a631-4f05-b9a9-17a1be6e15e1 ; http://resolver.tudelft.nl/uuid:b1a1ead7-a631-4f05-b9a9-17a1be6e15e1.

MLA Handbook (7^th Edition):

Märtens, M. “Information Propagation in Complex Networks: Structures and Dynamics.” 2018. Web. 15 Jan 2021.

Vancouver:

Märtens M. Information Propagation in Complex Networks: Structures and Dynamics. [Internet] [Doctoral dissertation]. Delft University of Technology; 2018. [cited 2021 Jan 15]. Available from: http://resolver.tudelft.nl/uuid:b1a1ead7-a631-4f05-b9a9-17a1be6e15e1 ; urn:NBN:nl:ui:24-uuid:b1a1ead7-a631-4f05-b9a9-17a1be6e15e1 ; b1a1ead7-a631-4f05-b9a9-17a1be6e15e1 ; 10.4233/uuid:b1a1ead7-a631-4f05-b9a9-17a1be6e15e1 ; urn:isbn:978-94-028-0907-7 ; urn:NBN:nl:ui:24-uuid:b1a1ead7-a631-4f05-b9a9-17a1be6e15e1 ; http://resolver.tudelft.nl/uuid:b1a1ead7-a631-4f05-b9a9-17a1be6e15e1.

Council of Science Editors:

Märtens M. Information Propagation in Complex Networks: Structures and Dynamics. [Doctoral Dissertation]. Delft University of Technology; 2018. Available from: http://resolver.tudelft.nl/uuid:b1a1ead7-a631-4f05-b9a9-17a1be6e15e1 ; urn:NBN:nl:ui:24-uuid:b1a1ead7-a631-4f05-b9a9-17a1be6e15e1 ; b1a1ead7-a631-4f05-b9a9-17a1be6e15e1 ; 10.4233/uuid:b1a1ead7-a631-4f05-b9a9-17a1be6e15e1 ; urn:isbn:978-94-028-0907-7 ; urn:NBN:nl:ui:24-uuid:b1a1ead7-a631-4f05-b9a9-17a1be6e15e1 ; http://resolver.tudelft.nl/uuid:b1a1ead7-a631-4f05-b9a9-17a1be6e15e1

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations