Abstract
Consider a communication network with certain nodes and different types of links. In addition to the normal link cost, a transformation cost is charged if the incoming link and the outgoing link are of different types. An optimal routeing from a given node to its destination node is sought. The major difficulty in handling this problem is that the principle of optimality does not hold. A model with node separation is built to overcome this difficulty. By using the new model, the original routeing problem is no more than a shortest-path problem. Hence, we can implement this model to current electronic switching machines.
Sign-in/Register to access full text options 
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.
