Cache Me If You Can: Capacitated Selfish Replication Games View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2012

AUTHORS

Ragavendran Gopalakrishnan , Dimitrios Kanoulas , Naga Naresh Karuturi , C. Pandu Rangan , Rajmohan Rajaraman , Ravi Sundaram

ABSTRACT

Motivated by peer-to-peer (P2P) networks and content delivery applications, we study Capacitated Selfish Replication (CSR) games, which involve nodes on a network making strategic choices regarding the content to replicate in their caches. Selfish replication games were introduced in [6], who analyzed the uncapacitated case leaving the capacitated version as an open direction. In this work, we study pure Nash equilibria of CSR games with an emphasis on hierarchical networks, which have been extensively used to model communication costs of content delivery and P2P systems. The best result from previous work on CSR games for hierarchical networks [19,23] is the existence of a Nash equilibrium for a (slight generalization of a) 1-level hierarchy when the utility function is based on the sum of the costs of accessing the replicated objects in the network. Our main result is an exact polynomial-time algorithm for finding a Nash Equilibrium in any hierarchical network using a new technique which we term “fictional players”.We show that this technique extends to a general framework of natural preference orders, orders that are entirely arbitrary except for two constraints - “Nearer is better” and “Independence of irrelevant alternatives”. This axiomatic treatment captures a vast class of utility functions and even allows for nodes to simultaneously have utility functions of completely different functional forms. Using our axiomatic framework, we next study CSR games on arbitrary networks and delineate the boundary between intractability and effective computability in terms of the network structure, object preferences, and number of objects. In addition to hierarchical networks, we show the existence of equilibria for general undirected networks when either object preferences are binary or there are two objects. For general CSR games, however, we show that it is NP-hard to determine whether equilibria exist. We also show that the existence of equilibria in strongly connected networks with two objects and binary object preferences can be solved in polynomial time via a reduction to the well-studied evencycle problem. More... »

PAGES

420-432

