Results on input-output L-p stability of networked control systems (NCS) are presented for a large class of network scheduling protocols. It is shown that static protocols and a recently considered dynamical protocol called try-once-discard belong to this class. Our results provide a unifying framework for generating new scheduling protocols that preserve L-p stability properties of the system if a design parameter is chosen sufficiently small. The most general version of our results can be used to treat NCS with data packet dropouts. The model of NCS and, in particular, of the scheduling protocol that we use appears to be novel and we believe that it will be useful in further study of these systems. The proof technique we use is based on the small gain theorem and it lends itself to an easy interpretation. We prove that our results are guaranteed to be better than existing results in the literature and we illustrate this via an example of a batch reactor.