Routing selfish unsplittable traffic

doi:10.1145/1290672.1290689

Routing selfish unsplittable traffic

Full Text:

Pdf

Buy this Article

Authors:	Vincenzo Auletta	Università di Salerno, Salerno, Italy
	Roberto De Prisco	Università di Salerno, Salerno, Italy
	Paolo Penna	Università di Salerno, Salerno, Italy
	Giuseppe Persiano	Università di Salerno, Salerno, Italy

	2007 Article
Bibliometrics
· Downloads (6 Weeks): 3 · Downloads (12 Months): 20 · Downloads (cumulative): 339 · Citation Count: 1

Published in:

	· Journal
	ACM Transactions on Algorithms (TALG) TALG Homepage archive
	Volume 3 Issue 4, November 2007 Article No. 52 ACM New York, NY, USA table of contents doi>10.1145/1290672.1290689

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithmic mechanism design algorithms nash equilibrium nonnumerical algorithms and problems scheduling selfish routing

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

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

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder