Course talk:CPSC522/Adaptive Network Routing using ACO

• The topic is relevant for the course. 5
• The writing is clear and the English is good. 5
• The page is written at an appropriate level for CPSC 522 students (where the students have diverse backgrounds). 5
• The formalism (definitions, mathematics) was well chosen to make the page easier to understand. 5
• The abstract is a concise and clear summary. 5
• There were appropriate (original) examples that helped make the topic clear. 4
• There was appropriate use of (pseudo-) code. 4
• It had a good coverage of representations, semantics, inference and learning (as appropriate for the topic). 5
• It is correct. 5
• It was neither too short nor too long for the topic. 5
• It was an appropriate unit for a page (it shouldn't be split into different topics or merged with another page). 5
• It links to appropriate other pages in the wiki. 4
• The references and links to external pages are well chosen. 5
• I would recommend this page to someone who wanted to find out about the topic. 5
• This page should be highlighted as an exemplary page for others to emulate. 4
• If I was grading it out of 20, I would give a 20

The page is great, the only suggestion I can make is you in the builds on section you could link to the Reinforcement Learning page that is in the course wiki http://wiki.ubc.ca/Course:CPSC522/Reinforcement_Learning

I'm not familiar with this topic. Overall this page looks great.

   The topic is relevant for the course. 4
   The writing is clear and the English is good. 5
   The page is written at an appropriate level for CPSC 522 students (where the students have diverse backgrounds). 5
   The formalism (definitions, mathematics) was well chosen to make the page easier to understand. 5
   The abstract is a concise and clear summary. 5
   There were appropriate (original) examples that helped make the topic clear. N/A
   There was appropriate use of (pseudo-) code. N/A
   It had a good coverage of representations, semantics, inference and learning (as appropriate for the topic). 5
   It is correct. 5
   It was neither too short nor too long for the topic. 5
   It was an appropriate unit for a page (it shouldn't be split into different topics or merged with another page). 5
   It links to appropriate other pages in the wiki. 5
   The references and links to external pages are well chosen. 5
   I would recommend this page to someone who wanted to find out about the topic. 4
   This page should be highlighted as an exemplary page for others to emulate. 3

If I was grading it out of 20, I would give it: 20

Hi Kumseok Jung, Your article explains the “Routing Problem” really amazingly well and is very insightful. I don’t have many suggestions to you, except for some nitpicks;

• Typo in “interatively” [Asynchronously and interatively, the nodes exchange]
• You could hyperlink “Temporal Difference Learning”
• How often are the ants/mobile agents sent on their way? Or how often is the calculation of the shortest path done? As the nodes can keep failing, congestion can keep varying depending on how many messages travel through various links?

I also had two questions after reading the article. Maybe, the answers to them could be included in the write-up.

• If a forward ant at a node has already visited all the neighbors of, it has run into a circular path. The ant is destroyed if the time spent in the cycle is higher than the time incurred in coming to this point. However, what happens in the other case? Should the ant not be destroyed anyway? As in, how does the ant get out of the cycle? How does the ant reach the destination using this node?
• Why does the backward ant use the same route as the forward ant? Why does it not use updated information and use the shortest path that it finds through it?

Overall it’s a very thorough article!! Loved it!

Regards, Surbhi.