Park et al., 1998 - Google Patents
A neural network based multi-destination routing algorithm for communication networkPark et al., 1998
- Document ID
- 3873421386821198916
- Author
- Park D
- Choi S
- Publication year
- Publication venue
- 1998 IEEE International Joint Conference on Neural Networks Proceedings. IEEE World Congress on Computational Intelligence (Cat. No. 98CH36227)
External Links
Snippet
A routing algorithm for large scale communication network with multidestination problem is proposed in this paper. The proposed approach consists of three procedures: recursive Hopfield neural network for obtaining the routing order between given source and multiple …
- 230000001537 neural 0 title abstract description 32
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5619—Network Node Interface, e.g. tandem connections, transit switching
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/04—Interdomain routing, e.g. hierarchical routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/48—Routing tree calculation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q3/00—Selecting arrangements
- H04Q3/0016—Arrangements providing connection between exchanges
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q3/00—Selecting arrangements
- H04Q3/64—Distributing or queueing
- H04Q3/66—Traffic distributors
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
- H04L41/50—Network service management, i.e. ensuring proper service fulfillment according to an agreement or contract between two parties, e.g. between an IT-provider and a customer
- H04L41/5041—Service implementation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
- H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Park et al. | A neural network based multi-destination routing algorithm for communication network | |
Gelenbe et al. | Improved neural heuristics for multicast routing | |
EP0660569A1 (en) | Method and system for improving the processing time of the path selection in a high speed packet switching network | |
Subing et al. | A QoS routing algorithm based on ant algorithm | |
US6744734B1 (en) | Method for generating the optimal PNNI complex node representations for restrictive costs | |
Clarke et al. | An integrated system for designing minimum cost survivable telecommunications networks | |
Al-Rumaih et al. | Spare capacity planning for survivable mesh networks | |
US6731608B2 (en) | Complex node representations in PNNI systems | |
Marbach et al. | Call admission control and routing in integrated services networks using reinforcement learning | |
WO2004056041A1 (en) | Method and device for designing a data network | |
Jensen et al. | Neural network controller for adaptive routing in survivable communications networks | |
Qin et al. | Designing B-ISDN network topologies using the genetic algorithm | |
Randall et al. | Solving network synthesis problems using ant colony optimisation | |
Muralidhar et al. | A hierarchical scheme for multiobjective adaptive routing in large communication networks | |
Chugo et al. | Dynamic path assignment for broadband networks based on neural computation | |
Smeda et al. | Application of Hopfield neural network in routing for computer networks | |
Runggeratigul et al. | Link capacity assignment in packet-switched networks: the case of piecewise linear concave cost function | |
Bölücü et al. | Q-Learning-based Routing Algorithm for 3D Network-on-Chips | |
Liu et al. | Performance analysis using a hierarchical loss network model | |
Singh et al. | Fuzzy & neural-based adaptive & deterministic routing algorithm for network-on-chip | |
Huang et al. | Parallel optimal routing control by commodities for large data networks | |
Gaipov et al. | Using of the contour method to solving the problem of optimal traffic dis-tribution in the network | |
Chen et al. | Network link weight optimization based on antisymmetric deep graph networks and reinforcement learning | |
Muralidhar et al. | On the decomposition of large communication networks for hierarchical control implementation | |
Juidette et al. | An adaptive QoS-routing algorithm for IP networks using genetic algorithms |