Abstract
Few problems in the field of computer communication networks have received as early and extensive attention as the routing problem. The reason for this is twofold. First there have been numerous studies of flow problems in network theory that provide a basis for modeling the routing problem in a mathematically tractable way and, second, routing has proved to be a necessary and fundamental design choice for the operation of message- or packet- switched networks. In its simplest form the statement of the routing problem is as follows. Consider, as in Figure 12.1, a node that receives messages from an incoming link and has a choice of forwarding them via one of two outgoing links.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
