Search Results

Yes, file-2 will have data for all lines in file-1. So for line 2 "2 4 6 3 8 9" in file-1, file-2 will have something like this:

2 4 1
4 6 2
6 3 1
3 8 4
8 9 4

And then it takes...

I have two LARGE files of data more than 20,000 line each, file-1 and file-2, and I wish to do the following if possible:

file-1

1 2 5 7 9
2 4 6 3 8 9
4 6 8 9 3 2 1 3
1 2
.
.
.

...

Although I added a comma after the second done, the script is just listing all IPs in a line without probing clients!

If I understand you correctly, what you suggest is to iperf all clients in list.10, and at the end repeat any client that has no "%" sign in its file, correct? And for how many times you repeat...

I appreciate the previous help on this issue; I really still have problems in executing this script remotely over a large scale network. For technical reasons this loop sometimes hang on an IP...

I'll give a try, and get back. THANK YOU.

I've been tired from not understanding why a background process is being killed after a time!

./iperf -s -u -D (this by itself should stay alive until I give a kill command, the -D option in the...

Thanks alot once again. The missing ssh's info is regarding a privacy concern of a network I'm working on, and sorry if that adds some confusion.

All the best for you.

---------- Post updated...

I have seen some indicators that say Dijkstra can do the job after adjustments, but not that strong in c programming.

EE122 Introduction to Computer Networks Department of Electrical...

Can you kindly please check what's wrong here (the full script).

while read machine do echo " "; echo "# Outer loop: $machine"; echo "==================="; ssh -i /~/~/~/~/~ ~@$machine 'cd iperf;...

A minute and will post an input file and the correct source code if the problem is clear for you. Normal Dijkstra gives you the shortest path between any two nodes in terms of let's say loss rate....

How can I check the % sign? If exists do the next loop, else repeat the current until success.

---------- Post updated at 02:08 PM ---------- Previous update was at 02:06 PM ----------

Yes, you...

Can you help to adjust the void dijkstra(int s) function to find a path from source to every node so that the minimum cost on that path is maximum.
Ex:
From 1 to 2 we have 1 - 3 - 4 - 2 ,...

I'm trying to write a shell script to do the following job:

Do a for loop in list.10 by iperf-ing (A Linux command, and you can try any command like traceroute if you don't have this installed)...