References to SciGraph publications

  • 2002-04-12. Worst-Case Equilibria in STACS 99
  • 2005. Price of Anarchy, Locality Gap, and a Network Service Provider Game in INTERNET AND NETWORK ECONOMICS
  • Book

    TITLE

    LATIN 2012: Theoretical Informatics

    ISBN

    978-3-642-29343-6
    978-3-642-29344-3

    Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/978-3-642-29344-3_36

    DOI

    http://dx.doi.org/10.1007/978-3-642-29344-3_36

    DIMENSIONS

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


    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/0806", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Information Systems", 
            "type": "DefinedTerm"
          }, 
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Information and Computing Sciences", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "California Institute of Technology", 
              "id": "https://www.grid.ac/institutes/grid.20861.3d", 
              "name": [
                "California Institute of Technology, USA"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Gopalakrishnan", 
            "givenName": "Ragavendran", 
            "id": "sg:person.012011674115.96", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012011674115.96"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Northeastern University", 
              "id": "https://www.grid.ac/institutes/grid.261112.7", 
              "name": [
                "Northeastern University, USA"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Kanoulas", 
            "givenName": "Dimitrios", 
            "id": "sg:person.011402620235.33", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011402620235.33"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "name": [
                "Google, India"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Karuturi", 
            "givenName": "Naga Naresh", 
            "id": "sg:person.010475422253.92", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010475422253.92"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Indian Institute of Technology Madras", 
              "id": "https://www.grid.ac/institutes/grid.417969.4", 
              "name": [
                "IIT Madras, India"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Rangan", 
            "givenName": "C. Pandu", 
            "id": "sg:person.016366027737.61", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016366027737.61"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Northeastern University", 
              "id": "https://www.grid.ac/institutes/grid.261112.7", 
              "name": [
                "Northeastern University, USA"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Rajaraman", 
            "givenName": "Rajmohan", 
            "id": "sg:person.014716044531.06", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014716044531.06"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Northeastern University", 
              "id": "https://www.grid.ac/institutes/grid.261112.7", 
              "name": [
                "Northeastern University, USA"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Sundaram", 
            "givenName": "Ravi", 
            "id": "sg:person.0637112000.27", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0637112000.27"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "https://doi.org/10.1145/1516512.1516516", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1000433957"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-49116-3_38", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1002207134", 
              "https://doi.org/10.1007/3-540-49116-3_38"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-49116-3_38", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1002207134", 
              "https://doi.org/10.1007/3-540-49116-3_38"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/258533.258660", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1003792830"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/1132516.1132527", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1013959482"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/0022-0000(88)90046-3", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1016751164"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11600930_105", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1027996839", 
              "https://doi.org/10.1007/11600930_105"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/11600930_105", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1027996839", 
              "https://doi.org/10.1007/11600930_105"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/249978.249982", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1031312421"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/872035.872088", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1033403903"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1006/jagm.2000.1129", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1035800871"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/71.250099", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061217221"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/jsac.2006.872884", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061317047"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/tkde.2002.1047770", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061661103"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/tpds.2006.171", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061752984"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1137/080715421", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1062854446"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.2307/121059", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1069397519"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/infcom.2007.248", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1094464057"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/icdcs.1999.776529", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1094701191"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2012", 
        "datePublishedReg": "2012-01-01", 
        "description": "Motivated by peer-to-peer (P2P) networks and content delivery applications, we study Capacitated Selfish Replication (CSR) games, which involve nodes on a network making strategic choices regarding the content to replicate in their caches. Selfish replication games were introduced in [6], who analyzed the uncapacitated case leaving the capacitated version as an open direction. In this work, we study pure Nash equilibria of CSR games with an emphasis on hierarchical networks, which have been extensively used to model communication costs of content delivery and P2P systems. The best result from previous work on CSR games for hierarchical networks [19,23] is the existence of a Nash equilibrium for a (slight generalization of a) 1-level hierarchy when the utility function is based on the sum of the costs of accessing the replicated objects in the network. Our main result is an exact polynomial-time algorithm for finding a Nash Equilibrium in any hierarchical network using a new technique which we term \u201cfictional players\u201d.We show that this technique extends to a general framework of natural preference orders, orders that are entirely arbitrary except for two constraints - \u201cNearer is better\u201d and \u201cIndependence of irrelevant alternatives\u201d. This axiomatic treatment captures a vast class of utility functions and even allows for nodes to simultaneously have utility functions of completely different functional forms. Using our axiomatic framework, we next study CSR games on arbitrary networks and delineate the boundary between intractability and effective computability in terms of the network structure, object preferences, and number of objects. In addition to hierarchical networks, we show the existence of equilibria for general undirected networks when either object preferences are binary or there are two objects. For general CSR games, however, we show that it is NP-hard to determine whether equilibria exist. We also show that the existence of equilibria in strongly connected networks with two objects and binary object preferences can be solved in polynomial time via a reduction to the well-studied evencycle problem.", 
        "editor": [
          {
            "familyName": "Fern\u00e1ndez-Baca", 
            "givenName": "David", 
            "type": "Person"
          }
        ], 
        "genre": "chapter", 
        "id": "sg:pub.10.1007/978-3-642-29344-3_36", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": true, 
        "isFundedItemOf": [
          {
            "id": "sg:grant.3072160", 
            "type": "MonetaryGrant"
          }, 
          {
            "id": "sg:grant.3102287", 
            "type": "MonetaryGrant"
          }
        ], 
        "isPartOf": {
          "isbn": [
            "978-3-642-29343-6", 
            "978-3-642-29344-3"
          ], 
          "name": "LATIN 2012: Theoretical Informatics", 
          "type": "Book"
        }, 
        "name": "Cache Me If You Can: Capacitated Selfish Replication Games", 
        "pagination": "420-432", 
        "productId": [
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/978-3-642-29344-3_36"
            ]
          }, 
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "457c69bdd9659c03aa5131146c123141c036c51960d73a181975e0aa826ba61f"
            ]
          }, 
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1014585623"
            ]
          }
        ], 
        "publisher": {
          "location": "Berlin, Heidelberg", 
          "name": "Springer Berlin Heidelberg", 
          "type": "Organisation"
        }, 
        "sameAs": [
          "https://doi.org/10.1007/978-3-642-29344-3_36", 
          "https://app.dimensions.ai/details/publication/pub.1014585623"
        ], 
        "sdDataset": "chapters", 
        "sdDatePublished": "2019-04-15T20:04", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8687_00000252.jsonl", 
        "type": "Chapter", 
        "url": "http://link.springer.com/10.1007/978-3-642-29344-3_36"
      }
    ]
     

    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-642-29344-3_36'

    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-642-29344-3_36'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-29344-3_36'

    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-642-29344-3_36'


     

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

    165 TRIPLES      23 PREDICATES      44 URIs      20 LITERALS      8 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/978-3-642-29344-3_36 schema:about anzsrc-for:08
    2 anzsrc-for:0806
    3 schema:author N15c42b929bc84af29a4e59f3f1756c29
    4 schema:citation sg:pub.10.1007/11600930_105
    5 sg:pub.10.1007/3-540-49116-3_38
    6 https://doi.org/10.1006/jagm.2000.1129
    7 https://doi.org/10.1016/0022-0000(88)90046-3
    8 https://doi.org/10.1109/71.250099
    9 https://doi.org/10.1109/icdcs.1999.776529
    10 https://doi.org/10.1109/infcom.2007.248
    11 https://doi.org/10.1109/jsac.2006.872884
    12 https://doi.org/10.1109/tkde.2002.1047770
    13 https://doi.org/10.1109/tpds.2006.171
    14 https://doi.org/10.1137/080715421
    15 https://doi.org/10.1145/1132516.1132527
    16 https://doi.org/10.1145/1516512.1516516
    17 https://doi.org/10.1145/249978.249982
    18 https://doi.org/10.1145/258533.258660
    19 https://doi.org/10.1145/872035.872088
    20 https://doi.org/10.2307/121059
    21 schema:datePublished 2012
    22 schema:datePublishedReg 2012-01-01
    23 schema:description Motivated by peer-to-peer (P2P) networks and content delivery applications, we study Capacitated Selfish Replication (CSR) games, which involve nodes on a network making strategic choices regarding the content to replicate in their caches. Selfish replication games were introduced in [6], who analyzed the uncapacitated case leaving the capacitated version as an open direction. In this work, we study pure Nash equilibria of CSR games with an emphasis on hierarchical networks, which have been extensively used to model communication costs of content delivery and P2P systems. The best result from previous work on CSR games for hierarchical networks [19,23] is the existence of a Nash equilibrium for a (slight generalization of a) 1-level hierarchy when the utility function is based on the sum of the costs of accessing the replicated objects in the network. Our main result is an exact polynomial-time algorithm for finding a Nash Equilibrium in any hierarchical network using a new technique which we term “fictional players”.We show that this technique extends to a general framework of natural preference orders, orders that are entirely arbitrary except for two constraints - “Nearer is better” and “Independence of irrelevant alternatives”. This axiomatic treatment captures a vast class of utility functions and even allows for nodes to simultaneously have utility functions of completely different functional forms. Using our axiomatic framework, we next study CSR games on arbitrary networks and delineate the boundary between intractability and effective computability in terms of the network structure, object preferences, and number of objects. In addition to hierarchical networks, we show the existence of equilibria for general undirected networks when either object preferences are binary or there are two objects. For general CSR games, however, we show that it is NP-hard to determine whether equilibria exist. We also show that the existence of equilibria in strongly connected networks with two objects and binary object preferences can be solved in polynomial time via a reduction to the well-studied evencycle problem.
    24 schema:editor Nd20348675921468ebe71da32ad2c1de5
    25 schema:genre chapter
    26 schema:inLanguage en
    27 schema:isAccessibleForFree true
    28 schema:isPartOf N0bf33ef1e04844028ca47d015b1d3af1
    29 schema:name Cache Me If You Can: Capacitated Selfish Replication Games
    30 schema:pagination 420-432
    31 schema:productId N4dc34f27087c4b379210238412931c6b
    32 N696203cd92da4dea950395d7f8693c02
    33 N9e81d12407424f169ae1bf259304fbf6
    34 schema:publisher Nab4cf4f3df8146b5bda5ff561cc8c08e
    35 schema:sameAs https://app.dimensions.ai/details/publication/pub.1014585623
    36 https://doi.org/10.1007/978-3-642-29344-3_36
    37 schema:sdDatePublished 2019-04-15T20:04
    38 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    39 schema:sdPublisher N846ccdd790504b15ac460d2250caa31f
    40 schema:url http://link.springer.com/10.1007/978-3-642-29344-3_36
    41 sgo:license sg:explorer/license/
    42 sgo:sdDataset chapters
    43 rdf:type schema:Chapter
    44 N0be9f1c5e1634bfab7b75691eeb981da schema:familyName Fernández-Baca
    45 schema:givenName David
    46 rdf:type schema:Person
    47 N0bf33ef1e04844028ca47d015b1d3af1 schema:isbn 978-3-642-29343-6
    48 978-3-642-29344-3
    49 schema:name LATIN 2012: Theoretical Informatics
    50 rdf:type schema:Book
    51 N15c42b929bc84af29a4e59f3f1756c29 rdf:first sg:person.012011674115.96
    52 rdf:rest N203e83d24a704ee6a62ca8962ab4138d
    53 N203e83d24a704ee6a62ca8962ab4138d rdf:first sg:person.011402620235.33
    54 rdf:rest Nb95eda4396004199b10af4ceca9f582c
    55 N2cb0e8ccd73c4f0f8cdd833d4dee166f rdf:first sg:person.014716044531.06
    56 rdf:rest Nc1fd23da82bc4da9968ff24ec988df18
    57 N4c29deacc1044887b3cd08ff3677efe9 schema:name Google, India
    58 rdf:type schema:Organization
    59 N4dc34f27087c4b379210238412931c6b schema:name doi
    60 schema:value 10.1007/978-3-642-29344-3_36
    61 rdf:type schema:PropertyValue
    62 N696203cd92da4dea950395d7f8693c02 schema:name dimensions_id
    63 schema:value pub.1014585623
    64 rdf:type schema:PropertyValue
    65 N846ccdd790504b15ac460d2250caa31f schema:name Springer Nature - SN SciGraph project
    66 rdf:type schema:Organization
    67 N9e81d12407424f169ae1bf259304fbf6 schema:name readcube_id
    68 schema:value 457c69bdd9659c03aa5131146c123141c036c51960d73a181975e0aa826ba61f
    69 rdf:type schema:PropertyValue
    70 Na91518d79b594e78bd363ebde4bd13e9 rdf:first sg:person.016366027737.61
    71 rdf:rest N2cb0e8ccd73c4f0f8cdd833d4dee166f
    72 Nab4cf4f3df8146b5bda5ff561cc8c08e schema:location Berlin, Heidelberg
    73 schema:name Springer Berlin Heidelberg
    74 rdf:type schema:Organisation
    75 Nb95eda4396004199b10af4ceca9f582c rdf:first sg:person.010475422253.92
    76 rdf:rest Na91518d79b594e78bd363ebde4bd13e9
    77 Nc1fd23da82bc4da9968ff24ec988df18 rdf:first sg:person.0637112000.27
    78 rdf:rest rdf:nil
    79 Nd20348675921468ebe71da32ad2c1de5 rdf:first N0be9f1c5e1634bfab7b75691eeb981da
    80 rdf:rest rdf:nil
    81 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    82 schema:name Information and Computing Sciences
    83 rdf:type schema:DefinedTerm
    84 anzsrc-for:0806 schema:inDefinedTermSet anzsrc-for:
    85 schema:name Information Systems
    86 rdf:type schema:DefinedTerm
    87 sg:grant.3072160 http://pending.schema.org/fundedItem sg:pub.10.1007/978-3-642-29344-3_36
    88 rdf:type schema:MonetaryGrant
    89 sg:grant.3102287 http://pending.schema.org/fundedItem sg:pub.10.1007/978-3-642-29344-3_36
    90 rdf:type schema:MonetaryGrant
    91 sg:person.010475422253.92 schema:affiliation N4c29deacc1044887b3cd08ff3677efe9
    92 schema:familyName Karuturi
    93 schema:givenName Naga Naresh
    94 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010475422253.92
    95 rdf:type schema:Person
    96 sg:person.011402620235.33 schema:affiliation https://www.grid.ac/institutes/grid.261112.7
    97 schema:familyName Kanoulas
    98 schema:givenName Dimitrios
    99 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011402620235.33
    100 rdf:type schema:Person
    101 sg:person.012011674115.96 schema:affiliation https://www.grid.ac/institutes/grid.20861.3d
    102 schema:familyName Gopalakrishnan
    103 schema:givenName Ragavendran
    104 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012011674115.96
    105 rdf:type schema:Person
    106 sg:person.014716044531.06 schema:affiliation https://www.grid.ac/institutes/grid.261112.7
    107 schema:familyName Rajaraman
    108 schema:givenName Rajmohan
    109 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014716044531.06
    110 rdf:type schema:Person
    111 sg:person.016366027737.61 schema:affiliation https://www.grid.ac/institutes/grid.417969.4
    112 schema:familyName Rangan
    113 schema:givenName C. Pandu
    114 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016366027737.61
    115 rdf:type schema:Person
    116 sg:person.0637112000.27 schema:affiliation https://www.grid.ac/institutes/grid.261112.7
    117 schema:familyName Sundaram
    118 schema:givenName Ravi
    119 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0637112000.27
    120 rdf:type schema:Person
    121 sg:pub.10.1007/11600930_105 schema:sameAs https://app.dimensions.ai/details/publication/pub.1027996839
    122 https://doi.org/10.1007/11600930_105
    123 rdf:type schema:CreativeWork
    124 sg:pub.10.1007/3-540-49116-3_38 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002207134
    125 https://doi.org/10.1007/3-540-49116-3_38
    126 rdf:type schema:CreativeWork
    127 https://doi.org/10.1006/jagm.2000.1129 schema:sameAs https://app.dimensions.ai/details/publication/pub.1035800871
    128 rdf:type schema:CreativeWork
    129 https://doi.org/10.1016/0022-0000(88)90046-3 schema:sameAs https://app.dimensions.ai/details/publication/pub.1016751164
    130 rdf:type schema:CreativeWork
    131 https://doi.org/10.1109/71.250099 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061217221
    132 rdf:type schema:CreativeWork
    133 https://doi.org/10.1109/icdcs.1999.776529 schema:sameAs https://app.dimensions.ai/details/publication/pub.1094701191
    134 rdf:type schema:CreativeWork
    135 https://doi.org/10.1109/infcom.2007.248 schema:sameAs https://app.dimensions.ai/details/publication/pub.1094464057
    136 rdf:type schema:CreativeWork
    137 https://doi.org/10.1109/jsac.2006.872884 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061317047
    138 rdf:type schema:CreativeWork
    139 https://doi.org/10.1109/tkde.2002.1047770 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061661103
    140 rdf:type schema:CreativeWork
    141 https://doi.org/10.1109/tpds.2006.171 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061752984
    142 rdf:type schema:CreativeWork
    143 https://doi.org/10.1137/080715421 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062854446
    144 rdf:type schema:CreativeWork
    145 https://doi.org/10.1145/1132516.1132527 schema:sameAs https://app.dimensions.ai/details/publication/pub.1013959482
    146 rdf:type schema:CreativeWork
    147 https://doi.org/10.1145/1516512.1516516 schema:sameAs https://app.dimensions.ai/details/publication/pub.1000433957
    148 rdf:type schema:CreativeWork
    149 https://doi.org/10.1145/249978.249982 schema:sameAs https://app.dimensions.ai/details/publication/pub.1031312421
    150 rdf:type schema:CreativeWork
    151 https://doi.org/10.1145/258533.258660 schema:sameAs https://app.dimensions.ai/details/publication/pub.1003792830
    152 rdf:type schema:CreativeWork
    153 https://doi.org/10.1145/872035.872088 schema:sameAs https://app.dimensions.ai/details/publication/pub.1033403903
    154 rdf:type schema:CreativeWork
    155 https://doi.org/10.2307/121059 schema:sameAs https://app.dimensions.ai/details/publication/pub.1069397519
    156 rdf:type schema:CreativeWork
    157 https://www.grid.ac/institutes/grid.20861.3d schema:alternateName California Institute of Technology
    158 schema:name California Institute of Technology, USA
    159 rdf:type schema:Organization
    160 https://www.grid.ac/institutes/grid.261112.7 schema:alternateName Northeastern University
    161 schema:name Northeastern University, USA
    162 rdf:type schema:Organization
    163 https://www.grid.ac/institutes/grid.417969.4 schema:alternateName Indian Institute of Technology Madras
    164 schema:name IIT Madras, India
    165 rdf:type schema:Organization
     




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


    ...