Performance Analysis of VoIP Codecs over WiMax and WiFi Networks

Presentation slides and final report (PDF files).

Abstract:
Many countries have migrated their communication systems to more advance technology such as WiMax and LTE (Long Term Evolution). Both standards provide high data rate for voice and data, and enable roaming for portable clients. One of the important factors that affects the Quality of Service (QoS) in any mobile communication system is handover performance. This project compares and evaluates the handoff process in both WiMax and LTE in terms of the throughput and delay.

References:
Majanen, M.; Perala, P.H.J.; Casey, T.; Nurmi, J.; Veselinovic, N.; , "Mobile WiMAX Handover Performance Evaluation," Networking and Services, 2009. ICNS '09. Fifth International Conference on , vol., no., pp.263-269, 20-25 April 2009.
Pardi, M.S.; Baba, M.D.; Ibrahim, M.; , "Analysis of handover performance in mobile WiMAX networks," Control and System Graduate Research Colloquium (ICSGRC), 2011 IEEE , vol., no., pp.143-149, 27-28 June 2011.
Jihai Han; Bingyang Wu; , "Handover in the 3GPP long term evolution (LTE) systems," Mobile Congress (GMC), 2010 Global , vol., no., pp.1-6, 18-19 Oct. 2010.
Gao Hui; Legg, P.; , "LTE Handover Optimisation Using Uplink ICIC," Vehicular Technology Conference (VTC Spring), 2011 IEEE 73rd , vol., no., pp.1-5, 15-18 May 2011.
Aziz, D.; Sigle, R.; , "Improvement of LTE Handover Performance through Interference Coordination," Vehicular Technology Conference, 2009. VTC Spring 2009. IEEE 69th , vol., no., pp.1-5, 26-29 April 2009.

Comparison of anonymization tools

Presentation slides and final report (PDF files).

Abstract:
Collecting network traffic traces from real time network is one of the basics for network research. These traces can be used to study real users, traffic engineering, packet classification, web performance, security application or more general network measurement and simulation. However, for security and privacy reasons monitored traffic traces have to be modified before they are published. This is known as trace anonymization process [1]. Many tools and techniques have been implemented for anonymization purposes [2]. To name few of these tools are Crypto-PAn, Anontool, ip2anonip, Lucent's extensions to Crypto-PAn, IP-Anonymous, TCPdprive [3]. Different tools use different anonymization algorithm. Few of these algorithms are: black-marker, random permutations, truncation, pseudonymization, and prefix-preserving pseudonymization. The goal of anonymization is to preserve the structure of the network while at the same preserve privacy policies. This project intends to compare the tools mentioned above to see which tool preserves the goals of anonymization [4]. More specifically, we will calculate and compare the preserve matrices such as arithmetic averages and standard deviation. We will also compare the cumulative distribution function of the distribution of the flow size.

