Network Routing Problem in Multigraph
Journal Title: International Research Journal of Computer Science - Year 2016, Vol 0, Issue 0
Abstract
This paper tries to find an easy method for solving the problem of routing in computer network where the network is using multigraph. This is done mainly using comparison of weight or cost of various multi arcs between any two nodes. This theory can be implemented in real life to solve Network Routing Problem in Multigraph.
Authors and Affiliations
Siddhartha Sankar Biswas
Keywords
Related Articles
- EP ID EP182436
- DOI -
- Views 119
- Downloads 0
A Hybrid Call Routing Framework for Mobile Number Portability in Nigeria
The essence of Mobile Number Portability (MNP) is to improve quality of service by deepening competition among service providers. This technology was launched in Nigeria in 2013 by the Nigerian Communication Commission (...
Wireless Sensor Networks Architecture
Wireless sensor networks (WSNs) have attracted a wide range of disciplines where close interactions with the physical world are essential. The distributed sensing capabilities and the ease of deployment provided by a wir...
Design and Implementation of Lecturer Evaluation System Using ELECTRE Method in Web-based Application
In order to improve the performance of human resources (in this case is a lecturer) at the Faculty of Computer Science University of Mercu has conducted a lecturer's performance evaluation at the end of each semesterBuan...
Category Based Application Engine
This paper provides actual results of our research in the field of categorizing software applications. This research is compared and discussed based on a number of different criteria: the categorization attributes that a...
A Survey and a Comparative Study on Software-Defined Networking
Software-Defined Networking (SDN) is a new networking paradigm in network technologies in which the data plane and network plane are separated. This new technology began to be widely used in last few years and studies st...