Übersicht			Auf mobile öffnen

Lieferstatus:	i.d.R. innert 5-10 Tagen versandfertig
Veröffentlichung:	Juni 2004
Genre:	EDV / Informatik
	Ad-hocNetworking / algorithmanalysisandproblemcomplexity / Algorithmen und Datenstrukturen / Algorithms / Algorithmus / Broadcast / Broadcasting / combinatorialoptimization / Communication / complexity / ComputerCommunicationNetworks / datastructures / Datenbanken / Datenmanagement / Diskrete Mathematik / graphalgorithms / graphtheory / Komplex - Komplexität / NetworkComputing / Networking / Netzwerk-Hardware / Routing / SelfishRouting / Switching mehr...
ISBN:	9783540222309
EAN-Code:	9783540222309
Verlag:	Springer
Einband:	Kartoniert
Sprache:	English
Serie:	#3104 - Lecture Notes in Computer Science
Dimensionen:	H 235 mm / B 155 mm / D 18 mm
Gewicht:	487 gr
Seiten:	320
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

Traffic Grooming in a Passive Star WDM Network.- The Price of Anarchy in All-Optical Networks.- Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks.- Path Layout on Tree Networks: Bounds in Different Label Switching Models.- On Approximability of the Independent Set Problem for Low Degree Graphs.- Asynchronous Broadcast in Radio Networks.- Two-Hop Virtual Path Layout in Tori.- Robot Convergence via Center-of-Gravity Algorithms.- F-Chord: Improved Uniform Routing on Chord.- Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor.- Improved Bounds for Optimal Black Hole Search with a Network Map.- Sparse Additive Spanners for Bounded Tree-Length Graphs.- No-Hole L(p,0) Labelling of Cycles, Grids and Hypercubes.- Existence of Nash Equilibria in Selfish Routing Problems.- Mobile Agents Rendezvous When Tokens Fail.- Time Efficient Gossiping in Known Radio Networks.- Long-Lived Rambo: Trading Knowledge for Communication.- Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach.- Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks.- Perfect Token Distribution on Trees.- Approximation Algorithm for Hotlink Assignment in the Greedy Model.- Optimal Decision Strategies in Byzantine Environments.- Sharing the Cost of Multicast Transmissions in Wireless Networks.- NP-Completeness Results for All-Shortest-Path Interval Routing.- On-Line Scheduling of Parallel Jobs.- The Range Assignment Problem in Static Ad-Hoc Networks on Metric Spaces.