References:
[1] D. Koukis, S. Antonatos, D. Antoniades, E. P. Markatos, and P. Trimintzios, "A generic anonymization framework for network traffic," in Proceedings of the IEEE International Conference on Communications(ICC 2006), June 2006, Istanbul, Turkey.
[2] M. Foukarakis, D. Antoniades, S. Antonatos, and E. P. Markatos, "On the anonymization and de-anonymization of netflow traffic," in Proceedings of Conference for Network Flow Analysis (FloCon 2008), January 2008, Savannah, Georgia, USA.
[3] Anonymization Tools Taxonomy [online]. Available: http://www.caida.org/tools/taxonomy/anontaxonomy.xml#canine.
[4] A. Slagell, J. Wang, and W. Yurcik, "Network Log Anonymization: Application of Crypto-PAn to Cisco NetFlows," NSF/AFRL Workshop on Secure Knowledge Management (SKM '04), September 2004, Buffalo, NY, USA.
[5] M. Foukarakis, D. Antoniades, S. Antonatos, and E. P. Markatos, "Flexible and high-performance anonymization of Netflow records using Anontool," in Proceedings of the Third International Workshop on the Value of Security through Collaboration (SECOVAL), September 2007, Nice, France, pp. 33-38.
6. M. Peuhkuri." A method to compress and anonymize packet traces," in Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement (IMW '01), NY, USA, pp. 257?261.

Integrating BGP with ns-3.13 network simulator (ns3-BGP)

Presentation slides and final report (PDF files).

Abstract:
The network simulator 3, ns3, is a discrete event network simulator. It is popular in research community for its extensibility (due to its open source model) and plentiful online documentation. ns3 is widely used in the simulation of routing and multicast protocols.

The Border Gateway Protocol (BGP) is an inter-Autonomous System routing protocol. Border Gateway Protocol 4 (BGP-4) proposed in RFC 1771 by Y. Rekhter and T. Li from Network Working Group within the Internet Engineering Task Force [1]. The primary function of a BGP speaking system is to exchange network reachability information with other BGP systems.

The BGP performance is changing due to the dynamic nature of the internet. Therefore, the academia needed to study the protocol in a network simulator. As the result, BGP was integrated into ns-2.27 in 2004 and was named ns-BGP [2]. Later, the application was updated for ns-2.33 in 2008 [3] then for ns-2.34 in 2009 [4]. This is the latest effort to implement ns-BGP for ns-3.13.

The project is scaled down to sending and receiving BGP messages to match the scope of the class.

References:
[1] Y. Rekhter and T. Li, "A Border Gateway Protocol 4 (BGP-4)," RFC 1771, March 1995.
[2] T. D. Feng, R. Ballantyne, and Lj Trajkovic, "Implementation of BGP in a network simulator," Proc. Applied Telecommunication Symposium, ATS '04, Arlington, Virginia, Apr. 2004.
[3] ns-BGP integration with ns-2.33 [Online]. Available: http://www.ensc.sfu.ca/~ljilja/cnl/projects/BGP-ns-2.33/ENSC-891-Summer08_report_hrudey.pdf.
[4] ns-BGP integration with ns-2.34 [Online]. Available: http://www.ensc.sfu.ca/~ljilja/cnl/projects/BGP-ns-2.34/ns-BGP_for_ns-2.34_final_report_edited_v1.pdf.
[5] BGP, Border Gateway Protocol [Online]. Available: http://www.networksorcery.com/enp/protocol/bgp.htm.

Performance Analysis of Scheduling disciplines using OPNET

Presentation slides and final report (PDF files).

Abstract:
Along with the development of Internet technology, the increasing network services produce a large number of traffic. Especially UDP traffic data is dramatically increasing, since the P2P and steaming technologies have been used widely. It's different with TCP, UDP protocol does not have the ability to control congestion. UDP traffic is easily jamming the network link and cause unfair packet transmission or Dropping. In this project, we use OPNET Modeler to analyze the performance of first-in-first-out (FIFO) queuing, priority queuing (PQ), and weighted-fair queuing (WFQ), which are deployed in IP networks. Various simulation scenarios are designed to compare performance of FIFO, PQ, and WFQ and explains which is a better method of queuing.

References:
[1] T. P.R. Nyirenda-Jere, V. S. Frost, N. Akar, "Capacity requirements of traffic handling schemes in multi-service networks," Computer Communications, Volume 28, Issue 18, Nov. 2005, pp. 2070-2081.
[2] T. Velmurugan, H. Chandra, S. Balaji, "Comparison of Queuing Disciplines for Differentiated Services Using OPNET," in 2009 International conference on Advance in Recent Technologies in Communication and Computing (ARTCom), Kottayam, Kerala India, Nov. 2009, pp. 744 - 746.
[3] A. Sen, I. Mohammed, R. Samprathi,S. Bandyopadhyay, "Fair queuing with round robin: a new packet scheduling algorithm for routers," in Seventh IEEE Symposium on Computers and Communications (ISCC 2002). Nov. 2002, Giardini Naxos, Italy, pp. 1001 - 1006.
[4] T. Subash, S. IndiraGandhi, "Performance analysis of scheduling disciplines in optical networks," in 2006 IFIP International Conference on Wireless and Optical Communications Networks, Bangalore, India, Aug. 2006, pp. 5.
[5] P. Trimintzios, T. Bauge, G. Pavlou, P. Flegkas, R. Egan, "Quality of service provisioning through traffic engineering with applicability to IP-based production networks," Computer Communications, Volume 26, Issue 8, May 2003, pp. 845-860.

Intelligent Deflection Routing Protocol

Presentation slides and final report (PDF files).

Abstract:
Contention is the main source of burst loss in Optical Burst Switched (OBS) networks where deflection routing is one of the methods to resolve contention. Deflection routing requires enhancements only in the routing software without additional hardware installations. Its main goal is to successfully deflect a burst based only on a limited knowledge that nodes posses about their environment.

In this paper, we present an intelligent deflection protocol named iDef. The iDef enhances a node with intelligent decision making ability through a Monte-Carlo planning algorithm, which employs a forward search to select the best output interface for a burst to be deflected. The proposed iDef design enables a node to adapt itself to changes in network topology and traffic patterns.

References:
[1] C. Qiao and M. Yoo, ÒOptical burst switching (OBS) Ð a new paradigm for an optical Internet,Ó Journal of High Speed Networks, vol. 8, pp. 69Ð84, Mar. 1999.
[2] H. G. Perros, Connection-Oriented Networks: SONET/SDH, ATM, MPLS and Optical Networks. UK: John Wiley & Sons Ltd., 2005.
[3] I. Baldine, G. Rouskas, H. Perros, and D. Stevenson, ÒJumpstart: a justin- time signaling architecture for WDM burst-switched networks,Ó IEEE Communications Magazine, vol. 40, no. 2, pp. 82 Ð89, Feb. 2002.
[4] Y. Chen, C. Qiao, and X. Yu, ÒOptical burst switching (OBS): a new area in optical networking research,Ó IEEE Network Magazine, vol. 18, no. 3, pp. 16 Ð 23, June 2004.