Titlebook: ;

Infinitesimal

https://doi.org/10.1057/9780230390515ilability of collision detection mechanisms, the wake-up mode, the topology classes considered, and the use of randomness. This chapter introduces the problem, reviews the literature on time-efficient broadcasting algorithms for radio networks under a variety of models and assumptions, and illustrates some of the basic techniques.

CLAM

dissent

Routing and Label Space Reduction in Label Switching Networksabel space reduction problem. We propose a generic optimization model and, then, we describe some adaptations aiming at modeling each particular case. Simulation results are briefly discussed at the end of this chapter.

cancer

Problems in Dynamic Bandwidth Allocation in Connection Oriented Networkschitectures to establish the ordering of packets. If load balancing can be achieved by switches or routers, this can greatly facilitate applying load balancing across the network. Traffic characteristics such as QoS (delay bounds, throughput) and burstiness are considered.

mucous-membrane

Permutation Routing and (,, ,)-Routing on Plane Grids.. Here, we survey the results on permutation routing, the .-central routing, and the general (., .)-routing problems on regular plane grids, that is, square grids, triangular grids, and hexagonal grids. We assume the .-port model with synchronous transmission, and we consider both full and half-duplex networks.

Chronic

蕨類(lèi)

Texts in Theoretical Computer Science. An EATCS Series388155.jpg

相信

Peak-Bone-Mass

Accommodation