A Gradual Neural Network Approach for Time Slot Assignment in TDM Multicast Switching Systems
スポンサーリンク
概要
- 論文の詳細を見る
A neural network approach called the "Gradual Neural Network (GNN)" for the time slot assignment problem in the TDM multicast switching system is presented in this paper. The goal of this NP-complete problem is to find an assignment of packet transmission requests into a minimum number of time slots. A packet can be transmitted from one source to several destinations simultaneously by its replication. A time slot represents a switching configuration of the system with unit time for each packet transmission through an I/O line. The GNN consists of the binary neural network and the gradual expansion scheme. The binary neural network satisfies the constraints imposed on the system by solving the motion equation, whereas the gradual expansion scheme minimizes the number of required time slots by gradually expanding activated neurons. The performance is evaluated through simulations in practical size systems, where the GNN finds far better solutions than the best existing algorithm.
- 社団法人電子情報通信学会の論文
- 1997-06-25
著者
-
Funabiki N
Graduate School Of Natural Science And Technology Okayama University
-
Funabiki Nobuo
Department Of Communication Network Engineering Faculty Of Engineering Okayama University
-
NISHIKAWA Seishi
the Department of Information and Computer Sciences, School of Engineering Science, Osaka University
-
KITAMICHI Junji
Department of Information and Computer Sciences, Faculty of Engineering Science, Osaka University
-
NISHIKAWA Seishi
Department of Information and Computer Sciences, Faculty of Engineering Science, Osaka University
-
Kitamichi J
Osaka Univ. Toyonaka‐shi Jpn
-
Kitamichi Junji
Department Of Informatics And Mathematical Science Graduate School Of Engineering Science Osaka Univ
-
Nishikawa S
The Department Of Information And Computer Sciences School Of Engineering Science Osaka University
関連論文
- Revocable Group Signature Schemes with Constant Costs for Signing and Verifying
- A WDS Clustering Algorithm for Wireless Mesh Networks
- An Optical-Drop Wavelength Assignment Algorithm for Efficient Wavelength Reuse under Heterogeneous Traffic in WDM Ring Networks(Discrete Mathematics and Its Applications)
- A Minimum Dead Space Algorithm for Generalized Isochronous Channel Reuse Problems in DQDB Networks(Network)
- P2PMM_router : A Two-Stage Heuristic Algorithm to Peer-to-Peer Multicast Routing Problems in Multihome Networks(Discrete Mathematics and Its Applications)
- A Quasi-Solution State Evolution Algorithm for Channel Assignment Problems in Cellular Networks(Special Section on Discrete Mathematics and Its Applications)
- A Proposal of Test Sequence Generation Method for Communication Protocols Using SAT Algorithm
- A Proposal of Optimal Path Selection Algorithm for Static and Mobile Multicast Routing Problems
- A Proposal of Improved Lip Contour Extraction Method Using Deformable Template Matching and Its Application to Dental Treatment
- Group Signature Schemes with Membership Revocation for Large Groups(Discrete Mathematics and Its Applications)
- A Short Verifier-Local Revocation Group Signature Scheme with Backward Unlinkability(Information Theory and Its Applications)
- Relaxation of Coefficient Sensitiveness to Performance for Neural Networks Using Neuron Filter through Total Coloring Problems
- A Proposal of Neuron Filter: A Constraint Resolution Scheme of Neural Networks for Combinatorial Optimization Problems
- A Digital Neural Network for Multilayer Channel Routing with Crosstalk Minimization
- A Massive Digital Neural Network for Total Coloring Problems
- A Gradual Neural Network Approach for Time Slot Assignment in TDM Multicast Switching Systems
- Comparisons of Energy-Descent Optimization Algorithms for Maximum Clique Problems (Special Section on Discrete Mathematics and Its Applications)
- Verifier-Local Revocation Group Signature Schemes with Backward Unlinkability from Bilinear Maps(Signatures,Cryptography and Information Security)
- Forward-Secure Group Signatures from Pairings
- A Binary Neural Network Approach for Link Activation Problems in Multihop Radio Networks
- A Two-Stage Discrete Optimization Method for Largest Common Subgraph Problems
- A Gradual Neural Network Algorithm for Broadcast Scheduling Problems in Packet Radio Networks (Special Section on Discrete Mathematics and Its Applications)
- Anonymous IEEE802.1X Authentication System Using Group Signatures
- Anonymous IEEE802.1X Authentication System Using Group Signatures
- A Pairing-Based Anonymous Credential System with Efficient Attribute Proofs
- Efficient Proofs for CNF Formulas on Attributes in Pairing-Based Anonymous Credential System