The tag has no usage guidance.

learn more… | top users | synonyms

2
votes
0answers
27 views

How to know for sure that a router is congested?

Suppose a router X is dropping packets. Another router A will investigate whether X is dropping packets due to congestion. What are the procedures that A should follow? A already knows X's buffer ...
2
votes
1answer
37 views

Route planning for a car driver picking up people using public transport

We just had an interesting though for a routing algorithm for people carpooling. Imagine the following situation: Person 1 is driving with his car from the south of city A to city B far in the north. ...
1
vote
0answers
43 views

Best route around confirmed appts - Traveling Salesman Problem

First, I am not a programmer, but an end user. We are trying to come up with a solution to a TSP issue that is causing us SIGNIFICANT time being wasted "manually" routing. Here is the issue. We ...
0
votes
1answer
116 views

Algorithm for finding the best “route” of tasks

I have the following problem: Let's say I'm in a city with some friend we have a bunch of tasks to do. All persons start on a different position, for example (0/0), (10/5), (-20/0), ... , and every ...
0
votes
2answers
43 views

Listing all possible train routes [closed]

I'm interested whether there is the standard solution to the following problem. Some number of train routes is given: Route1: First City -> Next City -> ... -> Last City Route2: ... ... We need to ...
3
votes
1answer
68 views

Unsplittable flow in capacitated networks

I have an undirected network with capacitated links/edges. Between some nodes unsplittable traffic has to be routed. All demands and capacities are known, but it is uncertain if all flows can be ...
0
votes
2answers
90 views

Bellman–Ford negative path meaning

In the Bellman–Ford algorithm, what is the practical meaning of having a negative path between routers? I have tried searching the net but didn't find any data thanks Eli
2
votes
0answers
101 views

Optimal vehicle routing on map

Currently I am developing a piece of software that solves the vehicle routing problem. The task is the following: I have several vehicles along the town I have lots of destination points along the ...
0
votes
1answer
45 views

How can one come up with reasonable IP subnet allocations?

An ISP has following chunk of CIDR-based IP addresses available with it: 245.248.128.0/20 The ISP wants to give half of this chunk addresses to Organization A, and ...
1
vote
0answers
44 views

Buffering packets vs. low latency routing [closed]

I am considering strategies to compare the performance of routers with buffers vs. their lower latency counterparts in a simple network setting (N clients communicating with each other randomly ...
2
votes
1answer
2k views

Destination-based vs source-based routing

I understand that destination-based routing builds the "route" from the destination backwards to the source (e.g. if using a spanning tree, then the tree is routed at the destination). With ...
2
votes
0answers
283 views

Time complexity 2-opt method

I'm doing a practice test for a course on routing problems. There's a question asking to infere the time complexity of the 2-opt method. I can see that the complexity per iteration is in $O(n^2)$ ...
2
votes
1answer
260 views

Simple routing table question

I'm having difficulties understanding the solution to the following question: Consider the following description of a LAN: The main Internet connection is connected to our gateway router. ...