Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
IEICE Technical Committee Submission System
Conference Paper's Information		 Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2017-11-05 16:35
A routing method using transmission history information and betweenness centrality
Yuuki Morita, Takayuki Kimura (NIT) NLP2017-72
Abstract (in Japanese) (See Japanese page) 
(in English) The combinatorial optimization problem is classified into two types: a static combinatorial optimization problem and a dynamic combinatorial optimization problem. In the case of the static combinatorial optimization problem represented by the traveling salesman problem, searching space for solutions is stationary. Therefore, an optimal solution does not change with time. On the other hand, in the dynamic combinatorial optimization problem represented by the packet routing problem, its searching space always changes with time. Thus, an optimum solution always change depending on the states of networks. An objective of the packet routing problem is to transmit many packets to their destinations without removal of the packets. In this report, we propose a new routing method using node betweenness centrality, which is one of centrality indicators of the networks, and transmission history of the packets. Numerical experiments, show that the proposed method transmits many packets to their destinations compared with the shortest hop method that is generally adopted as a routing method in the real computer
networks.
Keyword (in Japanese) (See Japanese page) 
(in English) Packet routing problem / Complex network / Combinatorial optimization / / / / /  
Reference Info. IEICE Tech. Rep., vol. 117, no. 272, NLP2017-72, pp. 41-46, Nov. 2017.
Paper # NLP2017-72 
Date of Issue 2017-10-29 (NLP) 
ISSN Print edition: ISSN 0913-5685    Online edition: ISSN 2432-6380
Copyright
and
reproduction		 All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF NLP2017-72

Conference Information
Committee NLP  
Conference Date 2017-11-05 - 2017-11-06 
Place (in Japanese) (See Japanese page) 
Place (in English) Research Institute of Electrical Communication Tohoku University 
Topics (in Japanese) (See Japanese page) 
Topics (in English) Applications of nonlinear complex systems theory to existing nonlinear complex real-systems, etc 
Paper Information
Registration To NLP 
Conference Code 2017-11-NLP 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) A routing method using transmission history information and betweenness centrality 
Sub Title (in English)  
Keyword(1) Packet routing problem  
Keyword(2) Complex network  
Keyword(3) Combinatorial optimization  
Keyword(4)  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Yuuki Morita  
1st Author's Affiliation Nippon Institute of Technology (NIT)
2nd Author's Name Takayuki Kimura  
2nd Author's Affiliation Nippon Institute of Technology (NIT)
3rd Author's Name  
3rd Author's Affiliation ()
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2017-11-05 16:35:00 
Presentation Time 25 minutes 
Registration for NLP 
Paper # NLP2017-72 
Volume (vol) vol.117 
Number (no) no.272 
Page pp.41-46 
#Pages 6 
Date of Issue 2017-10-29 (NLP) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan