This page contains some programs developed for teaching/researching purposes

Code for "Video-On-Demand Optimization using an Interior-point Algorithm" Final Master Project

The zip file contains the source code to read input data to generate problems instances of "VoD optimal placement content" proposed by Applegate et al. in [1]. The problem instances are generated by using the callable library of BlocKIP solver and it can be saved in mps format. To solve the problem, it is neccesary BlockIP solver [2] ( develpped by Prof. Jordi Castro. The zip file also contains an awk filter to execute batch of instances.

The input data was originally available and explained by Applegate at

[1] Applegate, D., Archer, A., Gopalakrishnan, V., Lee, S., & Ramakrishnan, K. K. (2016). Optimal Content Placement for a Large-Scale VoD System. IEEE/ACM Transactions on Networking, 24(4), 2114–2127.

[2] Castro, J. (2016). Interior-point solver for convex separable block-angular problems. Optimization Methods and Software, 31(1), 88–109.

Code of "Transient analysis of idle time in VANETs using Markov-reward models."

The following zip file contains the modified code of NCTUns 6.0 (currently Estinet) simulator to measure idle time in a 802.11p simulation.

Code of Poly2NCTUns.

This program uses a poly.xml file to generate a Estinet/NCTUns project with the buildings contained in the poly.xml file. The .poly.xml file contains the polygons information from Open Street Maps and it can be created using polyconvert (a tool of SUMO).

Poly2NCTUns constructs the buildings in the Estinet/NCTUns project employing the "obstacles" of Estinet. Obstacles is a native object in Estinet.