Binary neural network approach for one-shot scheduling problems in multicast packet switching systems

Takayuki Baba, Nobuo Funabiki, Seishi Nishikawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

A multicast packet switching system can replicate a packet in the window of each input port to send out the copies from different output ports simultaneously. In order to maximize the throughput, a combinatorial optimization problem must be solved in real time of finding a switching configuration which does not only satisfy the constraints on the system, but also maximize the number of copies under transmission demands. In this paper, we focus on the one-shot scheduling problem where all the copies of selected packets must be sent out simultaneously. We propose the neural network composed of W×N binary neurons for the problem in the W-window-N-input-port system. The motion equation is newly defined with three heuristic methods. We verify the performance through simulations in up to 3-window-1000-input-port systems, where our binary neural network provides the better performance than the existing methods so as to reduce the delay time under practical situations.

Original languageEnglish
Title of host publicationIEEE International Conference on Neural Networks - Conference Proceedings
PublisherIEEE
Pages1266-1271
Number of pages6
Volume2
Publication statusPublished - 1997
Externally publishedYes
EventProceedings of the 1997 IEEE International Conference on Neural Networks. Part 4 (of 4) - Houston, TX, USA
Duration: Jun 9 1997Jun 12 1997

Other

OtherProceedings of the 1997 IEEE International Conference on Neural Networks. Part 4 (of 4)
CityHouston, TX, USA
Period6/9/976/12/97

Fingerprint

Packet switching
Switching systems
Scheduling
Neural networks
Heuristic methods
Combinatorial optimization
Neurons
Equations of motion
Time delay
Throughput

ASJC Scopus subject areas

  • Software
  • Control and Systems Engineering
  • Artificial Intelligence

Cite this

Baba, T., Funabiki, N., & Nishikawa, S. (1997). Binary neural network approach for one-shot scheduling problems in multicast packet switching systems. In IEEE International Conference on Neural Networks - Conference Proceedings (Vol. 2, pp. 1266-1271). IEEE.

Binary neural network approach for one-shot scheduling problems in multicast packet switching systems. / Baba, Takayuki; Funabiki, Nobuo; Nishikawa, Seishi.

IEEE International Conference on Neural Networks - Conference Proceedings. Vol. 2 IEEE, 1997. p. 1266-1271.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Baba, T, Funabiki, N & Nishikawa, S 1997, Binary neural network approach for one-shot scheduling problems in multicast packet switching systems. in IEEE International Conference on Neural Networks - Conference Proceedings. vol. 2, IEEE, pp. 1266-1271, Proceedings of the 1997 IEEE International Conference on Neural Networks. Part 4 (of 4), Houston, TX, USA, 6/9/97.
Baba T, Funabiki N, Nishikawa S. Binary neural network approach for one-shot scheduling problems in multicast packet switching systems. In IEEE International Conference on Neural Networks - Conference Proceedings. Vol. 2. IEEE. 1997. p. 1266-1271
Baba, Takayuki ; Funabiki, Nobuo ; Nishikawa, Seishi. / Binary neural network approach for one-shot scheduling problems in multicast packet switching systems. IEEE International Conference on Neural Networks - Conference Proceedings. Vol. 2 IEEE, 1997. pp. 1266-1271
@inproceedings{c302f42bd55f4599b35e2d948aff14aa,
title = "Binary neural network approach for one-shot scheduling problems in multicast packet switching systems",
abstract = "A multicast packet switching system can replicate a packet in the window of each input port to send out the copies from different output ports simultaneously. In order to maximize the throughput, a combinatorial optimization problem must be solved in real time of finding a switching configuration which does not only satisfy the constraints on the system, but also maximize the number of copies under transmission demands. In this paper, we focus on the one-shot scheduling problem where all the copies of selected packets must be sent out simultaneously. We propose the neural network composed of W×N binary neurons for the problem in the W-window-N-input-port system. The motion equation is newly defined with three heuristic methods. We verify the performance through simulations in up to 3-window-1000-input-port systems, where our binary neural network provides the better performance than the existing methods so as to reduce the delay time under practical situations.",
author = "Takayuki Baba and Nobuo Funabiki and Seishi Nishikawa",
year = "1997",
language = "English",
volume = "2",
pages = "1266--1271",
booktitle = "IEEE International Conference on Neural Networks - Conference Proceedings",
publisher = "IEEE",

}

TY - GEN

T1 - Binary neural network approach for one-shot scheduling problems in multicast packet switching systems

AU - Baba, Takayuki

AU - Funabiki, Nobuo

AU - Nishikawa, Seishi

PY - 1997

Y1 - 1997

N2 - A multicast packet switching system can replicate a packet in the window of each input port to send out the copies from different output ports simultaneously. In order to maximize the throughput, a combinatorial optimization problem must be solved in real time of finding a switching configuration which does not only satisfy the constraints on the system, but also maximize the number of copies under transmission demands. In this paper, we focus on the one-shot scheduling problem where all the copies of selected packets must be sent out simultaneously. We propose the neural network composed of W×N binary neurons for the problem in the W-window-N-input-port system. The motion equation is newly defined with three heuristic methods. We verify the performance through simulations in up to 3-window-1000-input-port systems, where our binary neural network provides the better performance than the existing methods so as to reduce the delay time under practical situations.

AB - A multicast packet switching system can replicate a packet in the window of each input port to send out the copies from different output ports simultaneously. In order to maximize the throughput, a combinatorial optimization problem must be solved in real time of finding a switching configuration which does not only satisfy the constraints on the system, but also maximize the number of copies under transmission demands. In this paper, we focus on the one-shot scheduling problem where all the copies of selected packets must be sent out simultaneously. We propose the neural network composed of W×N binary neurons for the problem in the W-window-N-input-port system. The motion equation is newly defined with three heuristic methods. We verify the performance through simulations in up to 3-window-1000-input-port systems, where our binary neural network provides the better performance than the existing methods so as to reduce the delay time under practical situations.

UR - http://www.scopus.com/inward/record.url?scp=0030682709&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030682709&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0030682709

VL - 2

SP - 1266

EP - 1271

BT - IEEE International Conference on Neural Networks - Conference Proceedings

PB - IEEE

ER -