Sökning: "Network Size Estimation"

Visar resultat 1 - 5 av 34 avhandlingar innehållade orden Network Size Estimation.

  1. 1. Dealing with Network Partitions and Mergers in Structured Overlay Networks

    Författare :Tallat Mahmood Shafaat; Seif Haridi; Ali Ghodsi; Anwitaman Datta; KTH; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Structured Overlay Networks; Distributed Hash Tables; DHTs; Network Partitions; Network Mergers; Network Size Estimation; Lookup Inconsistencies; Gossiping; Computer science; Datalogi;

    Sammanfattning : Structured overlay networks form a major classof peer-to-peer systems, which are touted for their abilitiesto scale, tolerate failures, and self-manage. Any long livedInternet-scale distributed system is destined to facenetwork partitions. LÄS MER

  2. 2. Distributed Estimation of Network Cardinalities

    Författare :Riccardo Lucchese; Luleå tekniska universitet; []

    Sammanfattning : In distributed applications knowing the topological properties of the underlying communication network may lead to better performing algorithms. For instance, in distributed regression frameworks, knowing the number of active sensors allows to correctly weight prior information against evidence in the data. LÄS MER

  3. 3. Partition Tolerance and Data Consistency in Structured Overlay Networks

    Författare :Shafaat Tallat Mahmood; Seif Haridi; Peter Van Roy; Tallat M. Shafaat; KTH; []
    Nyckelord :ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURAL SCIENCES; NATURVETENSKAP; Structured overlay networks; distributed Hash tables; network partitions and mergers; size estimation; lookup inconsistencies; distributed key-value stores; linearizability; dynamic reconfiguration; replication.; SRA - ICT; SRA - Informations- och kommunikationsteknik;

    Sammanfattning : Structured overlay networks form a major class of peer-to-peer systems, which are used to build scalable, fault-tolerant and self-managing distributed applications. This thesis presents algorithms for structured overlay networks, on the routing and data level, in the presence of network and node dynamism. LÄS MER

  4. 4. Food Web Ecology -- individual life-histories and ecological processes shape complex communities

    Författare :Martin Hartvig; Evolutionär ekologi; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; food web; community ecology; community assembly; size-structure; life-history omnivory; ontogeny; trophic interactions; trait based model; topology; emergent organisation; size-spectrum;

    Sammanfattning : This thesis sets out a food web framework for size-structured populations. The framework enables an ecological approach to food web modelling as the individual life-history from birth, through maturation, and ultimately death is explicitly resolved with the use of bioenergetics based on individual body size. LÄS MER

  5. 5. Heuristic Mathematical Programming Methods for Lot-sizing, Inventory Control, and Distribution Cost Estimation in the Supply Chain

    Författare :Björn Samuelsson; Athanasios Migdalas; Anders Segerstedt; Sven Axsäter; Leonidas Pitsoulis; Luleå tekniska universitet; []
    Nyckelord :ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Dynamic lot size; Multi-echelon inventory systems; Supply network optimization; Distribution; Location analysis; Distribution cost approximation; Industrial Logistics; Industriell logistik;

    Sammanfattning : The supply function has an important role to support the business to create a customer value. Two important parts of this process is to have the warehouses and production sites in the right location and to have the right items stocked at the right level. This thesis is concerned with those two parts of the supply chain management. LÄS MER