Is storing the sequence of ports used only in the udp packet allowed? and then at each node sending it to the next neighbour in the journey, as opposed to flooding the network again?

Stations may only communicate with their neighbours.

I'm flooding the network with a udp packet that contains the original udp port it was sent from. Once a route has been found somewhere in the network, it can access this port and send it directly back. Is this allowed? or must it be forwarded back al...

ANONYMOUS wrote Yes - if it is a neighbouring station.

if we find a path to destination, can we send the result back to requesting station server using sendto()

Sorry, but no. All assessment deadlines, across campus, are set and announced by the first day of each semester. This gives all students the equal chance to plan their workloads, particularly in the latter part of a semester when most assessments are...

I agree that more time would be beneficial. However, the 19th seems more suitable, as it is the Sunday and the project demonstrations start in week 12.

On the Clarifications page "The fastest journey to a destination (from 'now') is one that arrives at the destination soonest, independent of when it starts."

ANONYMOUS wrote If anything is an unrecognised request - doesn't provide a destination station and a leaving time - then it's a request that your station (web-server) doesn't support, or can't provide. What do typical web-servers do when they can't do...

ANONYMOUS wrote All stations are aligned by your common protocol, they must send, receive, and act upon your protocol messages in the same way. Their front-ends, involving the browser, does not have to be identical (though I can't imagine you'd wish ...

No. Stations may have any characters in their name (alphanumeric and underscore), up to the length we've set of 60 characters.

; would be appreciated. Have been working on this consistently so far but the extra time would help a lot still. If you are a student who silently agrees but doesn't want to comment, you can still "like" the comment above mine to show your support ...

Suppose Station A has neighbours B and C. There are two ways to get from A to C. 1. Take a bus directly from A to C, arriving at 12 30pm. 2. Take a bus from A to B, then from B to C, arriving at 12 10pm. So my question is, if station A finds that statio...

Hey Chris, Any chance you can push the Deadline to May 20th instead ?

Hi not sure if anyone has come across this issue - when testing on my chrome browser I noticed that the servers are constantly getting requests for favicon. Right now I'm just brute-forcing the problem by saying if request is "GET favicon.ico HTTP 1...

Hi, I'm wondering to what degree the python c implementations must be aligned? I.e. is it enough for the behaviour on the front-end to be identical between server implementations or do the functions we write general protocol logic also need to be...

Hi there, Is it reasonable to assume that for each letter there'll only be one station with that letter? E.g TerminalZ and StationZ will not exist together And also the names of the stations will be one character, or will we have longer characters? Also ...

ANONYMOUS wrote It's certainly possible, but time prevents me from writing something like that this semester. I've made a slightly modified buildrandomtimetables.c - https teaching.csse.uwa.edu.au units CITS3002 project2024 buildrandomtimetables.c wh...

Yes, it's a standard Python module but, as I mentioned a few time in other questions, I worry that your design model is more complicated than it needs to be.

ANONYMOUS wrote There's no emphasis on speed or great efficiency in this project, but I'm surprised to read that you're using UDP datagrams in a connected manner (guessing you're using send() rather than sendto() ). I've found it much easie...