• Study Resource
  • Explore Categories
    • Arts & Humanities
    • Business
    • Engineering & Technology
    • Foreign Language
    • History
    • Math
    • Science
    • Social Science

    Top subcategories

    • Advanced Math
    • Algebra
    • Basic Math
    • Calculus
    • Geometry
    • Linear Algebra
    • Pre-Algebra
    • Pre-Calculus
    • Statistics And Probability
    • Trigonometry
    • other →

    Top subcategories

    • Astronomy
    • Astrophysics
    • Biology
    • Chemistry
    • Earth Science
    • Environmental Science
    • Health Science
    • Physics
    • other →

    Top subcategories

    • Anthropology
    • Law
    • Political Science
    • Psychology
    • Sociology
    • other →

    Top subcategories

    • Accounting
    • Economics
    • Finance
    • Management
    • other →

    Top subcategories

    • Aerospace Engineering
    • Bioengineering
    • Chemical Engineering
    • Civil Engineering
    • Computer Science
    • Electrical Engineering
    • Industrial Engineering
    • Mechanical Engineering
    • Web Design
    • other →

    Top subcategories

    • Architecture
    • Communications
    • English
    • Gender Studies
    • Music
    • Performing Arts
    • Philosophy
    • Religious Studies
    • Writing
    • other →

    Top subcategories

    • Ancient History
    • European History
    • US History
    • World History
    • other →

    Top subcategories

    • Croatian
    • Czech
    • Finnish
    • Greek
    • Hindi
    • Japanese
    • Korean
    • Persian
    • Swedish
    • Turkish
    • other →
 
Profile Documents Logout
Upload
Modeling and predicting end-to-end response times in multi-tier Internet applications
Modeling and predicting end-to-end response times in multi-tier Internet applications

P2P Part-2
P2P Part-2

... The routing table – similar to Chord’s finger table – stores links to id-space The leaf set contains nodes which are close in the idspace Nodes that are closed together in terms of network locality are listed in the neighbourhood set ...
Routing
Routing

A Music Generation System Inspired by Complex Systems Theory
A Music Generation System Inspired by Complex Systems Theory

HPCC - Chapter1
HPCC - Chapter1

... source computer has accessed a particular node, they continue to connect to that same node every time in the future ...
20060420_OnLinkScalability_rev1
20060420_OnLinkScalability_rev1

... Control Traffic on an Active (non-linklocal only) Network on a Stable Link • Active (non-link-local only)? – Every host is communicating only with non-link-local nodes ...
Maximizing Path Durations in Mobile Ad-Hoc Networks
Maximizing Path Durations in Mobile Ad-Hoc Networks

Overbot - A botnet protocol based on Kademlia
Overbot - A botnet protocol based on Kademlia

Class-Chord: Efficient Messages to Classes of Nodes in Chord
Class-Chord: Efficient Messages to Classes of Nodes in Chord

Cluster Administration Tool
Cluster Administration Tool

Increased Connectedness As a Function of Organized
Increased Connectedness As a Function of Organized

Opportunistic Routing in Multi
Opportunistic Routing in Multi

... each pair of nodes is either linked by a wire, or else not linked, so that only linked nodes can communicate directly. If each link has a deterministic cost, then there will be one or more optimal routes between each pair. A routing protocol that first finds an optimal route, and then sends data alo ...
slides ppt
slides ppt

CROSS-ROAD: CROSS-layer Ring Overlay for AD hoc networks
CROSS-ROAD: CROSS-layer Ring Overlay for AD hoc networks

Through the Wormhole: Low Cost, Fresh Peer Sampling for the
Through the Wormhole: Low Cost, Fresh Peer Sampling for the

... nodes, nodes that support direct connectivity, in order to build a view of the overlay network. These designs are based on two assumptions: i) connection establishment from a private to a public peer comes at negligible cost, and ii) the connection setup time is short and predictable. However, these ...
Small-College Supercomputing: Building A Beowulf
Small-College Supercomputing: Building A Beowulf

... When it comes to hardware, there are two broad categories of decisions to be made: 1. What hardware you want for your cluster’s nodes; and 2. How your nodes will communicate (their interconnect). We will treat each of these separately. Nodes. The vast majority of Beowulf cluster nodes have x86 CPUs ...
E42062126
E42062126

... A delay-tolerant network is a network designed so that momentary or flashing communication problems and limitations have the least possible unpleasant impact. As the storage-carry-forward paradigm is adopted to transfer messages in DTNs, buffer management schemes greatly influence the performance of ...
Document
Document

... Introduction to Computer Network ...
Link-layer addressing, Ethernet, hubs and switches
Link-layer addressing, Ethernet, hubs and switches

... frame contains A-to-B IP datagram A’s adapter sends frame R’s adapter receives frame R removes IP datagram from Ethernet frame, sees its destined to B R uses ARP to get B’s MAC address R creates frame containing A-to-B IP datagram sends to B ...
SiCortex Technical Summary
SiCortex Technical Summary

i id
i id

Measurement Based Routing Strategies on Overlay Architectures Tuna G ¨uven
Measurement Based Routing Strategies on Overlay Architectures Tuna G ¨uven

6Loeng
6Loeng

... 1. Forward-pass neural net is an acyclic graph. Its nodes can be classified as input, output and internal nodes. Input nodes do not have neighbours on incoming arcs, output nodes do not have them on outgoing arcs and internal nodes possess both kinds of neighbours. 2. Layered (n-layered) net is a fo ...
Deployment of a Rational Swarm Routing Algorithm in Ad Hoc
Deployment of a Rational Swarm Routing Algorithm in Ad Hoc

... precious resources in terms of battery power and wireless bandwidth. The best routing protocols seek to reduce the number of route requests required and the number of messages that need to be sent to determine routes. Route maintenance methods must be able to recognize when a path between the source ...
IU3215671573
IU3215671573

... A varying link route does not produce good results. The network layer has received a notice when working on Mobile Adhoc Network. Therefore plenty of routing protocols in such network with different objectives and with different specific needs have been proposed. [1]. As a matter of fact, the two vi ...
< 1 ... 13 14 15 16 17 18 19 20 21 ... 42 >

Kademlia

  • studyres.com © 2025
  • DMCA
  • Privacy
  • Terms
  • Report