public string getExternalPorts(int src, int trg, int connectN, int requieredCapacity)
{
string rtn = "";
RoutingGraph ownTopology = RoutingGraph.MapTopology(manager.Topology, ConnectionController.VirtualPaths, requieredCapacity);
SetupStore ss = new SetupStore(src, trg, ownTopology, connectN, requieredCapacity);
int iter = 1;
do
{
if (ss.ownTopology.EdgeCount != 0)
{
ss = new SetupStore(src, trg, ownTopology, connectN, requieredCapacity);
if (this.findBestPath(ss) && this.askLRMs(ss)) //if true -> creating list vcivpi
{
rtn += getLastLink(ss) + "#";
int size = ss.path.Count;
ownTopology.RemoveEdge(ss.path[size - 1]);
}
else
{
return(null);
}
}
}while(isExternalLink(ss, trg));
return(rtn);
}
public NetworkConnection getPathViaExternalLink(int src, int trg, int connectN, int requieredCapacity, string link)
{
RoutingGraph ownTopology = RoutingGraph.MapTopology(manager.Topology, ConnectionController.VirtualPaths, requieredCapacity);
List <RoutingGraph.Link> toRemove = new List <RoutingGraph.Link>();
string slot = link.Split(':')[1];
foreach (var edge in ownTopology.Edges)
{
if (edge.tLink.Name != link.Split(':')[0] && edge.tLink.Name.Contains("External"))
{
toRemove.Add(edge);
}
}
foreach (var rm in toRemove)
{
ownTopology.RemoveEdge(rm);
}
SetupStore ss = new SetupStore(src, trg, ownTopology, connectN, requieredCapacity);
if (ss.ownTopology.EdgeCount != 0)
{
if (this.findBestPath(ss) && this.askLRMs(ss, slot)) //if true -> creating list vcivpi
{
return(this.parseToNetworConnection(ss));
}
else
{
return(null);
}
}
return(null);
}
private bool isExternalLink(SetupStore ss, int target)
{
foreach (var edge in ss.ownTopology.Edges)
{
if (edge.Target.Id == target)
{
return(true);
}
}
return(false);
}
public NetworkConnection assignRoute(int src, int trg, int connectN, int requieredCapacity)
{
RoutingGraph ownTopology = RoutingGraph.MapTopology(manager.Topology, ConnectionController.VirtualPaths, requieredCapacity);
SetupStore ss = new SetupStore(src, trg, ownTopology, connectN, requieredCapacity);
if (ss.ownTopology.EdgeCount != 0)
{
if (this.findBestPath(ss) && this.askLRMs(ss)) //if true -> creating list vcivpi
{
return this.parseToNetworConnection(ss);
}
else
return null;
}
return null;
}
public NetworkConnection assignRoute(int src, int trg, int connectN, int requieredCapacity)
{
RoutingGraph ownTopology = RoutingGraph.MapTopology(manager.Topology, ConnectionController.VirtualPaths, requieredCapacity);
SetupStore ss = new SetupStore(src, trg, ownTopology, connectN, requieredCapacity);
if (ss.ownTopology.EdgeCount != 0)
{
if (this.findBestPath(ss) && this.askLRMs(ss)) //if true -> creating list vcivpi
{
return(this.parseToNetworConnection(ss));
}
else
{
return(null);
}
}
return(null);
}
public bool askLRMs(SetupStore ss, string preferedSlot = "")
{
string VpiVci = "";
/*
if (!manager.Ping(ss.source))
return false;*/
foreach (var e in ss.path)
{/*
if (!manager.Ping(e.Target.Id))
return false;*/
string[] srcrt;
string[] trgrt;
int i = 0;
do
{
string tmp1 = e.SourceRouting.Replace(".", ":");
string tmp2 = e.TargetRouting.Replace(".", ":");
srcrt = tmp1.Split(':'); // [0] -> Port, [1] -> Slot
trgrt = tmp2.Split(':');
if (preferedSlot != "")
srcrt[1] = trgrt[1] = preferedSlot;
else if (srcrt[1] == "" && trgrt[1] == "")
{
srcrt[1] =
trgrt[1] = rand();
}
i++;
} while (
!lrm.isAvailable(e.Source.tNode.Name, e.Target.tNode.Name, Convert.ToInt32(srcrt[1])) ||
!lrm.isAvailable(e.Source.tNode.Name, e.Target.tNode.Name, Convert.ToInt32(trgrt[1]))
);
// lrm.reserve(e.Source.tNode.Name, e.Target.tNode.Name, Convert.ToInt32(srcrt[1]));
// lrm.reserve(e.Source.tNode.Name, e.Target.tNode.Name, Convert.ToInt32(trgrt[1]));
e.SourceRouting = srcrt[0] + "." + srcrt[1];
e.TargetRouting = trgrt[0] + "." + trgrt[1];
ss.vcivpiList.Add(VpiVci);
}
return true;
}
public bool askLRMs(SetupStore ss, string preferedSlot = "")
{
string VpiVci = "";
/*
* if (!manager.Ping(ss.source))
* return false;*/
foreach (var e in ss.path)
{/*
* if (!manager.Ping(e.Target.Id))
* return false;*/
string[] srcrt;
string[] trgrt;
int i = 0;
do
{
string tmp1 = e.SourceRouting.Replace(".", ":");
string tmp2 = e.TargetRouting.Replace(".", ":");
srcrt = tmp1.Split(':'); // [0] -> Port, [1] -> Slot
trgrt = tmp2.Split(':');
if (preferedSlot != "")
{
srcrt[1] = trgrt[1] = preferedSlot;
}
else if (srcrt[1] == "" && trgrt[1] == "")
{
srcrt[1] =
trgrt[1] = rand();
}
i++;
} while (
!lrm.isAvailable(e.Source.tNode.Name, e.Target.tNode.Name, Convert.ToInt32(srcrt[1])) ||
!lrm.isAvailable(e.Source.tNode.Name, e.Target.tNode.Name, Convert.ToInt32(trgrt[1]))
);
// lrm.reserve(e.Source.tNode.Name, e.Target.tNode.Name, Convert.ToInt32(srcrt[1]));
// lrm.reserve(e.Source.tNode.Name, e.Target.tNode.Name, Convert.ToInt32(trgrt[1]));
e.SourceRouting = srcrt[0] + "." + srcrt[1];
e.TargetRouting = trgrt[0] + "." + trgrt[1];
ss.vcivpiList.Add(VpiVci);
}
return(true);
}
private NetworkConnection parseToNetworConnection(SetupStore ss)
{
NetworkConnection networkConnection = new NetworkConnection(ss.connectN);
// List<LinkConnection> links = new List<LinkConnection>();
LinkConnection link;
networkConnection.Capacity = ss.requieredCapacity;
foreach (var e in ss.path)
{
link = new LinkConnection();
link.SourceId = e.Source.tNode.Name;
link.TargetId = e.Target.tNode.Name;
link.SourceRouting = e.SourceRouting;
link.TargetRouting = e.TargetRouting;
link.Link = e.tLink;
networkConnection.Path.Add(link);
}
return(networkConnection);
}
bool findBestPath(SetupStore ss)
{
Dictionary <RoutingGraph.Link, double> edgeCost = new Dictionary <RoutingGraph.Link, double>(ss.ownTopology.EdgeCount);
int index = 0;
int max = ss.ownTopology.EdgeCount;
while (index < max)
{ //free capisity < requierd
if (ss.ownTopology.Edges.ElementAt(index).Capacity < ss.requieredCapacity)
{
ss.ownTopology.RemoveEdge(ss.ownTopology.Edges.ElementAt(index));
max = ss.ownTopology.EdgeCount;
}
else
{
index++;
}
}
foreach (var e in ss.ownTopology.Edges)
{
edgeCost.Add(e, e.Capacity);
}
var dijkstra = new DijkstraShortestPathAlgorithm <RoutingGraph.Node, RoutingGraph.Link>(ss.ownTopology, e => edgeCost[e]);
var predecessor = new VertexPredecessorRecorderObserver <RoutingGraph.Node, RoutingGraph.Link>();
predecessor.Attach(dijkstra);
dijkstra.Compute(this.IDtoNode(ss.source, ss.ownTopology));
IEnumerable <RoutingGraph.Link> path;
if (predecessor.TryGetPath(this.IDtoNode(ss.target, ss.ownTopology), out path))
{
ss.path.AddRange(path);
return(true);
}
else
{
return(false);
}
}
private NetworkConnection parseToNetworConnection(SetupStore ss)
{
NetworkConnection networkConnection = new NetworkConnection(ss.connectN);
// List<LinkConnection> links = new List<LinkConnection>();
LinkConnection link;
networkConnection.Capacity = ss.requieredCapacity;
foreach (var e in ss.path)
{
link = new LinkConnection();
link.SourceId = e.Source.tNode.Name;
link.TargetId = e.Target.tNode.Name;
link.SourceRouting = e.SourceRouting;
link.TargetRouting = e.TargetRouting;
link.Link = e.tLink;
networkConnection.Path.Add(link);
}
return networkConnection;
}
private bool isExternalLink(SetupStore ss, int target)
{
foreach (var edge in ss.ownTopology.Edges)
if (edge.Target.Id == target)
return true;
return false;
}
private string getLastLink(SetupStore ss)
{
return ss.path[ss.path.Count-1].tLink.Name;
}
bool findBestPath(SetupStore ss)
{
Dictionary<RoutingGraph.Link, double> edgeCost = new Dictionary<RoutingGraph.Link, double>(ss.ownTopology.EdgeCount);
int index = 0;
int max = ss.ownTopology.EdgeCount;
while (index < max)
{ //free capisity < requierd
if (ss.ownTopology.Edges.ElementAt(index).Capacity < ss.requieredCapacity)
{
ss.ownTopology.RemoveEdge(ss.ownTopology.Edges.ElementAt(index));
max = ss.ownTopology.EdgeCount;
}
else
index++;
}
foreach (var e in ss.ownTopology.Edges)
{
edgeCost.Add(e, e.Capacity);
}
var dijkstra = new DijkstraShortestPathAlgorithm<RoutingGraph.Node, RoutingGraph.Link>(ss.ownTopology, e => edgeCost[e]);
var predecessor = new VertexPredecessorRecorderObserver<RoutingGraph.Node, RoutingGraph.Link>();
predecessor.Attach(dijkstra);
dijkstra.Compute(this.IDtoNode(ss.source, ss.ownTopology));
IEnumerable<RoutingGraph.Link> path;
if (predecessor.TryGetPath(this.IDtoNode(ss.target, ss.ownTopology), out path))
{
ss.path.AddRange(path);
return true;
}
else return false;
}
public NetworkConnection getPathViaExternalLink(int src, int trg, int connectN, int requieredCapacity, string link)
{
RoutingGraph ownTopology = RoutingGraph.MapTopology(manager.Topology, ConnectionController.VirtualPaths, requieredCapacity);
List<RoutingGraph.Link> toRemove = new List<RoutingGraph.Link>();
string slot = link.Split(':')[1];
foreach (var edge in ownTopology.Edges)
{
if (edge.tLink.Name != link.Split(':')[0] && edge.tLink.Name.Contains("External"))
{
toRemove.Add(edge);
}
}
foreach (var rm in toRemove)
{
ownTopology.RemoveEdge(rm);
}
SetupStore ss = new SetupStore(src, trg, ownTopology, connectN, requieredCapacity);
if (ss.ownTopology.EdgeCount != 0)
{
if (this.findBestPath(ss) && this.askLRMs(ss, slot)) //if true -> creating list vcivpi
{
return this.parseToNetworConnection(ss);
}
else
return null;
}
return null;
}
public string getExternalPorts(int src, int trg, int connectN, int requieredCapacity)
{
string rtn = "";
RoutingGraph ownTopology = RoutingGraph.MapTopology(manager.Topology, ConnectionController.VirtualPaths, requieredCapacity);
SetupStore ss = new SetupStore(src, trg, ownTopology, connectN, requieredCapacity);
int iter = 1;
do{
if (ss.ownTopology.EdgeCount != 0)
{
ss = new SetupStore(src, trg, ownTopology, connectN, requieredCapacity);
if (this.findBestPath(ss) && this.askLRMs(ss)) //if true -> creating list vcivpi
{
rtn += getLastLink(ss)+"#";
int size = ss.path.Count;
ownTopology.RemoveEdge(ss.path[size - 1]);
}
else
return null;
}
}while(isExternalLink(ss, trg));
return rtn;
}
private string getLastLink(SetupStore ss)
{
return(ss.path[ss.path.Count - 1].tLink.Name);
}
