Author image not provided
 Dinan Gunawardena

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article12.60
Citation Count189
Publication count15
Publication years2003-2016
Available for download9
Average downloads per article524.44
Downloads (cumulative)4,720
Downloads (12 Months)105
Downloads (6 Weeks)21
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


15 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 15 of 15
Sort by:

1 published by ACM
June 2016 ACM Transactions on Economics and Computation (TEAC) - Special Issue on EC'13: Volume 4 Issue 3, June 2016
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 3,   Downloads (12 Months): 17,   Downloads (Overall): 89

Full text available: PDFPDF
In a sponsored search auction, decisions about how to rank ads impose tradeoffs between objectives, such as revenue and welfare. In this article, we examine how these tradeoffs should be made. We begin by arguing that the most natural solution concept to evaluate these tradeoffs is the lowest symmetric Nash ...
Keywords: Sponsored search, generalized second price, keyword auctions, reserve price

2 published by ACM
June 2013 EC '13: Proceedings of the fourteenth ACM conference on Electronic commerce
Publisher: ACM
Bibliometrics:
Citation Count: 8
Downloads (6 Weeks): 1,   Downloads (12 Months): 1,   Downloads (Overall): 133

Full text available: PDFPDF
In a sponsored search auction, decisions about how to rank ads impose tradeoffs between objectives such as revenue and welfare. In this paper, we examine how these tradeoffs should be made. We begin by arguing that the most natural solution concept to evaluate these tradeoffs is the lowest symmetric Nash ...
Keywords: generalized second price, keyword auctions, reserve price, sponsored search

3
April 2013 nsdi'13: Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation
Publisher: USENIX Association
Bibliometrics:
Citation Count: 17

The emerging ecosystem of cloud applications leads to significant inter-tenant communication across a datacenter's internal network. This poses new challenges for cloud network sharing. Richer inter-tenant traffic patterns make it hard to offer minimum bandwidth guarantees to tenants. Further, for communication between economically distinct entities, it is not clear whose ...

4 published by ACM
December 2012 CoNEXT '12: Proceedings of the 8th international conference on Emerging networking experiments and technologies
Publisher: ACM
Bibliometrics:
Citation Count: 11
Downloads (6 Weeks): 1,   Downloads (12 Months): 6,   Downloads (Overall): 191

Full text available: PDFPDF
One of the key distinctive requirements of white-space networks is the power asymmetry. Static nodes are allowed to transmit with 15dB-20dB higher power than mobile nodes. This poses significant coexistence problems, as high-power nodes can easily starve low-power nodes. In this paper, we propose Weeble, a novel distributed and state-less ...
Keywords: coexistence, white-spaces

5
February 2012 FAST'12: Proceedings of the 10th USENIX conference on File and Storage Technologies
Publisher: USENIX Association
Bibliometrics:
Citation Count: 4

Good execution of data placement, caching and consistency policies across a user's personal devices has always been hard. Unpredictable networks, capricious user behavior with leaving devices on or off and non-uniform energy-saving policies constantly interfere with the good intentions of a storage system's policies. This paper's contribution is to better ...

6 published by ACM
December 2011 CoNEXT '11: Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies
Publisher: ACM
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 1,   Downloads (12 Months): 19,   Downloads (Overall): 155

Full text available: PDFPDF
We investigate dynamic channel, rate selection and scheduling for wireless systems which exploit the large number of channels available in the White-space spectrum. We first present measurements of radio channel characteristics from an indoor testbed operating in the 500 to 600MHz band and comprising 11 channels. We observe significant and ...

7 published by ACM
September 2011 MobiCom '11: Proceedings of the 17th annual international conference on Mobile computing and networking
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 4,   Downloads (12 Months): 9,   Downloads (Overall): 573

Full text available: PDFPDF
We consider the problem of delivering information streams to interested mobile users, leveraging both access to the infrastructure and device-to-device data transfers. The goal is to design practical relaying algorithms that aim at optimizing a global system objective that accounts for two important aspects: first, the user interest in content ...
Keywords: DTNs, decentralized opportunistic relaying, two-hop relaying

