An Efficient Approximate Algorithm for Disjoint QoS Routing

Table 1

Comparative results between our algorithm and Cplex.

Dataset	Metrics	Our algorithm					Cplex
		CON	OBJ	OBJ-type	Time (in s)	ITE	OBJ	Time (in s)
Dataset 1	𝑛=400; 𝑚=3694; 𝑘=2	1	100	O	0.016	0	100	0.078
		3	100	O	0.016	0	100	0.125
		5	100	O	0.015	0	100	0.188
		7	113	F	0.016	1	109	0.281
		9	113	F	0.016	1	109	0.344
Dataset 2	𝑛=800; 𝑚=6666; 𝑘=2	1	117	F	0.047	1	117	0.171
		3	128	F	0.046	1	120	0.313
		5	120	F	0.048	1	120	0.484
		7	120	F	0.046	1	120	0.641
		9	120	F	0.046	1	120	0.843
Dataset 3	𝑛=1200; 𝑚=9838; 𝑘=2	1	117	O	0.031	0	117	0.266
		3	118	F	0.246	4	118	0.594
		5	143	F	0.405	8	123	1.015
		7	146	F	0.187	3	123	1.359
		9	136	F	0.157	3	136	3.516
Dataset 4	𝑛=1600; 𝑚=12902; 𝑘=2	1	165	F	0.109	0	151	0.485
		3	167	F	0.094	0	154	2.266
		5	162	F	0.11	0	155	2.422
		7	155	O	0.109	0	155	2.907
		9	155	O	0.078	0	155	3.891
Dataset 5	𝑛=2000; 𝑚=18352; 𝑘=2	1	132	O	0.094	0	132	0.688
		3	135	F	0.156	1	135	1.641
		5	135	F	0.172	1	135	2.469
		7	158	F	0.328	3	143	3.672
		9	158	F	0.266	2	143	4.562