[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"_public_publisher_byId_b4b3bbee-27f1-4c0b-a877-16a29c04534c":3,"_public_publication_all{\"sortAscending\":false,\"sortField\":\"updateTime\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"publisherId:b4b3bbee-27f1-4c0b-a877-16a29c04534c,\"}":80},{"code":4,"data":5,"meta":22},"SUCCESS",{"id":6,"createTime":7,"updateTime":8,"relativeEntities":9,"slug":10,"properties":11,"entityType":20,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":23,"subjectFields":24,"manageAffiliations":43,"indexDatabases":51,"url":71,"thumbnailPath":22,"statistic":72,"gsStatistic":22,"type":22,"analyzePriority":22},"b4b3bbee-27f1-4c0b-a877-16a29c04534c","2023-05-29T12:01:55.314+00:00","2025-11-21T09:51:58.055+00:00",[],"Proceedings-International-Conference-on-Distributed-Computing-Systems",{"country":12,"issn":14,"title":16,"introduce":18},{"VOID":13},"US",{"VOID":15},"10636927",{"EN":17},"Proceedings - International Conference on Distributed Computing Systems",{"EN":19},"The annual ICDCS conference is a premier international forum for researchers, developers and users to present, discuss and exchange the cutting edge ideas and latest findings on topics related to any aspects of distributed computing systems.","PUBLISHER","PENDING",null,4,[25,31,37],{"id":26,"createTime":22,"updateTime":22,"relativeEntities":27,"label":28,"description":30,"parentId":22,"standard":22,"scholarHubFieldId":22},"aae089e7-8b62-4df4-ab86-aada3693b3f8",[],{"EN":29},"Software",{},{"id":32,"createTime":22,"updateTime":22,"relativeEntities":33,"label":34,"description":36,"parentId":22,"standard":22,"scholarHubFieldId":22},"f0f0ec9c-bb68-4288-a6f1-ee3d47dc35eb",[],{"EN":35},"Computer Networks and Communications",{},{"id":38,"createTime":22,"updateTime":22,"relativeEntities":39,"label":40,"description":42,"parentId":22,"standard":22,"scholarHubFieldId":22},"6dbce0ad-8fe9-432e-b415-2441d8c2f0bd",[],{"EN":41},"Hardware and Architecture",{},[44],{"id":45,"createTime":22,"updateTime":22,"relativeEntities":46,"slug":22,"properties":47,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":50,"statistic":22},"f181689a-a4d4-46e9-bd7a-8721640a31a1",[],{"title":48},{"EN":49},"Institute of Electrical and Electronics Engineers Inc.",[],[52],{"id":53,"indexDatabase":54,"url":64,"indexYears":65,"academicFieldIds":66,"indexDatabaseRanking":70},"6e8857b1-bede-489f-94c4-56ddb8f0d899",{"id":55,"createTime":22,"updateTime":22,"relativeEntities":56,"label":57,"description":59,"key":61,"publicationTags":62,"standard":22},"3c7051d4-eb7d-4c57-a56b-36fc74c5d1e9",[],{"EN":58,"VI":58},"Scopus - Elsevier",{"EN":58,"VI":60},"Cơ sở dữ liệu Scopus thuộc Elsevier","scopus",[63],"SCOPUS","https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F26104","1982,1984,1986-2024",[67,68,69],"d5abd5bd-04fc-4adb-ad3e-286daf3b4967","f8ab36fc-bc72-48f2-a425-9f3e042f2272","b4ee5f56-1514-428f-b517-37576cea076b","NONE","https:\u002F\u002Fieeexplore.ieee.org\u002Fxpl\u002Fconhome\u002F1000213\u002Fall-proceedings",{"impactFactor":73,"impactFactorByYear":74,"i10Index":73,"i10IndexLast5Year":73,"totalPublication":75,"totalPublicationByYear":76,"totalCitation":73,"totalCitationByYear":78,"totalCitationPerPublication":73,"totalCitationPerPublicationByYear":79,"hindexLast5Year":73,"hindex":73},0,{},76,{"2002":77},2,{},{},{"meta":81,"data":83},{"total":82},"76",[84,197,303,395,500,591,690,796,900,1022],{"id":85,"createTime":86,"updateTime":87,"relativeEntities":88,"slug":89,"properties":90,"entityType":101,"verifyStatus":102,"verifyTime":87,"verifyNote":103,"languages":22,"translateLanguages":22,"viewCount":73,"primaryUrl":104,"fullTextUrl":105,"authors":106,"publicationType":152,"publisherRelationship":153,"citationCount":22,"citationInfo":22,"publishDate":22,"publishYear":22,"citationAnalyzeStatus":21,"lastCitationAnalyze":22,"indexDatabases":195,"openAccess":22,"references":22,"isForceReanalyzing":196},"c37dd0dd-70bd-4065-b53c-423ff0c0d35a","2023-12-20T10:58:26.294+00:00","2025-02-26T21:36:52.645+00:00",[],"Distributing-MPEG-movies-over-the-Internet-using-programmable-networks",{"abstract":91,"title":93,"keywords":95,"references":97,"doi":99},{"EN":92},"Distributing video over the Internet is an increasingly important application. Nevertheless, the real-time and high bandwidth requirements of video make video distribution over today's Internet a challenge. Adaptive approaches can be used to respond to changes in bandwidth availability while limiting the effect of such changes on perceptual quality and resource consumption. Nevertheless, most existing adaptation mechanisms have limited scalability and do not effectively exploit the heterogeneity of the Internet. In this paper, we describe the design and implementation of a MPEG video broadcasting service based on active networks. In an active network, routers can be programmed to make routing decisions based on local conditions. Because decisions are made locally, adaptation reacts rapidly to changing conditions and is unaffected by conditions elsewhere in the network. Programmability allows the adaptation policy to be tuned to the structure of the transmitted data, and to the properties of local clients. We use the PLAN-P domain-specific language for programming active routers; this language provides high-level abstractions and safety guarantees that allow complex protocols to be developed rapidly and reliably. Our experiments show that our approach to video distribution permits the decoding of up to 9 times as many frames in a heavily loaded network as distribution using standard routers.",{"EN":94},"Distributing MPEG movies over the Internet using programmable networks",{"EN":96},"Motion pictures,IP networks,Internet,Bandwidth,Availability,Scalability,Multimedia communication,Broadcasting,Routing,Domain specific languages",{"VOID":98},"10.1109\u002FINFCOM.1999.751668\n10.1109\u002FINFCOM.2000.832477\n10.1109\u002FINFCOM.1998.665078\nmccanne, 1996, Receiver-driven layered multicast, SIGCOMM Symposium on Communications Architectures and Protocols, 117\npark, 1998, AFEC: An adaptive forward error correction protocol for end-to-end transport of real-time traffic, Proceedings of the IEEE International Conference on Computer Communications and Networks, 196, 10.1109\u002FICCCN.1998.998777\n10.1145\u002F378344.378345\n10.1109\u002F35.568214\n10.1109\u002FRELDIS.1998.740484\n10.1109\u002FICDCS.1999.776525\n10.1145\u002F319151.319156\ncen, 1998, Flow and congestion control for internet streaming applications, Proc Multimedia Computing and Networking 1998 (MMCN 98)\n10.1145\u002F190314.190320\n10.1109\u002F83.660992\n10.1145\u002F234782.234794\nfassino, 2002, Think: a software framework for component-based operating system kernels, Proceedings of 2002 USENIX Annual Technical Conference\n10.1109\u002FINFCOM.1997.644495\n10.1145\u002F217279.215277\namir, 1998, An active service framework and its application to real-time multimedia transcoding, SIGCOMM Symposium on Communications Architectures and Protocols\n10.1145\u002F289423.289431\n10.1109\u002FOPNARC.1998.662048",{"VOID":100},"10.1109\u002FICDCS.2002.1022253","PUBLICATION","VERIFIED","Auto Verify","https:\u002F\u002Fieeexplore.ieee.org\u002Fabstract\u002Fdocument\u002F1022253\u002F","https:\u002F\u002Fieeexplore.ieee.org\u002Fstamp\u002Fstamp.jsp?tp=&arnumber=1022253",[107,123,137],{"id":108,"sortIndex":73,"researcher":22,"roles":109,"affiliations":111,"properties":120,"displayName":122,"givenName":22,"familyName":22},"e0976f29-d9a8-409f-9b69-b5a9ac1248b8",[110],"AUTHOR",[112],{"id":113,"sortIndex":73,"affiliation":114,"properties":22},"0b28832f-b18c-4060-ba25-03f306e01780",{"id":113,"createTime":22,"updateTime":22,"relativeEntities":115,"slug":22,"properties":116,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":119,"statistic":22},[],{"title":117},{"VI":118},"COMPOSE group, INRIA-LaBRI, Talence, France",[],{"title":121},{"VI":122},"D. He",{"id":124,"sortIndex":125,"researcher":22,"roles":126,"affiliations":127,"properties":134,"displayName":136,"givenName":22,"familyName":22},"46e35421-c976-4751-b90f-c569d0e80b2b",1,[110],[128],{"id":113,"sortIndex":73,"affiliation":129,"properties":22},{"id":113,"createTime":22,"updateTime":22,"relativeEntities":130,"slug":22,"properties":131,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":133,"statistic":22},[],{"title":132},{"VI":118},[],{"title":135},{"VI":136},"G. Muller",{"id":138,"sortIndex":77,"researcher":22,"roles":139,"affiliations":140,"properties":149,"displayName":151,"givenName":22,"familyName":22},"bd535559-8f74-4547-a3df-9c75b6f96b40",[110],[141],{"id":142,"sortIndex":73,"affiliation":143,"properties":22},"18fe1721-8c61-45cf-97ab-e903d00c6a2f",{"id":142,"createTime":22,"updateTime":22,"relativeEntities":144,"slug":22,"properties":145,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":148,"statistic":22},[],{"title":146},{"VI":147},"University of Copenhagen, Copenhagen, Denmark",[],{"title":150},{"VI":151},"J.L. Lawall","ARTICLE",{"url":104,"publisher":154,"properties":192},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":155,"slug":10,"properties":156,"entityType":20,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":23,"subjectFields":160,"manageAffiliations":173,"indexDatabases":179,"url":71,"thumbnailPath":22,"statistic":187,"gsStatistic":22,"type":22,"analyzePriority":22},[],{"issn":157,"title":158,"country":159},{"VOID":15},{"EN":17},{"VOID":13},[161,165,169],{"id":26,"createTime":22,"updateTime":22,"relativeEntities":162,"label":163,"description":164,"parentId":22,"standard":22,"scholarHubFieldId":22},[],{"EN":29},{},{"id":32,"createTime":22,"updateTime":22,"relativeEntities":166,"label":167,"description":168,"parentId":22,"standard":22,"scholarHubFieldId":22},[],{"EN":35},{},{"id":38,"createTime":22,"updateTime":22,"relativeEntities":170,"label":171,"description":172,"parentId":22,"standard":22,"scholarHubFieldId":22},[],{"EN":41},{},[174],{"id":45,"createTime":22,"updateTime":22,"relativeEntities":175,"slug":22,"properties":176,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":178,"statistic":22},[],{"title":177},{"EN":49},[],[180],{"id":53,"indexDatabase":181,"url":64,"indexYears":65,"academicFieldIds":186,"indexDatabaseRanking":70},{"id":55,"createTime":22,"updateTime":22,"relativeEntities":182,"label":183,"description":184,"key":61,"publicationTags":185,"standard":22},[],{"EN":58,"VI":58},{"EN":58,"VI":60},[63],[67,68,69],{"impactFactor":73,"impactFactorByYear":188,"i10Index":73,"i10IndexLast5Year":73,"totalPublication":75,"totalPublicationByYear":189,"totalCitation":73,"totalCitationByYear":190,"totalCitationPerPublication":73,"totalCitationPerPublicationByYear":191,"hindexLast5Year":73,"hindex":73},{},{"2002":77},{},{},{"pages":193},{"VOID":194},"161-170",[],false,{"id":198,"createTime":199,"updateTime":200,"relativeEntities":201,"slug":202,"properties":203,"entityType":101,"verifyStatus":102,"verifyTime":200,"verifyNote":103,"languages":22,"translateLanguages":22,"viewCount":73,"primaryUrl":214,"fullTextUrl":215,"authors":216,"publicationType":152,"publisherRelationship":260,"citationCount":22,"citationInfo":22,"publishDate":22,"publishYear":22,"citationAnalyzeStatus":21,"lastCitationAnalyze":22,"indexDatabases":302,"openAccess":22,"references":22,"isForceReanalyzing":196},"384eeb64-51d7-4578-b4fb-dc394eb57827","2023-12-20T10:55:43.769+00:00","2025-02-26T09:38:38.855+00:00",[],"Anthill-a-framework-for-the-development-of-agent-based-peer-to-peer-systems",{"abstract":204,"title":206,"keywords":208,"references":210,"doi":212},{"EN":205},"Recent peer-to-peer (P2P) systems are characterized by decentralized control, large scale and extreme dynamism of their operating environment. As such, they can be seen as instances of complex adaptive systems (CAS) typically found in biological and social sciences. We describe Anthill, a framework to support the design, implementation and evaluation of P2P applications based on ideas such as multi-agent and evolutionary programming borrowed from CAS. An Anthill system consists of a dynamic network of peer nodes; societies of adaptive agents travel through this network, interacting with nodes and cooperating with other agents in order to solve complex problems. Anthill can be used to construct different classes of P2P services that exhibit resilience, adaptation and self-organization properties. We also describe preliminary experiences with Anthill in implementing a file sharing application.",{"EN":207},"Anthill: a framework for the development of agent-based peer-to-peer systems",{"EN":209},"Peer to peer computing,Content addressable storage,Distributed computing,Grid computing,Adaptive systems,Centralized control,Distributed control,Large-scale systems,Biology,Resource management",{"VOID":211},"freenet, 2001, Peer-to-Peer Harnessing the Benefits of a Disruptive Technology\nminar, 1996, The Swarm Simulation System, A Toolkit for Building Multi-Agent Simulations, Technical report Swarm Development Group\nmitchell, 1998, An Introduction to Genetic Algorithms, 10.7551\u002Fmitpress\u002F3927.001.0001\n0, Peer-to-Peer Working Group\n10.1145\u002F383059.383072\n10.1145\u002F502034.502053\nshirky, 2001, Listening to Napster, Peer-to-Peer Harnessing the Benefits of a Disruptive Technology\nweiss, 1999, Multiagent Systems A Modern Approach to Distributed Artificial Intelligence\n10.1109\u002FHOTOS.2001.990065\nbonabeau, 1999, Swarm Intelli-gence From Natural to Artificial Systems, 10.1093\u002Foso\u002F9780195131581.001.0001\nhorling, 2000, Multi-Agent System Simulation Framework, Proc of the 16th IMACS World Congress 2000 on Scientific Computation Applied Mathematics and Simulation\n10.1007\u002FBF02223791\ngnutella, 2001, Peer-to-Peer Harnessing the Benefits of a Disruptive Technology\n0, Project JXTA\nbabaoglu, 2002, Gnutant: Free-Text Searching in Peer-to-Peer Systems, Technical Report UBLCS-02–05 Dept of Computer Science\nanderson, 2001, SETI@home, Peer-to-Peer Harnessing the Benefits of a Disruptive Technology\n10.1145\u002F378993.379239",{"VOID":213},"10.1109\u002FICDCS.2002.1022238","https:\u002F\u002Fieeexplore.ieee.org\u002Fabstract\u002Fdocument\u002F1022238\u002F","https:\u002F\u002Fieeexplore.ieee.org\u002Fstamp\u002Fstamp.jsp?tp=&arnumber=1022238",[217,232,247],{"id":218,"sortIndex":73,"researcher":22,"roles":219,"affiliations":220,"properties":229,"displayName":231,"givenName":22,"familyName":22},"61107a6e-2dfd-4a58-80e0-5f92abf06c03",[110],[221],{"id":222,"sortIndex":73,"affiliation":223,"properties":22},"647d7126-64e5-4b4f-84a4-9136df30c3ec",{"id":222,"createTime":22,"updateTime":22,"relativeEntities":224,"slug":22,"properties":225,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":228,"statistic":22},[],{"title":226},{"VI":227},"Department of Computer Science, University of Bologna, Bologna, Italy",[],{"title":230},{"VI":231},"O. Babaoglu",{"id":233,"sortIndex":125,"researcher":22,"roles":234,"affiliations":235,"properties":244,"displayName":246,"givenName":22,"familyName":22},"9fd4dd1f-88dc-4626-918b-b18d33c8d470",[110],[236],{"id":237,"sortIndex":73,"affiliation":238,"properties":22},"1ef1522d-0c8f-4e33-809f-82b60f2495c7",{"id":237,"createTime":22,"updateTime":22,"relativeEntities":239,"slug":22,"properties":240,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":243,"statistic":22},[],{"title":241},{"VI":242},"Department of Telematics, Norwegian University of Science and Technology, Trondheim, Norway",[],{"title":245},{"VI":246},"H. Meling",{"id":248,"sortIndex":77,"researcher":22,"roles":249,"affiliations":250,"properties":257,"displayName":259,"givenName":22,"familyName":22},"c7ea23be-f97d-49f8-9f9c-fec8883211b6",[110],[251],{"id":222,"sortIndex":73,"affiliation":252,"properties":22},{"id":222,"createTime":22,"updateTime":22,"relativeEntities":253,"slug":22,"properties":254,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":256,"statistic":22},[],{"title":255},{"VI":227},[],{"title":258},{"VI":259},"A. Montresor",{"url":214,"publisher":261,"properties":299},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":262,"slug":10,"properties":263,"entityType":20,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":23,"subjectFields":267,"manageAffiliations":280,"indexDatabases":286,"url":71,"thumbnailPath":22,"statistic":294,"gsStatistic":22,"type":22,"analyzePriority":22},[],{"issn":264,"title":265,"country":266},{"VOID":15},{"EN":17},{"VOID":13},[268,272,276],{"id":26,"createTime":22,"updateTime":22,"relativeEntities":269,"label":270,"description":271,"parentId":22,"standard":22,"scholarHubFieldId":22},[],{"EN":29},{},{"id":32,"createTime":22,"updateTime":22,"relativeEntities":273,"label":274,"description":275,"parentId":22,"standard":22,"scholarHubFieldId":22},[],{"EN":35},{},{"id":38,"createTime":22,"updateTime":22,"relativeEntities":277,"label":278,"description":279,"parentId":22,"standard":22,"scholarHubFieldId":22},[],{"EN":41},{},[281],{"id":45,"createTime":22,"updateTime":22,"relativeEntities":282,"slug":22,"properties":283,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":285,"statistic":22},[],{"title":284},{"EN":49},[],[287],{"id":53,"indexDatabase":288,"url":64,"indexYears":65,"academicFieldIds":293,"indexDatabaseRanking":70},{"id":55,"createTime":22,"updateTime":22,"relativeEntities":289,"label":290,"description":291,"key":61,"publicationTags":292,"standard":22},[],{"EN":58,"VI":58},{"EN":58,"VI":60},[63],[67,68,69],{"impactFactor":73,"impactFactorByYear":295,"i10Index":73,"i10IndexLast5Year":73,"totalPublication":75,"totalPublicationByYear":296,"totalCitation":73,"totalCitationByYear":297,"totalCitationPerPublication":73,"totalCitationPerPublicationByYear":298,"hindexLast5Year":73,"hindex":73},{},{"2002":77},{},{},{"pages":300},{"VOID":301},"15-22",[],{"id":304,"createTime":305,"updateTime":306,"relativeEntities":307,"slug":308,"properties":309,"entityType":101,"verifyStatus":102,"verifyTime":320,"verifyNote":103,"languages":22,"translateLanguages":22,"viewCount":77,"primaryUrl":321,"fullTextUrl":322,"authors":323,"publicationType":152,"publisherRelationship":352,"citationCount":22,"citationInfo":22,"publishDate":22,"publishYear":22,"citationAnalyzeStatus":21,"lastCitationAnalyze":22,"indexDatabases":394,"openAccess":22,"references":22,"isForceReanalyzing":196},"540f58a6-7d46-4925-b473-09bf6b9e6ca3","2023-12-20T11:07:22.704+00:00","2025-02-25T17:34:51.277+00:00",[],"Timestamping-messages-in-synchronous-computations",{"abstract":310,"title":312,"keywords":314,"references":316,"doi":318},{"EN":311},"We present a method of timestamping messages and events in synchronous computations that capture the order relationship with vectors of size less than or equal to the size of the vertex cover of the communication topology of the system. Our method is fundamentally different from the techniques of Fidge (1989) and Mattern (1989). The timestamps in our method do not use one component per process but still guarantee that the order relationship is captured accurately. Our algorithm is online and only requires piggybacking of timestamps on program messages. It is applicable to all programs that either use programming languages based on synchronous communication such as CSP or use synchronous remote procedure calls.",{"EN":313},"Timestamping messages in synchronous computations",{"EN":315},"Distributed computing,Clocks,Concurrent computing,Asynchronous communication,Topology,Programming profession,Remote monitoring,Visualization,Debugging,Fault tolerance",{"VOID":317},"0, IBM Corporation IBM Distributed Debugger\nkohl, 1995, The pvm3.4 tracing facility and xpvm 1.1, Technical report Comp Science and Math Division Oak Ridge National Lab\n10.1093\u002Fcomjnl\u002F40.8.499\n10.1145\u002F359545.359563\nmattern, 1989, Virtual time and global states of distributed systems, Proceedings of the International Workshop on Parallel and Distributed Algorithms, 215\n10.1109\u002FISADS.1995.398974\n10.1016\u002F0012-365X(79)90082-7\n10.1016\u002F0020-0190(92)90028-T\n10.1145\u002F3959.3962\n10.1007\u002F3-540-61769-8_6\n10.2307\u002F2371374\n10.2307\u002F1969503\ngarey, 1979, Computers and Intractability A Guide to the Theory of NP-Completeness\nfidge, 1989, Partial orders for parallel debugging, Proceedings of the ACM SIGPLAN\u002FSIGOPS Workshop on Parallel and Distributed Debugging, 183\n10.1109\u002F71.277788\n10.1145\u002F383962.383988\n10.1109\u002FICDCS.1996.507907\n10.1007\u002Fs004460050018\nhoare, 1985, Communicating Sequential Processes\ntrotter, 1992, Combinatorics and Partially Ordered Sets: Dimension Theory\n10.1109\u002FICDSC.2001.918989\nward, 2000, A framework algorithm for dynamic, centralized, dimension-bounded timestamps, Proceedings of the 2000 CAS Conference\n10.1137\u002F0603036",{"VOID":319},"10.1109\u002FICDCS.2002.1022305","2025-02-25T17:34:51.276+00:00","https:\u002F\u002Fieeexplore.ieee.org\u002Fabstract\u002Fdocument\u002F1022305\u002F","https:\u002F\u002Fieeexplore.ieee.org\u002Fstamp\u002Fstamp.jsp?tp=&arnumber=1022305",[324,339],{"id":325,"sortIndex":73,"researcher":22,"roles":326,"affiliations":327,"properties":336,"displayName":338,"givenName":22,"familyName":22},"a55d375c-8173-42cb-a22c-45a9fb674c16",[110],[328],{"id":329,"sortIndex":73,"affiliation":330,"properties":22},"f9109827-dd84-42ab-b6ba-f193a9b357d7",{"id":329,"createTime":22,"updateTime":22,"relativeEntities":331,"slug":22,"properties":332,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":335,"statistic":22},[],{"title":333},{"VI":334},"Electrical and Computer Engineering Department, University of Texas, Austin, Austin, USA",[],{"title":337},{"VI":338},"V.K. Garg",{"id":340,"sortIndex":125,"researcher":22,"roles":341,"affiliations":342,"properties":349,"displayName":351,"givenName":22,"familyName":22},"2dabe8c2-103e-4b0c-b20e-8ccd48b5e84d",[110],[343],{"id":329,"sortIndex":73,"affiliation":344,"properties":22},{"id":329,"createTime":22,"updateTime":22,"relativeEntities":345,"slug":22,"properties":346,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":348,"statistic":22},[],{"title":347},{"VI":334},[],{"title":350},{"VI":351},"C. Skawratananond",{"url":321,"publisher":353,"properties":391},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":354,"slug":10,"properties":355,"entityType":20,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":23,"subjectFields":359,"manageAffiliations":372,"indexDatabases":378,"url":71,"thumbnailPath":22,"statistic":386,"gsStatistic":22,"type":22,"analyzePriority":22},[],{"issn":356,"title":357,"country":358},{"VOID":15},{"EN":17},{"VOID":13},[360,364,368],{"id":26,"createTime":22,"updateTime":22,"relativeEntities":361,"label":362,"description":363,"parentId":22,"standard":22,"scholarHubFieldId":22},[],{"EN":29},{},{"id":32,"createTime":22,"updateTime":22,"relativeEntities":365,"label":366,"description":367,"parentId":22,"standard":22,"scholarHubFieldId":22},[],{"EN":35},{},{"id":38,"createTime":22,"updateTime":22,"relativeEntities":369,"label":370,"description":371,"parentId":22,"standard":22,"scholarHubFieldId":22},[],{"EN":41},{},[373],{"id":45,"createTime":22,"updateTime":22,"relativeEntities":374,"slug":22,"properties":375,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":377,"statistic":22},[],{"title":376},{"EN":49},[],[379],{"id":53,"indexDatabase":380,"url":64,"indexYears":65,"academicFieldIds":385,"indexDatabaseRanking":70},{"id":55,"createTime":22,"updateTime":22,"relativeEntities":381,"label":382,"description":383,"key":61,"publicationTags":384,"standard":22},[],{"EN":58,"VI":58},{"EN":58,"VI":60},[63],[67,68,69],{"impactFactor":73,"impactFactorByYear":387,"i10Index":73,"i10IndexLast5Year":73,"totalPublication":75,"totalPublicationByYear":388,"totalCitation":73,"totalCitationByYear":389,"totalCitationPerPublication":73,"totalCitationPerPublicationByYear":390,"hindexLast5Year":73,"hindex":73},{},{"2002":77},{},{},{"pages":392},{"VOID":393},"552-559",[],{"id":396,"createTime":397,"updateTime":398,"relativeEntities":399,"slug":400,"properties":401,"entityType":101,"verifyStatus":102,"verifyTime":398,"verifyNote":103,"languages":22,"translateLanguages":22,"viewCount":412,"primaryUrl":413,"fullTextUrl":414,"authors":415,"publicationType":152,"publisherRelationship":457,"citationCount":22,"citationInfo":22,"publishDate":22,"publishYear":22,"citationAnalyzeStatus":21,"lastCitationAnalyze":22,"indexDatabases":499,"openAccess":22,"references":22,"isForceReanalyzing":196},"1f5f01a4-194f-44f1-b451-32839fb26cc6","2023-12-20T11:07:14.198+00:00","2025-02-25T10:32:32.999+00:00",[],"Version-stamps-decentralized-version-vectors",{"abstract":402,"title":404,"keywords":406,"references":408,"doi":410},{"EN":403},"Version vectors and their variants play a central role in update tracking in optimistic distributed systems. Existing mechanisms for a variable number of participants use a mapping from identities to integers, and rely on some form of global configuration or distributed naming protocol to assign unique identifiers to each participant. These approaches are incompatible with replica creation under arbitrary partitions, a typical mode of operation in mobile or poorly connected environments. We present an update tracking mechanism that overcomes this limitation; it departs from the traditional mapping and avoids the use of integer counters, while providing all the functionality of version vectors in what concerns version tracking.",{"EN":405},"Version stamps-decentralized version vectors",{"EN":407},"Clocks,Counting circuits,Protocols,Distributed computing,Mobile computing,Synchronization,Message passing",{"VOID":409},"10.1145\u002F359545.359563\nmattern, 1989, Virtual time and global clocks in distributed systems, Proc Workshop Parallel and Distributed Algorithms, 215\n10.1145\u002F566739.566741\n10.1109\u002FTSE.1983.236733\n10.1145\u002F268998.266711\nratner, 1997, Dynamic version vector maintenance, Technical Report CSD-970022 Department of Computer Science\n10.1007\u002FBF02277859\n10.1016\u002F0022-0000(78)90048-X\n10.1007\u002Fs004460050065\nbutrico, 1998, Data synchronization in mobile network computer - reference specification, WMR'98 ECOOP'98 Workshop Reader\nbaquero, 1999, Causality in autonomous mobile systems, Third European Research Seminar on Advances in Distributed Systems Broadcast EPFL-LSE\nfidge, 1989, Timestamps in message-passing systems that preserve the partial ordering, 11th Australian Computer Science Conference, 55\n10.1016\u002F0020-0190(91)90055-M\n10.1109\u002FICDCS.1989.37933\n10.1145\u002F1321400.1321402\n10.1109\u002FICDCS.2002.1022304\n10.1145\u002F566726.566729\n10.1145\u002F365628.365655",{"VOID":411},"10.1109\u002FICDCS.2002.1022304",3,"https:\u002F\u002Fieeexplore.ieee.org\u002Fabstract\u002Fdocument\u002F1022304\u002F","https:\u002F\u002Fieeexplore.ieee.org\u002Fstamp\u002Fstamp.jsp?tp=&arnumber=1022304",[416,431,444],{"id":417,"sortIndex":73,"researcher":22,"roles":418,"affiliations":419,"properties":428,"displayName":430,"givenName":22,"familyName":22},"00cfd79f-a3c7-4c10-816e-f0a2683e797d",[110],[420],{"id":421,"sortIndex":73,"affiliation":422,"properties":22},"901b82ae-3ee2-43c1-8f19-7f02ed474689",{"id":421,"createTime":22,"updateTime":22,"relativeEntities":423,"slug":22,"properties":424,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":427,"statistic":22},[],{"title":425},{"VI":426},"Departamento Informatica, Universidade do Minho, Braga, Portugal",[],{"title":429},{"VI":430},"P.S. Almeida",{"id":432,"sortIndex":125,"researcher":22,"roles":433,"affiliations":434,"properties":441,"displayName":443,"givenName":22,"familyName":22},"a85ce80e-21b8-49e4-a1b9-79360a961595",[110],[435],{"id":421,"sortIndex":73,"affiliation":436,"properties":22},{"id":421,"createTime":22,"updateTime":22,"relativeEntities":437,"slug":22,"properties":438,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":440,"statistic":22},[],{"title":439},{"VI":426},[],{"title":442},{"VI":443},"C. Baquero",{"id":445,"sortIndex":77,"researcher":22,"roles":446,"affiliations":447,"properties":454,"displayName":456,"givenName":22,"familyName":22},"aeed837b-cbb0-4237-ba10-57fe4dc1f201",[110],[448],{"id":421,"sortIndex":73,"affiliation":449,"properties":22},{"id":421,"createTime":22,"updateTime":22,"relativeEntities":450,"slug":22,"properties":451,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":453,"statistic":22},[],{"title":452},{"VI":426},[],{"title":455},{"VI":456},"V. Fonte",{"url":413,"publisher":458,"properties":496},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":459,"slug":10,"properties":460,"entityType":20,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":23,"subjectFields":464,"manageAffiliations":477,"indexDatabases":483,"url":71,"thumbnailPath":22,"statistic":491,"gsStatistic":22,"type":22,"analyzePriority":22},[],{"issn":461,"title":462,"country":463},{"VOID":15},{"EN":17},{"VOID":13},[465,469,473],{"id":26,"createTime":22,"updateTime":22,"relativeEntities":466,"label":467,"description":468,"parentId":22,"standard":22,"scholarHubFieldId":22},[],{"EN":29},{},{"id":32,"createTime":22,"updateTime":22,"relativeEntities":470,"label":471,"description":472,"parentId":22,"standard":22,"scholarHubFieldId":22},[],{"EN":35},{},{"id":38,"createTime":22,"updateTime":22,"relativeEntities":474,"label":475,"description":476,"parentId":22,"standard":22,"scholarHubFieldId":22},[],{"EN":41},{},[478],{"id":45,"createTime":22,"updateTime":22,"relativeEntities":479,"slug":22,"properties":480,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":482,"statistic":22},[],{"title":481},{"EN":49},[],[484],{"id":53,"indexDatabase":485,"url":64,"indexYears":65,"academicFieldIds":490,"indexDatabaseRanking":70},{"id":55,"createTime":22,"updateTime":22,"relativeEntities":486,"label":487,"description":488,"key":61,"publicationTags":489,"standard":22},[],{"EN":58,"VI":58},{"EN":58,"VI":60},[63],[67,68,69],{"impactFactor":73,"impactFactorByYear":492,"i10Index":73,"i10IndexLast5Year":73,"totalPublication":75,"totalPublicationByYear":493,"totalCitation":73,"totalCitationByYear":494,"totalCitationPerPublication":73,"totalCitationPerPublicationByYear":495,"hindexLast5Year":73,"hindex":73},{},{"2002":77},{},{},{"pages":497},{"VOID":498},"544-551",[],{"id":501,"createTime":502,"updateTime":503,"relativeEntities":504,"slug":505,"properties":506,"entityType":101,"verifyStatus":102,"verifyTime":503,"verifyNote":103,"languages":22,"translateLanguages":22,"viewCount":73,"primaryUrl":517,"fullTextUrl":518,"authors":519,"publicationType":152,"publisherRelationship":548,"citationCount":22,"citationInfo":22,"publishDate":22,"publishYear":22,"citationAnalyzeStatus":21,"lastCitationAnalyze":22,"indexDatabases":590,"openAccess":22,"references":22,"isForceReanalyzing":196},"ac7783b6-e4b4-4581-b370-3d28c0b39499","2023-12-20T11:01:21.945+00:00","2025-02-24T00:22:21.428+00:00",[],"The-complexity-of-adding-failsafe-fault-tolerance",{"abstract":507,"title":509,"keywords":511,"references":513,"doi":515},{"EN":508},"In this paper, we focus our attention on the problem of automating the addition of failsafe fault-tolerance where fault-tolerance is added to an existing (fault-intolerant) program. A failsafe fault-tolerant program satisfies its specification (including safety and liveness) in the absence of faults. And, in the presence of faults, it satisfies its safety specification. We present a somewhat unexpected result that, in general, the problem of adding failsafe fault-tolerance in distributed programs is NP-hard. Towards this end, we reduce the 3-SAT problem to the problem of adding failsafe fault-tolerance. We also identify a class of specifications, monotonic specifications and a class of programs, monotonic programs. Given a (positive) monotonic specification and a (negative) monotonic program, we show that failsafe fault-tolerance can be added in polynomial time. We note that the monotonicity restrictions are met for commonly encountered problems such as Byzantine agreement, distributed consensus, and atomic commitment. Finally, we argue that the restrictions on the specifications and programs are necessary to add failsafe fault-tolerance in polynomial time; we prove that if only one of these conditions is satisfied, the addition of failsafe fault-tolerance is still NP-hard.",{"EN":510},"The complexity of adding failsafe fault-tolerance",{"EN":512},"Fault tolerance,Safety,Polynomials,Algorithm design and analysis,Automation,Computer science,Fault tolerant systems,Engineering profession,Contracts,Fault diagnosis",{"VOID":514},"kulkarni, 2002, The complexity of adding failsafe fault-tolerance. Technical Report MSU-CSE.02–10, Computer Science and Engineering\n10.1145\u002F277697.277729\nkupferman, 1997, Synthesis with incomplete information, ICTL\n10.1145\u002F75277.75293\n10.1007\u002F3-540-58179-0_51\n10.1145\u002F152610.152612\n10.1109\u002FRELDIS.2001.969767\ngong, 1995, Byzantine agreement with authentication: Observations and applications in tolerating hybrid and link faults, Dependable Computing and Fault Tolerant Systems IEEE Comnuter Society, 10, 139\n10.1145\u002F357172.357176\n10.1109\u002F32.256850\n10.1016\u002F0020-0190(85)90056-0\nkulkarni, 2000, Automating the addition of fault-tolerance, Formal Techniques in Real-Time and Fault-Tolerant Systems, 10.1007\u002F3-540-45352-0_9\nkulkarni, 1999, Component-based design of fault-tolerance\n10.1145\u002F383043.383044",{"VOID":516},"10.1109\u002FICDCS.2002.1022271","https:\u002F\u002Fieeexplore.ieee.org\u002Fabstract\u002Fdocument\u002F1022271\u002F","https:\u002F\u002Fieeexplore.ieee.org\u002Fstamp\u002Fstamp.jsp?tp=&arnumber=1022271",[520,535],{"id":521,"sortIndex":73,"researcher":22,"roles":522,"affiliations":523,"properties":532,"displayName":534,"givenName":22,"familyName":22},"9138c988-df7d-4dc5-8b82-0573160c20bf",[110],[524],{"id":525,"sortIndex":73,"affiliation":526,"properties":22},"826dee5f-891c-46f1-afbd-33cd1379c032",{"id":525,"createTime":22,"updateTime":22,"relativeEntities":527,"slug":22,"properties":528,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":531,"statistic":22},[],{"title":529},{"VI":530},"Department of Computer Science and Engineering, Michigan State University, East Lansing, MI, USA",[],{"title":533},{"VI":534},"S.S. Kulkarni",{"id":536,"sortIndex":125,"researcher":22,"roles":537,"affiliations":538,"properties":545,"displayName":547,"givenName":22,"familyName":22},"68bc6277-4fc4-4a4e-ad57-f3415396433c",[110],[539],{"id":525,"sortIndex":73,"affiliation":540,"properties":22},{"id":525,"createTime":22,"updateTime":22,"relativeEntities":541,"slug":22,"properties":542,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":544,"statistic":22},[],{"title":543},{"VI":530},[],{"title":546},{"VI":547},"A. Ebnenasir",{"url":517,"publisher":549,"properties":587},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":550,"slug":10,"properties":551,"entityType":20,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":23,"subjectFields":555,"manageAffiliations":568,"indexDatabases":574,"url":71,"thumbnailPath":22,"statistic":582,"gsStatistic":22,"type":22,"analyzePriority":22},[],{"issn":552,"title":553,"country":554},{"VOID":15},{"EN":17},{"VOID":13},[556,560,564],{"id":26,"createTime":22,"updateTime":22,"relativeEntities":557,"label":558,"description":559,"parentId":22,"standard":22,"scholarHubFieldId":22},[],{"EN":29},{},{"id":32,"createTime":22,"updateTime":22,"relativeEntities":561,"label":562,"description":563,"parentId":22,"standard":22,"scholarHubFieldId":22},[],{"EN":35},{},{"id":38,"createTime":22,"updateTime":22,"relativeEntities":565,"label":566,"description":567,"parentId":22,"standard":22,"scholarHubFieldId":22},[],{"EN":41},{},[569],{"id":45,"createTime":22,"updateTime":22,"relativeEntities":570,"slug":22,"properties":571,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":573,"statistic":22},[],{"title":572},{"EN":49},[],[575],{"id":53,"indexDatabase":576,"url":64,"indexYears":65,"academicFieldIds":581,"indexDatabaseRanking":70},{"id":55,"createTime":22,"updateTime":22,"relativeEntities":577,"label":578,"description":579,"key":61,"publicationTags":580,"standard":22},[],{"EN":58,"VI":58},{"EN":58,"VI":60},[63],[67,68,69],{"impactFactor":73,"impactFactorByYear":583,"i10Index":73,"i10IndexLast5Year":73,"totalPublication":75,"totalPublicationByYear":584,"totalCitation":73,"totalCitationByYear":585,"totalCitationPerPublication":73,"totalCitationPerPublicationByYear":586,"hindexLast5Year":73,"hindex":73},{},{"2002":77},{},{},{"pages":588},{"VOID":589},"337-344",[],{"id":592,"createTime":593,"updateTime":594,"relativeEntities":595,"slug":596,"properties":597,"entityType":101,"verifyStatus":102,"verifyTime":594,"verifyNote":103,"languages":22,"translateLanguages":22,"viewCount":73,"primaryUrl":608,"fullTextUrl":609,"authors":610,"publicationType":152,"publisherRelationship":647,"citationCount":22,"citationInfo":22,"publishDate":22,"publishYear":22,"citationAnalyzeStatus":21,"lastCitationAnalyze":22,"indexDatabases":689,"openAccess":22,"references":22,"isForceReanalyzing":196},"cf5fb5f6-af06-444d-b178-b0e5e175fe78","2023-12-20T11:00:30.855+00:00","2025-02-20T12:51:26.685+00:00",[],"Query-optimization-to-meet-performance-targets-for-wide-area-applications",{"abstract":598,"title":600,"keywords":602,"references":604,"doi":606},{"EN":599},"Recent technology advances have enabled mediated query processing with Internet accessible WebSources. A characteristic of WebSources is that their access costs exhibit transient behavior These costs depend on the network and server workloads, which are often affected by, the time of day,, day, etc. Given transient behavior, an appropriate performance target (PT) for a noisy, environment will correspond to \"at least X percentage of queries will have a latency of less than T units of time\". In this paper we propose an optimizer strategy that is sensitive to the objective of meeting such performance targets (PT). For each query plan, a PT sensitive optimizer uses both the expected value of the cost distribution of the plan, as well as the expected delay, of the plan. We validate our strategy using a simulation based study of the optimizers behavior. We also experimentally validate the optimizer using traces of access costs for real WebSources.",{"EN":601},"Query optimization to meet performance targets for wide area applications",{"EN":603},"Query processing,Delay,Network servers,Cost function,Internet,Educational institutions,Web server,Working environment noise,Network topology,Telegraphy",{"VOID":605},"bouganim, 2000, A dynamic query processing architecture for data integration systems, IEEE Data Engineering Bulletin\n10.1145\u002F342009.335420\ngruser, 2000, Learning response time for websources using query feedback and application in query optimization, VLDB Journal, 9, 10.1007\u002Fs007780050081\nbuttazzo, 1997, Hard Real-Time Computing Systems\nhaas, 1999, Ripple joins for online ag-gregation, SIGMOD Conf, 10.1145\u002F304181.304208\nbright, 1999, A comparison of a web prediction tool and a neural network in learning response times for websources using query feedback, CoopIS Conf\nhellerstein, 2000, Adaptive query processing: Technology in evolution, IEEE Data Engineering Bulletin, 23\n0, EPA Toxic Releases Inventory Database\n10.1145\u002F303976.303990\nantoshenkov, 1993, Query processing in dec rdb: Major issues and future challenges, Data Engineering Bul-letin, 16, 42\n0, Landings Aviation Search Engines\n10.1023\u002FA:1008646115473",{"VOID":607},"10.1109\u002FICDCS.2002.1022264","https:\u002F\u002Fieeexplore.ieee.org\u002Fabstract\u002Fdocument\u002F1022264\u002F","https:\u002F\u002Fieeexplore.ieee.org\u002Fstamp\u002Fstamp.jsp?tp=&arnumber=1022264",[611,629],{"id":612,"sortIndex":73,"researcher":22,"roles":613,"affiliations":614,"properties":626,"displayName":628,"givenName":22,"familyName":22},"51b602c5-0aa9-4491-8620-fb82a395d4b6",[110],[615],{"id":616,"sortIndex":73,"affiliation":617,"properties":623},"11f150e1-39bb-4523-8e2a-abdd674e2a66",{"id":616,"createTime":22,"updateTime":22,"relativeEntities":618,"slug":22,"properties":619,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":622,"statistic":22},[],{"title":620},{"EN":621},"University of Pittsburgh, Pittsburgh, United States",[],{"title":624},{"VI":625},"University of Pittsburgh, Pittsburgh, USA",{"title":627},{"VI":628},"V. Zadorozhny",{"id":630,"sortIndex":125,"researcher":22,"roles":631,"affiliations":632,"properties":644,"displayName":646,"givenName":22,"familyName":22},"7fb74aa5-080c-4d88-a6d1-79c4fb34b9aa",[110],[633],{"id":634,"sortIndex":73,"affiliation":635,"properties":641},"97390c4b-a31d-45b3-adad-5ac948cdc393",{"id":634,"createTime":22,"updateTime":22,"relativeEntities":636,"slug":22,"properties":637,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":640,"statistic":22},[],{"title":638},{"EN":639},"University of Maryland, College Park, MD, United States",[],{"title":642},{"VI":643},"University of Maryland, College Park, MD, USA",{"title":645},{"VI":646},"L. Raschid",{"url":608,"publisher":648,"properties":686},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":649,"slug":10,"properties":650,"entityType":20,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":23,"subjectFields":654,"manageAffiliations":667,"indexDatabases":673,"url":71,"thumbnailPath":22,"statistic":681,"gsStatistic":22,"type":22,"analyzePriority":22},[],{"issn":651,"title":652,"country":653},{"VOID":15},{"EN":17},{"VOID":13},[655,659,663],{"id":26,"createTime":22,"updateTime":22,"relativeEntities":656,"label":657,"description":658,"parentId":22,"standard":22,"scholarHubFieldId":22},[],{"EN":29},{},{"id":32,"createTime":22,"updateTime":22,"relativeEntities":660,"label":661,"description":662,"parentId":22,"standard":22,"scholarHubFieldId":22},[],{"EN":35},{},{"id":38,"createTime":22,"updateTime":22,"relativeEntities":664,"label":665,"description":666,"parentId":22,"standard":22,"scholarHubFieldId":22},[],{"EN":41},{},[668],{"id":45,"createTime":22,"updateTime":22,"relativeEntities":669,"slug":22,"properties":670,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":672,"statistic":22},[],{"title":671},{"EN":49},[],[674],{"id":53,"indexDatabase":675,"url":64,"indexYears":65,"academicFieldIds":680,"indexDatabaseRanking":70},{"id":55,"createTime":22,"updateTime":22,"relativeEntities":676,"label":677,"description":678,"key":61,"publicationTags":679,"standard":22},[],{"EN":58,"VI":58},{"EN":58,"VI":60},[63],[67,68,69],{"impactFactor":73,"impactFactorByYear":682,"i10Index":73,"i10IndexLast5Year":73,"totalPublication":75,"totalPublicationByYear":683,"totalCitation":73,"totalCitationByYear":684,"totalCitationPerPublication":73,"totalCitationPerPublicationByYear":685,"hindexLast5Year":73,"hindex":73},{},{"2002":77},{},{},{"pages":687},{"VOID":688},"271-279",[],{"id":691,"createTime":692,"updateTime":693,"relativeEntities":694,"slug":695,"properties":696,"entityType":101,"verifyStatus":102,"verifyTime":693,"verifyNote":103,"languages":22,"translateLanguages":22,"viewCount":73,"primaryUrl":707,"fullTextUrl":708,"authors":709,"publicationType":152,"publisherRelationship":753,"citationCount":22,"citationInfo":22,"publishDate":22,"publishYear":22,"citationAnalyzeStatus":21,"lastCitationAnalyze":22,"indexDatabases":795,"openAccess":22,"references":22,"isForceReanalyzing":196},"3fae4b99-4836-4b53-b049-903387bb5ad3","2023-12-20T10:58:22.844+00:00","2025-02-18T15:20:04.198+00:00",[],"Accelerating-Internet-streaming-media-delivery-using-network-aware-partial-caching",{"abstract":697,"title":699,"keywords":701,"references":703,"doi":705},{"EN":698},"Internet streaming applications are affected by adverse network conditions such as high packet loss rates and long delays. This paper aims at mitigating such effects by leveraging the availability of client-side caching proxies. We present a novel caching architecture and associated cache management algorithms that turn edge caches into accelerators of streaming media delivery. A salient feature of our caching algorithms is that they allow partial caching of streaming media objects and joint delivery of content from caches and origin servers. The caching algorithms we propose are both network-aware and stream-aware; they take into account the popularity of streaming media objects, their bit-rate requirements, and the available bandwidth between clients and servers. Using realistic models of Internet bandwidth derived from proxy cache logs and measured over real Internet paths, we have conducted simulations to evaluate the performance of various cache management alternatives. Our experiments demonstrate that network-aware caching algorithms can significantly reduce service delay and improve overall stream quality. Our experiments also show that partial caching is particularly effective when bandwidth variability is not very high.",{"EN":700},"Accelerating Internet streaming media delivery using network-aware partial caching",{"EN":702},"Acceleration,IP networks,Streaming media,Internet,Bandwidth,Web server,Network servers,Computer science,Application software,Quality of service",{"VOID":704},"glossglauser, 1996, On the relevance of long-range dependence in network traffic, Proceedings of SIGCOMM, 10.1145\u002F248156.248159\nharfoush, 2001, Measuring Bottleneck Bandwidth of Targeted Path Segments, Technical Report BUCS-TR-2001-016\njin, 2000, Popularity-aware GreedyDual-size Web proxy caching algorithm, Proceedings of ICDCS\njin, 2001, GISMO: Generator of Streaming Media Objects and Workloads, Performance Evaluation Review, 29, 10.1145\u002F507553.507554\nmiao, 1999, Proxy caching for efficient video services over the Internet, Proc PV\n0, National Laboratory for Applied Network Research\n10.1145\u002F190314.190338\nreisslein, 2000, Interactive video streaming with proxy servers, Proc Int Workshop Intelligent Multimedia Computing and Networking (IMMCN)\n10.1109\u002FINFCOM.1999.752152\n10.1109\u002FINFCOM.2000.832273\n10.1145\u002F378344.378348\n10.2307\u002F310585\nacharya, 2000, Characterizing user access to videos on the World Wide Web, Proceedings of MMCN\ncao, 1997, Cost-aware WWW proxy caching algorithms, Proceedings of USITS\n10.1109\u002FSDNE.1995.470449\ncrovella, 1996, Self-similarity in World Wide Web traffic: Evidence and possible causes, Proceedings of SIGMETRICS, 10.1145\u002F233008.233038\nchesire, 2001, Measurement and analysis of a streaming workload, Proceedings of USITS\nacharya, 2000, MiddleMan: A video caching proxy server, Proceedings of NOSSDAV\n10.1109\u002F90.793002\nacharya, 1998, An experiment to characterize videos stored on the Web, Proceedings of MMCN\nsalehi, 1996, Supporting stored video: Reducing rate variability and end-to-end resource requirements through optimal smoothing, Proceedings of SIGMETRICS, 10.1145\u002F233008.233047\nschulzrinne, 1998, Real Time Streaming Protocol(RTSP), 10.17487\u002Frfc2326\nschulzrinne, 1996, RTP: A transport protocol for real-time applications\nwang, 1998, A network-conscious approach to end-to-end video delivery over wide area networks using proxy servers, Proceedings of INFOCOM\n10.1109\u002FINFCOM.1999.752149\n10.1016\u002FS0169-7552(97)00041-X\nwilliams, 1996, Removal policies in network caches for World-Wide Web documents, Proceedings of SIGCOMM",{"VOID":706},"10.1109\u002FICDCS.2002.1022252","https:\u002F\u002Fieeexplore.ieee.org\u002Fabstract\u002Fdocument\u002F1022252\u002F","https:\u002F\u002Fieeexplore.ieee.org\u002Fstamp\u002Fstamp.jsp?tp=&arnumber=1022252",[710,725,738],{"id":711,"sortIndex":73,"researcher":22,"roles":712,"affiliations":713,"properties":722,"displayName":724,"givenName":22,"familyName":22},"1463304b-84d6-4c08-9fe2-e80c7638880c",[110],[714],{"id":715,"sortIndex":73,"affiliation":716,"properties":22},"23a842f4-d750-4df2-ade3-42342f25eab9",{"id":715,"createTime":22,"updateTime":22,"relativeEntities":717,"slug":22,"properties":718,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":721,"statistic":22},[],{"title":719},{"VI":720},"Computer Science Department, Boston University, Boston, MA, USA",[],{"title":723},{"VI":724},"Shudong Jin",{"id":726,"sortIndex":125,"researcher":22,"roles":727,"affiliations":728,"properties":735,"displayName":737,"givenName":22,"familyName":22},"c3b32815-ae3e-442f-9c2b-fe05feb18d1c",[110],[729],{"id":715,"sortIndex":73,"affiliation":730,"properties":22},{"id":715,"createTime":22,"updateTime":22,"relativeEntities":731,"slug":22,"properties":732,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":734,"statistic":22},[],{"title":733},{"VI":720},[],{"title":736},{"VI":737},"A. Bestavros",{"id":739,"sortIndex":77,"researcher":22,"roles":740,"affiliations":741,"properties":750,"displayName":752,"givenName":22,"familyName":22},"6a7b93bb-a862-4ba0-92c7-09d98a25eb0e",[110],[742],{"id":743,"sortIndex":73,"affiliation":744,"properties":22},"67d73cbd-a4d6-42bf-b096-bafa44c29819",{"id":743,"createTime":22,"updateTime":22,"relativeEntities":745,"slug":22,"properties":746,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":749,"statistic":22},[],{"title":747},{"VI":748},"IBM Thomson J.Watson Research Center, Yorktown Heights, NY, USA",[],{"title":751},{"VI":752},"A. Iyengar",{"url":707,"publisher":754,"properties":792},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":755,"slug":10,"properties":756,"entityType":20,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":23,"subjectFields":760,"manageAffiliations":773,"indexDatabases":779,"url":71,"thumbnailPath":22,"statistic":787,"gsStatistic":22,"type":22,"analyzePriority":22},[],{"issn":757,"title":758,"country":759},{"VOID":15},{"EN":17},{"VOID":13},[761,765,769],{"id":26,"createTime":22,"updateTime":22,"relativeEntities":762,"label":763,"description":764,"parentId":22,"standard":22,"scholarHubFieldId":22},[],{"EN":29},{},{"id":32,"createTime":22,"updateTime":22,"relativeEntities":766,"label":767,"description":768,"parentId":22,"standard":22,"scholarHubFieldId":22},[],{"EN":35},{},{"id":38,"createTime":22,"updateTime":22,"relativeEntities":770,"label":771,"description":772,"parentId":22,"standard":22,"scholarHubFieldId":22},[],{"EN":41},{},[774],{"id":45,"createTime":22,"updateTime":22,"relativeEntities":775,"slug":22,"properties":776,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":778,"statistic":22},[],{"title":777},{"EN":49},[],[780],{"id":53,"indexDatabase":781,"url":64,"indexYears":65,"academicFieldIds":786,"indexDatabaseRanking":70},{"id":55,"createTime":22,"updateTime":22,"relativeEntities":782,"label":783,"description":784,"key":61,"publicationTags":785,"standard":22},[],{"EN":58,"VI":58},{"EN":58,"VI":60},[63],[67,68,69],{"impactFactor":73,"impactFactorByYear":788,"i10Index":73,"i10IndexLast5Year":73,"totalPublication":75,"totalPublicationByYear":789,"totalCitation":73,"totalCitationByYear":790,"totalCitationPerPublication":73,"totalCitationPerPublicationByYear":791,"hindexLast5Year":73,"hindex":73},{},{"2002":77},{},{},{"pages":793},{"VOID":794},"153-160",[],{"id":797,"createTime":798,"updateTime":799,"relativeEntities":800,"slug":801,"properties":802,"entityType":101,"verifyStatus":102,"verifyTime":799,"verifyNote":103,"languages":22,"translateLanguages":22,"viewCount":73,"primaryUrl":813,"fullTextUrl":814,"authors":815,"publicationType":152,"publisherRelationship":857,"citationCount":22,"citationInfo":22,"publishDate":22,"publishYear":22,"citationAnalyzeStatus":21,"lastCitationAnalyze":22,"indexDatabases":899,"openAccess":22,"references":22,"isForceReanalyzing":196},"c1a5505f-4c49-4677-af92-69ca414cad0c","2023-12-20T10:58:42.739+00:00","2025-02-17T11:57:27.678+00:00",[],"A-self-stabilizing-protocol-for-pipelined-PIF-in-tree-networks",{"abstract":803,"title":805,"keywords":807,"references":809,"doi":811},{"EN":804},"Self-stabilization is a promising paradigm for achieving fault-tolerance of distributed systems. A self-stabilizing protocol can converge to its intended behavior even when it starts from any system configuration, and, thus, can tolerate any type and any number of transient faults. The PIF (propagation of information with feedback) scheme in a tree network allows the root process to broadcast its information to all other processes and to collect their responses. Many distributed systems utilize the PIF scheme as a fundamental communication scheme. This paper first formalizes the pipelined PIF in tree networks, and proposes a self-stabilizing protocol for the pipelined PIF. The protocol applies the PIF to a sequence of information in a pipelined fashion. The protocol has stabilizing time of O(h) (where h is the height of the tree network). After stabilization, it completes each PIF in O(h) asynchronous rounds and has throughput of O(1). Moreover, the protocol achieves fault-containment: for a complete binary tree network, its expected stabilizing time from 1-faulty configurations is O(1).",{"EN":806},"A self-stabilizing protocol for pipelined PIF in tree networks",{"EN":808},"Protocols,Intelligent networks,Pipeline processing,Broadcasting,Throughput,Fault tolerant systems,Feedback,Binary trees,Distributed computing,Convergence",{"VOID":810},"dolev, 2000, Self-Stabilization, 10.7551\u002Fmitpress\u002F6156.001.0001\n10.1007\u002FBF02278851\n10.1016\u002F0020-0190(96)00121-4\n10.1145\u002F248052.248057\nghosh, 1996, A fault-containing self-stabilizing algorithm for spanning trees, Information and Computation, 2, 322\n10.1109\u002FSLFSTB.1999.777486\n10.1109\u002F32.92911\n10.1145\u002F259380.259508\n10.1109\u002FICDCS.1999.776551\nnakaminami, 2001, Self-stabilizing algorithms for agent traversal on tree net-works, Technical Report COMP 2001-43 IEICE\nbui, 1999, Snapstabilizing PIF algorithm in tree networks without sense of direction, Proc of the 6th SIROCCO, 32\n10.1145\u002F167088.167256\n10.1109\u002FSLFSTB.1999.777490\nbui, 1999, Space optimal PIF algorithm: self-stabilizing with no extra space, Proc of the 18th IEEE International Performance Computing and Communication Conference, 20\n10.1016\u002F0020-0190(91)90111-T\n10.1109\u002FTSE.1982.235573\nalima, 1998, Self-stabilization with global rooted synchronizers, Proc the 18th ICDCS, 102\nafek, 1990, Memory-efficient self-stabilization on general networks, Proc the 4th WDAG(LNCS 486), 15\n10.1145\u002F361179.361202\n10.1109\u002FTIT.1983.1056620",{"VOID":812},"10.1109\u002FICDCS.2002.1022255","https:\u002F\u002Fieeexplore.ieee.org\u002Fabstract\u002Fdocument\u002F1022255\u002F","https:\u002F\u002Fieeexplore.ieee.org\u002Fstamp\u002Fstamp.jsp?tp=&arnumber=1022255",[816,831,844],{"id":817,"sortIndex":73,"researcher":22,"roles":818,"affiliations":819,"properties":828,"displayName":830,"givenName":22,"familyName":22},"74dfa95e-eb59-403e-8f42-1d131a78700a",[110],[820],{"id":821,"sortIndex":73,"affiliation":822,"properties":22},"6b8c16b9-6f07-48d2-8b1e-64a651f580ff",{"id":821,"createTime":22,"updateTime":22,"relativeEntities":823,"slug":22,"properties":824,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":827,"statistic":22},[],{"title":825},{"VI":826},"Graduate School of Information Science and Technology, Osaka University, Toyonaka, Japan",[],{"title":829},{"VI":830},"D. Kondou",{"id":832,"sortIndex":125,"researcher":22,"roles":833,"affiliations":834,"properties":841,"displayName":843,"givenName":22,"familyName":22},"de5b13d9-d3cb-4477-87c1-5832fef324d4",[110],[835],{"id":821,"sortIndex":73,"affiliation":836,"properties":22},{"id":821,"createTime":22,"updateTime":22,"relativeEntities":837,"slug":22,"properties":838,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":840,"statistic":22},[],{"title":839},{"VI":826},[],{"title":842},{"VI":843},"H. Masuda",{"id":845,"sortIndex":77,"researcher":22,"roles":846,"affiliations":847,"properties":854,"displayName":856,"givenName":22,"familyName":22},"dfb39ff3-2f0c-4b8c-9b79-c752571133a8",[110],[848],{"id":821,"sortIndex":73,"affiliation":849,"properties":22},{"id":821,"createTime":22,"updateTime":22,"relativeEntities":850,"slug":22,"properties":851,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":853,"statistic":22},[],{"title":852},{"VI":826},[],{"title":855},{"VI":856},"T. Masuzawa",{"url":813,"publisher":858,"properties":896},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":859,"slug":10,"properties":860,"entityType":20,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":23,"subjectFields":864,"manageAffiliations":877,"indexDatabases":883,"url":71,"thumbnailPath":22,"statistic":891,"gsStatistic":22,"type":22,"analyzePriority":22},[],{"issn":861,"title":862,"country":863},{"VOID":15},{"EN":17},{"VOID":13},[865,869,873],{"id":26,"createTime":22,"updateTime":22,"relativeEntities":866,"label":867,"description":868,"parentId":22,"standard":22,"scholarHubFieldId":22},[],{"EN":29},{},{"id":32,"createTime":22,"updateTime":22,"relativeEntities":870,"label":871,"description":872,"parentId":22,"standard":22,"scholarHubFieldId":22},[],{"EN":35},{},{"id":38,"createTime":22,"updateTime":22,"relativeEntities":874,"label":875,"description":876,"parentId":22,"standard":22,"scholarHubFieldId":22},[],{"EN":41},{},[878],{"id":45,"createTime":22,"updateTime":22,"relativeEntities":879,"slug":22,"properties":880,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":882,"statistic":22},[],{"title":881},{"EN":49},[],[884],{"id":53,"indexDatabase":885,"url":64,"indexYears":65,"academicFieldIds":890,"indexDatabaseRanking":70},{"id":55,"createTime":22,"updateTime":22,"relativeEntities":886,"label":887,"description":888,"key":61,"publicationTags":889,"standard":22},[],{"EN":58,"VI":58},{"EN":58,"VI":60},[63],[67,68,69],{"impactFactor":73,"impactFactorByYear":892,"i10Index":73,"i10IndexLast5Year":73,"totalPublication":75,"totalPublicationByYear":893,"totalCitation":73,"totalCitationByYear":894,"totalCitationPerPublication":73,"totalCitationPerPublicationByYear":895,"hindexLast5Year":73,"hindex":73},{},{"2002":77},{},{},{"pages":897},{"VOID":898},"181-190",[],{"id":901,"createTime":902,"updateTime":903,"relativeEntities":904,"slug":905,"properties":906,"entityType":101,"verifyStatus":102,"verifyTime":903,"verifyNote":103,"languages":22,"translateLanguages":22,"viewCount":73,"primaryUrl":917,"fullTextUrl":918,"authors":919,"publicationType":152,"publisherRelationship":979,"citationCount":22,"citationInfo":22,"publishDate":22,"publishYear":22,"citationAnalyzeStatus":21,"lastCitationAnalyze":22,"indexDatabases":1021,"openAccess":22,"references":22,"isForceReanalyzing":196},"dbfcdd03-10d9-4e03-af5c-07760361ecca","2023-12-20T11:04:06.360+00:00","2025-02-17T03:08:49.875+00:00",[],"A-fully-distributed-framework-for-cost-sensitive-data-mining",{"abstract":907,"title":909,"keywords":911,"references":913,"doi":915},{"EN":908},"We propose a fully distributed system (as compared to centralized and partially distributed systems) for cost-sensitive data mining. Experimental results have shown that this approach achieves higher accuracy than both the centralized and partially distributed learning methods, however, it incurs much less training time, neither communication nor computation overhead.",{"EN":910},"A fully distributed framework for cost-sensitive data mining",{"EN":912},"Data mining,Credit cards,Distributed computing,Machine learning,Switches,Milling machines,Rivers,Computer science,Learning systems,Relational databases",{"VOID":914},"10.1137\u002F1.9781611972726.26\nchan, 1996, An Extensible Meta-learning Approach for Scalable and Accurate Inductive Learning",{"VOID":916},"10.1109\u002FICDCS.2002.1022284","https:\u002F\u002Fieeexplore.ieee.org\u002Fabstract\u002Fdocument\u002F1022284\u002F","https:\u002F\u002Fieeexplore.ieee.org\u002Fstamp\u002Fstamp.jsp?tp=&arnumber=1022284",[920,935,948,961],{"id":921,"sortIndex":73,"researcher":22,"roles":922,"affiliations":923,"properties":932,"displayName":934,"givenName":22,"familyName":22},"95f0edfb-4f87-4bfa-a5f9-de8ad4b0e0ef",[110],[924],{"id":925,"sortIndex":73,"affiliation":926,"properties":22},"45f54af9-e143-49f7-bd14-2c798123c917",{"id":925,"createTime":22,"updateTime":22,"relativeEntities":927,"slug":22,"properties":928,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":931,"statistic":22},[],{"title":929},{"VI":930},"IBM Thomas J. Watson Research Center, Hawthorne, NY, USA",[],{"title":933},{"VI":934},"Wei Fan",{"id":936,"sortIndex":125,"researcher":22,"roles":937,"affiliations":938,"properties":945,"displayName":947,"givenName":22,"familyName":22},"257177fa-95d7-4ff4-963a-8e6116739dc9",[110],[939],{"id":925,"sortIndex":73,"affiliation":940,"properties":22},{"id":925,"createTime":22,"updateTime":22,"relativeEntities":941,"slug":22,"properties":942,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":944,"statistic":22},[],{"title":943},{"VI":930},[],{"title":946},{"VI":947},"Haixun Wang",{"id":949,"sortIndex":77,"researcher":22,"roles":950,"affiliations":951,"properties":958,"displayName":960,"givenName":22,"familyName":22},"ca79cf7d-d48e-409c-8db7-7cc4e4d69f6f",[110],[952],{"id":925,"sortIndex":73,"affiliation":953,"properties":22},{"id":925,"createTime":22,"updateTime":22,"relativeEntities":954,"slug":22,"properties":955,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":957,"statistic":22},[],{"title":956},{"VI":930},[],{"title":959},{"VI":960},"P.S. Yu",{"id":962,"sortIndex":412,"researcher":22,"roles":963,"affiliations":964,"properties":976,"displayName":978,"givenName":22,"familyName":22},"29fa10ee-06a5-4025-9610-1edced68aef1",[110],[965],{"id":966,"sortIndex":73,"affiliation":967,"properties":973},"810568b7-734c-4704-9715-0185e417ce65",{"id":966,"createTime":22,"updateTime":22,"relativeEntities":968,"slug":22,"properties":969,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":972,"statistic":22},[],{"title":970},{"VI":971},"Department of Computer Science, Columbia University, New York, NY, United States",[],{"title":974},{"VI":975},"Department of Computer Science, Columbia University, New York, NY, USA",{"title":977},{"VI":978},"S.J. Stolfo",{"url":917,"publisher":980,"properties":1018},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":981,"slug":10,"properties":982,"entityType":20,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":23,"subjectFields":986,"manageAffiliations":999,"indexDatabases":1005,"url":71,"thumbnailPath":22,"statistic":1013,"gsStatistic":22,"type":22,"analyzePriority":22},[],{"issn":983,"title":984,"country":985},{"VOID":15},{"EN":17},{"VOID":13},[987,991,995],{"id":26,"createTime":22,"updateTime":22,"relativeEntities":988,"label":989,"description":990,"parentId":22,"standard":22,"scholarHubFieldId":22},[],{"EN":29},{},{"id":32,"createTime":22,"updateTime":22,"relativeEntities":992,"label":993,"description":994,"parentId":22,"standard":22,"scholarHubFieldId":22},[],{"EN":35},{},{"id":38,"createTime":22,"updateTime":22,"relativeEntities":996,"label":997,"description":998,"parentId":22,"standard":22,"scholarHubFieldId":22},[],{"EN":41},{},[1000],{"id":45,"createTime":22,"updateTime":22,"relativeEntities":1001,"slug":22,"properties":1002,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":1004,"statistic":22},[],{"title":1003},{"EN":49},[],[1006],{"id":53,"indexDatabase":1007,"url":64,"indexYears":65,"academicFieldIds":1012,"indexDatabaseRanking":70},{"id":55,"createTime":22,"updateTime":22,"relativeEntities":1008,"label":1009,"description":1010,"key":61,"publicationTags":1011,"standard":22},[],{"EN":58,"VI":58},{"EN":58,"VI":60},[63],[67,68,69],{"impactFactor":73,"impactFactorByYear":1014,"i10Index":73,"i10IndexLast5Year":73,"totalPublication":75,"totalPublicationByYear":1015,"totalCitation":73,"totalCitationByYear":1016,"totalCitationPerPublication":73,"totalCitationPerPublicationByYear":1017,"hindexLast5Year":73,"hindex":73},{},{"2002":77},{},{},{"pages":1019},{"VOID":1020},"445-446",[],{"id":1023,"createTime":1024,"updateTime":1025,"relativeEntities":1026,"slug":1027,"properties":1028,"entityType":101,"verifyStatus":102,"verifyTime":1025,"verifyNote":103,"languages":22,"translateLanguages":22,"viewCount":73,"primaryUrl":1039,"fullTextUrl":1040,"authors":1041,"publicationType":152,"publisherRelationship":1070,"citationCount":22,"citationInfo":22,"publishDate":22,"publishYear":22,"citationAnalyzeStatus":21,"lastCitationAnalyze":22,"indexDatabases":1112,"openAccess":22,"references":22,"isForceReanalyzing":196},"8cb7ef93-14db-4aef-ae68-b2c4b4fc475d","2023-12-20T10:55:53.518+00:00","2025-02-15T15:24:29.048+00:00",[],"Routing-indices-for-peer-to-peer-systems",{"abstract":1029,"title":1031,"keywords":1033,"references":1035,"doi":1037},{"EN":1030},"Finding information in a peer-to-peer system currently requires either a costly and vulnerable central index, or flooding the network with queries. We introduce the concept of routing indices (RIs), which allow nodes to forward queries to neighbors that are more likely to have answers. If a node cannot answer a query, it forwards the query to a subset of its neighbors, based on its local RI, rather than by selecting neighbors at random or by flooding the network by forwarding the query to all neighbors. We present three RI schemes: the compound, the hop-count, and the exponential routing indices. We evaluate their performance via simulations, and find that RIs can improve performance by one or two orders of magnitude vs. a flooding-based system, and by up to 100% vs. a random forwarding system. We also discuss the tradeoffs between the different RI schemes and highlight the effects of key design variables on system performance.",{"EN":1032},"Routing indices for peer-to-peer systems",{"EN":1034},"Routing,Peer to peer computing,System performance,Distributed computing,Robustness,Costs,Web search,Search engines,Computer hacking",{"VOID":1036},"gravano, 1994, The effectiveness of gloss for the text-database discovery problem, Proceedings of SIGMOD, 10.1145\u002F191843.191869\n10.1109\u002FPDIS.1994.331726\ngravano, 2000, Gloss: Text-source discovery over the internet, TODS\n10.1145\u002F371578.371598\n10.1145\u002F378993.379239\nadamic, 2001, Search in power-law networks. Technical report, HP Labs\nmiller, 1998, Multicast Networking and Applications\n0, Napster\n10.1145\u002F964723.383072\nrowstron, 2001, Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems, Middleware\n10.1109\u002FICDCS.2002.1022239\n0, Clip2.com, at, Gnutella To the Bandwidth and Beyond\nford, 1962, Flows in Networks\n10.1145\u002F316194.316229\n0, Gnutella\n0, Freenet\n10.1016\u002FS0169-7552(98)00110-X\ngravano, 1995, Generalizing gloss for vector-space databases and broker hierarchies, Proceedings of VLDB\nbellman, 1957, Dynamic Programming\n0, Seti at Home\ntanenbaum, 1999, Operating Systems Design and Implementation\n10.1145\u002F383059.383071\nyang, 2001, Comparing hybrid peer-to-peer systems, VLDB\ntanenbaum, 1996, Computer Networks\nzhao, 2001, Tapestry: An infrastructure for fault-tolerant wide-area location and routing, Technical Report UCB\u002FCSD-01–1141 Computer Science Division\nyang, 2002, Efficient search in peer-to-peer networks, ICDCS",{"VOID":1038},"10.1109\u002FICDCS.2002.1022239","https:\u002F\u002Fieeexplore.ieee.org\u002Fabstract\u002Fdocument\u002F1022239\u002F","https:\u002F\u002Fieeexplore.ieee.org\u002Fstamp\u002Fstamp.jsp?tp=&arnumber=1022239",[1042,1057],{"id":1043,"sortIndex":73,"researcher":22,"roles":1044,"affiliations":1045,"properties":1054,"displayName":1056,"givenName":22,"familyName":22},"7db19322-05b3-49e5-9df8-4c302eb5cba8",[110],[1046],{"id":1047,"sortIndex":73,"affiliation":1048,"properties":22},"afa705ec-45e2-45e8-bcd4-6c865f8236e3",{"id":1047,"createTime":22,"updateTime":22,"relativeEntities":1049,"slug":22,"properties":1050,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":1053,"statistic":22},[],{"title":1051},{"VI":1052},"University of Stanford, USA",[],{"title":1055},{"VI":1056},"A. Crespo",{"id":1058,"sortIndex":125,"researcher":22,"roles":1059,"affiliations":1060,"properties":1067,"displayName":1069,"givenName":22,"familyName":22},"bcc60a7f-1e6c-40ea-8e3f-e3728bb30043",[110],[1061],{"id":1047,"sortIndex":73,"affiliation":1062,"properties":22},{"id":1047,"createTime":22,"updateTime":22,"relativeEntities":1063,"slug":22,"properties":1064,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":1066,"statistic":22},[],{"title":1065},{"VI":1052},[],{"title":1068},{"VI":1069},"H. Garcia-Molina",{"url":1039,"publisher":1071,"properties":1109},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":1072,"slug":10,"properties":1073,"entityType":20,"verifyStatus":21,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":23,"subjectFields":1077,"manageAffiliations":1090,"indexDatabases":1096,"url":71,"thumbnailPath":22,"statistic":1104,"gsStatistic":22,"type":22,"analyzePriority":22},[],{"issn":1074,"title":1075,"country":1076},{"VOID":15},{"EN":17},{"VOID":13},[1078,1082,1086],{"id":26,"createTime":22,"updateTime":22,"relativeEntities":1079,"label":1080,"description":1081,"parentId":22,"standard":22,"scholarHubFieldId":22},[],{"EN":29},{},{"id":32,"createTime":22,"updateTime":22,"relativeEntities":1083,"label":1084,"description":1085,"parentId":22,"standard":22,"scholarHubFieldId":22},[],{"EN":35},{},{"id":38,"createTime":22,"updateTime":22,"relativeEntities":1087,"label":1088,"description":1089,"parentId":22,"standard":22,"scholarHubFieldId":22},[],{"EN":41},{},[1091],{"id":45,"createTime":22,"updateTime":22,"relativeEntities":1092,"slug":22,"properties":1093,"entityType":22,"verifyStatus":22,"verifyTime":22,"verifyNote":22,"languages":22,"translateLanguages":22,"viewCount":22,"url":22,"parentIds":1095,"statistic":22},[],{"title":1094},{"EN":49},[],[1097],{"id":53,"indexDatabase":1098,"url":64,"indexYears":65,"academicFieldIds":1103,"indexDatabaseRanking":70},{"id":55,"createTime":22,"updateTime":22,"relativeEntities":1099,"label":1100,"description":1101,"key":61,"publicationTags":1102,"standard":22},[],{"EN":58,"VI":58},{"EN":58,"VI":60},[63],[67,68,69],{"impactFactor":73,"impactFactorByYear":1105,"i10Index":73,"i10IndexLast5Year":73,"totalPublication":75,"totalPublicationByYear":1106,"totalCitation":73,"totalCitationByYear":1107,"totalCitationPerPublication":73,"totalCitationPerPublicationByYear":1108,"hindexLast5Year":73,"hindex":73},{},{"2002":77},{},{},{"pages":1110},{"VOID":1111},"23-32",[]]