Research Article
Software-Defined Congestion Control Algorithm for IP Networks
| Input: link and node distance | | Output: new path and update the flow table | | IF link[]→ congested | | dist[] = INFINITY | | For do | | dist[] = | | For do //find the nearest point | | int mindist = INFINITY | | For do | | If dist[] < mindist | | mindist = dist[] | | For do //update the shortest path | | If mindist + | | dist[] = mindist + | | Newlink → Packet_out //update flowtable | | OFPFC_DELETE | | OFPFC_ADD | | Delete OutFlowtable |
|