8 published by ACM
November 2009 IMC '09: Proceedings of the 9th ACM SIGCOMM conference on Internet measurement
Publisher: ACM
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 4,   Downloads (12 Months): 37,   Downloads (Overall): 423

Full text available: PDFPDF
In this paper, we aim at characterizing podcast services both from publishers' and users' perspectives, and at analyzing the implications of these characteristics on the design of efficient dissemination systems. Specifically, our goal is to characterize how podcasting content is generated and published, and how users subscribe and consume podcasts. ...
Keywords: podcast dissemination, usage of podcasting services, podcast, podcast publishing

9
August 2009 IEEE Transactions on Knowledge and Data Engineering: Volume 21 Issue 8, August 2009
Publisher: IEEE Educational Activities Department
Bibliometrics:
Citation Count: 4

We consider the problem of ranking the popularity of items and suggesting popular items based on user feedback. User feedback is obtained by iteratively presenting a set of suggested items, and users selecting items based on their own preferences either from this suggestion set or from the set of all ...
Keywords: recommendation, social tagging., Popularity ranking, recommendation, suggestion, implicit user feedback, search query, social tagging., search query, implicit user feedback, Popularity ranking, suggestion

10 published by ACM
October 2008 CIKM '08: Proceedings of the 17th ACM conference on Information and knowledge management
Publisher: ACM
Bibliometrics:
Citation Count: 49
Downloads (6 Weeks): 0,   Downloads (12 Months): 16,   Downloads (Overall): 890

Full text available: PDFPDF
This paper aims to quantify two common assumptions about social tagging: (1) that tags are "meaningful" and (2) that the tagging process is influenced by tag suggestions. For (1), we analyze the semantic properties of tags and the relationship between the tags and the content of the tagged page. Our ...
Keywords: search, social tagging

11 published by ACM
September 2008 MobiCom '08: Proceedings of the 14th ACM international conference on Mobile computing and networking
Publisher: ACM
Bibliometrics:
Citation Count: 33
Downloads (6 Weeks): 7,   Downloads (12 Months): 19,   Downloads (Overall): 1,115

Full text available: PDFPDF
There has been extensive work on network architectures that support multi-path routing to improve performance in wireless mesh networks. However, previous work uses ad-hoc design principles that cannot guarantee any network-wide performance objectives such as conjointly maximizing resource utilization and improving fairness. In parallel, numerous theoretical results have addressed the ...
Keywords: backpressure, multi-path tcp, congestion control, wireless meshes

12 published by ACM
May 2007 WWW '07: Proceedings of the 16th international conference on World Wide Web
Publisher: ACM
Bibliometrics:
Citation Count: 41
Downloads (6 Weeks): 2,   Downloads (12 Months): 6,   Downloads (Overall): 1,103

Full text available: PDFPDF
Peer-to-peer technologies are increasingly becoming the medium of choice for deliveringmedia content, both professional and home-grown, to large user populations. Indeed, current P2P swarming systems have been shown to be very efficient for large-scale content distribution with few server resources.However, such systems have been designed for generic file distribution and ...
Keywords: content distribution, network coding, overlays, peer-to-peer, topology management, video streaming

13
May 2007 Proceedings of the IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 1

Digital media companies have recently started embracing P2P networks as an alternative distribution mechanism. However, with current P2P swarming systems users need to download the full video, and hence have to wait a long time before they can start watching it. While a lot of effort has gone into optimizing ...

14
April 2005 Proceedings of the 13th international conference on Security protocols
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

Many users routinely log in to their system with system administrator privileges. This is especially true of home users. The advantage of this setup is that these users can do everything necessary to fulfil their tasks with the computer. The disadvantage is that every program running in the users context ...

15
June 2003 IWQoS'03: Proceedings of the 11th international conference on Quality of service
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 3

Round trip delays constitute the basic network measure that can be obtained by end systems without any network support. Our aim is to design measurement-based admission control strategies for streaming applications based on such minimal feedback on network state. To this end we discuss simple statistical models of packet round ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2019 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us