Scalable Load-Distance Balancing View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2007-01-01

AUTHORS

Edward Bortnikov , Israel Cidon , Idit Keidar

ABSTRACT

We introduce the problem of load-distance balancing in assigning users of a delay-sensitive networked application to servers. We model the service delay experienced by a user as a sum of a network-incurred delay, which depends on its network distance from the server, and a server-incurred delay, stemming from the load on the server. The problem is to minimize the maximum service delay among all users.We address the challenge of finding a near-optimal assignment in a scalable distributed manner. The key to achieving scalability is using local solutions, whereby each server only communicates with a few close servers. Note, however, that the attainable locality of a solution depends on the workload – when some area in the network is congested, obtaining a near-optimal cost may require offloading users to remote servers, whereas when the network load is uniform, a purely local assignment may suffice. We present algorithms that exploit the opportunity to provide a local solution when possible, and thus have communication costs and stabilization times that vary according to the network congestion. We evaluate our algorithms with a detailed simulation case study of their application in assigning hosts to Internet gateways in an urban wireless mesh network (WMN). More... »

PAGES

77-91

Book

TITLE

Distributed Computing

ISBN

978-3-540-75141-0
978-3-540-75142-7

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-540-75142-7_9

DOI

http://dx.doi.org/10.1007/978-3-540-75142-7_9

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1009229441


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/10", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Technology", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/1005", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Communications Technologies", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Department of Electrical Engineering, The Technion, Haifa 32000", 
          "id": "http://www.grid.ac/institutes/grid.6451.6", 
          "name": [
            "Department of Electrical Engineering, The Technion, Haifa 32000"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Bortnikov", 
        "givenName": "Edward", 
        "id": "sg:person.010766335343.75", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010766335343.75"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Electrical Engineering, The Technion, Haifa 32000", 
          "id": "http://www.grid.ac/institutes/grid.6451.6", 
          "name": [
            "Department of Electrical Engineering, The Technion, Haifa 32000"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Cidon", 
        "givenName": "Israel", 
        "id": "sg:person.015454420471.09", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015454420471.09"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Electrical Engineering, The Technion, Haifa 32000", 
          "id": "http://www.grid.ac/institutes/grid.6451.6", 
          "name": [
            "Department of Electrical Engineering, The Technion, Haifa 32000"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Keidar", 
        "givenName": "Idit", 
        "id": "sg:person.07674464077.03", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07674464077.03"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2007-01-01", 
    "datePublishedReg": "2007-01-01", 
    "description": "We introduce the problem of load-distance balancing in assigning users of a delay-sensitive networked application to servers. We model the service delay experienced by a user as a sum of a network-incurred delay, which depends on its network distance from the server, and a server-incurred delay, stemming from the load on the server. The problem is to minimize the maximum service delay among all users.We address the challenge of finding a near-optimal assignment in a scalable distributed manner. The key to achieving scalability is using local solutions, whereby each server only communicates with a few close servers. Note, however, that the attainable locality of a solution depends on the workload \u2013 when some area in the network is congested, obtaining a near-optimal cost may require offloading users to remote servers, whereas when the network load is uniform, a purely local assignment may suffice. We present algorithms that exploit the opportunity to provide a local solution when possible, and thus have communication costs and stabilization times that vary according to the network congestion. We evaluate our algorithms with a detailed simulation case study of their application in assigning hosts to Internet gateways in an urban wireless mesh network (WMN).", 
    "editor": [
      {
        "familyName": "Pelc", 
        "givenName": "Andrzej", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-540-75142-7_9", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-75141-0", 
        "978-3-540-75142-7"
      ], 
      "name": "Distributed Computing", 
      "type": "Book"
    }, 
    "keywords": [
      "wireless mesh networks", 
      "service delay", 
      "maximum service delay", 
      "detailed simulation case study", 
      "networked applications", 
      "remote server", 
      "Internet gateway", 
      "communication cost", 
      "closest server", 
      "offloading users", 
      "network congestion", 
      "network load", 
      "server", 
      "mesh networks", 
      "users", 
      "optimal assignment", 
      "network distance", 
      "simulation case study", 
      "local assignment", 
      "local solutions", 
      "optimal cost", 
      "algorithm", 
      "network", 
      "scalability", 
      "case study", 
      "gateway", 
      "delay", 
      "workload", 
      "applications", 
      "cost", 
      "balancing", 
      "congestion", 
      "solution", 
      "assignment", 
      "key", 
      "challenges", 
      "load", 
      "stabilization time", 
      "localities", 
      "opportunities", 
      "manner", 
      "distance", 
      "time", 
      "sum", 
      "area", 
      "host", 
      "problem", 
      "study", 
      "delay-sensitive networked application", 
      "network-incurred delay", 
      "server-incurred delay", 
      "attainable locality", 
      "urban wireless mesh network", 
      "Scalable Load-Distance Balancing", 
      "Load-Distance Balancing"
    ], 
    "name": "Scalable Load-Distance Balancing", 
    "pagination": "77-91", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1009229441"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-540-75142-7_9"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-540-75142-7_9", 
      "https://app.dimensions.ai/details/publication/pub.1009229441"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-01-01T19:14", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220101/entities/gbq_results/chapter/chapter_254.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-540-75142-7_9"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-75142-7_9'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-75142-7_9'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-75142-7_9'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-75142-7_9'


 

This table displays all metadata directly associated to this object as RDF triples.

129 TRIPLES      23 PREDICATES      79 URIs      72 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-540-75142-7_9 schema:about anzsrc-for:10
2 anzsrc-for:1005
3 schema:author N8f5e40a489a44911b61b5af712d29638
4 schema:datePublished 2007-01-01
5 schema:datePublishedReg 2007-01-01
6 schema:description We introduce the problem of load-distance balancing in assigning users of a delay-sensitive networked application to servers. We model the service delay experienced by a user as a sum of a network-incurred delay, which depends on its network distance from the server, and a server-incurred delay, stemming from the load on the server. The problem is to minimize the maximum service delay among all users.We address the challenge of finding a near-optimal assignment in a scalable distributed manner. The key to achieving scalability is using local solutions, whereby each server only communicates with a few close servers. Note, however, that the attainable locality of a solution depends on the workload – when some area in the network is congested, obtaining a near-optimal cost may require offloading users to remote servers, whereas when the network load is uniform, a purely local assignment may suffice. We present algorithms that exploit the opportunity to provide a local solution when possible, and thus have communication costs and stabilization times that vary according to the network congestion. We evaluate our algorithms with a detailed simulation case study of their application in assigning hosts to Internet gateways in an urban wireless mesh network (WMN).
7 schema:editor Nf80e2ae6d4294716bb960eb0421fc905
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf N8da9f6600f9e4e39b579dbeacecaf9a3
12 schema:keywords Internet gateway
13 Load-Distance Balancing
14 Scalable Load-Distance Balancing
15 algorithm
16 applications
17 area
18 assignment
19 attainable locality
20 balancing
21 case study
22 challenges
23 closest server
24 communication cost
25 congestion
26 cost
27 delay
28 delay-sensitive networked application
29 detailed simulation case study
30 distance
31 gateway
32 host
33 key
34 load
35 local assignment
36 local solutions
37 localities
38 manner
39 maximum service delay
40 mesh networks
41 network
42 network congestion
43 network distance
44 network load
45 network-incurred delay
46 networked applications
47 offloading users
48 opportunities
49 optimal assignment
50 optimal cost
51 problem
52 remote server
53 scalability
54 server
55 server-incurred delay
56 service delay
57 simulation case study
58 solution
59 stabilization time
60 study
61 sum
62 time
63 urban wireless mesh network
64 users
65 wireless mesh networks
66 workload
67 schema:name Scalable Load-Distance Balancing
68 schema:pagination 77-91
69 schema:productId N0173a4658a7244ee9e3ca0e660a57465
70 Nc35e64f6c03940c994e9dd42850b2b3d
71 schema:publisher N8a34d21e561a4f79bce61c09dd94fe64
72 schema:sameAs https://app.dimensions.ai/details/publication/pub.1009229441
73 https://doi.org/10.1007/978-3-540-75142-7_9
74 schema:sdDatePublished 2022-01-01T19:14
75 schema:sdLicense https://scigraph.springernature.com/explorer/license/
76 schema:sdPublisher N5e706417c99947959c7d2b31fb4a3571
77 schema:url https://doi.org/10.1007/978-3-540-75142-7_9
78 sgo:license sg:explorer/license/
79 sgo:sdDataset chapters
80 rdf:type schema:Chapter
81 N0173a4658a7244ee9e3ca0e660a57465 schema:name doi
82 schema:value 10.1007/978-3-540-75142-7_9
83 rdf:type schema:PropertyValue
84 N5e706417c99947959c7d2b31fb4a3571 schema:name Springer Nature - SN SciGraph project
85 rdf:type schema:Organization
86 N6eb58a1b8e424e1aa442e86a7940bcf3 schema:familyName Pelc
87 schema:givenName Andrzej
88 rdf:type schema:Person
89 N8a34d21e561a4f79bce61c09dd94fe64 schema:name Springer Nature
90 rdf:type schema:Organisation
91 N8da9f6600f9e4e39b579dbeacecaf9a3 schema:isbn 978-3-540-75141-0
92 978-3-540-75142-7
93 schema:name Distributed Computing
94 rdf:type schema:Book
95 N8f5e40a489a44911b61b5af712d29638 rdf:first sg:person.010766335343.75
96 rdf:rest Ndd59e605552f49c1b32dc1b4a3caeae3
97 Nc35e64f6c03940c994e9dd42850b2b3d schema:name dimensions_id
98 schema:value pub.1009229441
99 rdf:type schema:PropertyValue
100 Ndd59e605552f49c1b32dc1b4a3caeae3 rdf:first sg:person.015454420471.09
101 rdf:rest Ne29863723571448aaa6635bcc3f2758c
102 Ne29863723571448aaa6635bcc3f2758c rdf:first sg:person.07674464077.03
103 rdf:rest rdf:nil
104 Nf80e2ae6d4294716bb960eb0421fc905 rdf:first N6eb58a1b8e424e1aa442e86a7940bcf3
105 rdf:rest rdf:nil
106 anzsrc-for:10 schema:inDefinedTermSet anzsrc-for:
107 schema:name Technology
108 rdf:type schema:DefinedTerm
109 anzsrc-for:1005 schema:inDefinedTermSet anzsrc-for:
110 schema:name Communications Technologies
111 rdf:type schema:DefinedTerm
112 sg:person.010766335343.75 schema:affiliation grid-institutes:grid.6451.6
113 schema:familyName Bortnikov
114 schema:givenName Edward
115 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010766335343.75
116 rdf:type schema:Person
117 sg:person.015454420471.09 schema:affiliation grid-institutes:grid.6451.6
118 schema:familyName Cidon
119 schema:givenName Israel
120 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015454420471.09
121 rdf:type schema:Person
122 sg:person.07674464077.03 schema:affiliation grid-institutes:grid.6451.6
123 schema:familyName Keidar
124 schema:givenName Idit
125 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07674464077.03
126 rdf:type schema:Person
127 grid-institutes:grid.6451.6 schema:alternateName Department of Electrical Engineering, The Technion, Haifa 32000
128 schema:name Department of Electrical Engineering, The Technion, Haifa 32000
129 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...