During this ebook, we contemplate the matter of attaining the utmost throughput and software in a category of networks with resource-sharing constraints. this can be a classical challenge of serious significance. within the context of instant networks, we first suggest an absolutely disbursed scheduling set of rules that achieves the utmost throughput. encouraged by means of CSMA (Carrier experience a number of Access), that is largely deployed in contemporary instant networks, our set of rules is straightforward, asynchronous, and simple to enforce. moment, utilizing a singular maximal-entropy approach, we mix the CSMA scheduling set of rules with congestion keep an eye on to technique the utmost software. additionally, we additional express that CSMA scheduling is a modular MAC-layer set of rules which could paintings with different protocols within the shipping layer and community layer. 3rd, for instant networks the place packet collisions are unavoidable, we identify a basic analytical version and expand the above algorithms to that case. Stochastic Processing Networks (SPNs) version production, communique, and repair structures. In production networks, for instance, initiatives require elements and assets to provide different elements. SPNs are extra basic than queueing networks and pose novel demanding situations to throughput-optimum scheduling. We proposes a "deficit greatest weight" (DMW) set of rules to accomplish throughput optimality and maximize the internet software of the construction in SPNs. desk of Contents: advent / assessment / Scheduling in instant Networks / software Maximization in instant Networks / dispensed CSMA Scheduling with Collisions / Stochastic Processing networks