We study network load games, a class of routing games in networks which generalize sel¯sh routing games on networks consisting of parallel links. In these games, each user aims to route some tra±c from a source to a destination so that the maximum load she experiences in the links of the network she occupies is minimum given the routing decisions of other users. We present results related to the existence, complexity, and price of anarchy of Pure Nash Equilibria for several network load games. As corollaries, we present interesting new statements related to the complexity of computing equilibria for sel¯sh routing games in net- works of restricted parallel links.