M. Antic

University of Belgrade, Beograd, Central Serbia, Serbia

Are you M. Antic?

Claim your profile

Publications (8)5.44 Total impact

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The Internet traffic is growing, and its nature changes because of new applications. Multimedia applications require bandwidth reservations that were not needed initially when the file transfers dominated the Internet. P2P applications are making traffic patterns impossible to predict, and the traffic loads generated at nodes need to be routed regardless of the traffic pattern. When the guaranteed node traffic loads are known, bandwidth reservations can be made simple as will be explained in the paper. The shortest path routing (SPR) protocols used on the Internet today do not maximize the guaranteed node traffic loads, and do not provide scalable and fast bandwidth reservations. Load balancing can improve the network throughput for arbitrary traffic pattern. In this paper we analyze and implement a routing protocol that is based on load balancing and a commonly used shortest path routing protocol, and is, consequently, termed as LB-SPR. LB-SPR is optimized for an arbitrary traffic pattern, i.e. it does not assume a particular traffic matrix. Optimization assumes only the weights assigned to the network nodes according to their estimated demands. It will be shown that the optimized routing achieves the throughputs which are significantly higher than those provided by the currently used SPR protocols, such as OSPF or RIP. Importantly, LB-SPR calculates the guaranteed traffic loads and so allows fast autonomic bandwidth reservations which are the key for the successful support of triple-play applications, including video and audio applications that require high QoS. An actual modification of the TCP/IP stack that includes LBSPR is also described. Using the signaling mechanisms of the OSPF protocol, the information needed to perform the routing optimization is automatically distributed among the network nodes whenever the network topology changes. The LB-SPR implementation is validated on a sample network using a popular virtualization tool - Xen.
    IEEE Journal on Selected Areas in Communications 01/2010; 28(1):51-59. · 3.12 Impact Factor
  • Marija Antic, Aleksandra Smiljanic
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, a practical routing protocol that maximizes the guaranteed node traffic loads in reliable networks is designed and analyzed. The derived node traffic loads can be routed for every traffic pattern, and regardless of the possible single node or link failures. First, it is described how load balanced shortest path routing (LB-SPR) can be optimized to maximize the value of the guaranteed node loads. By assigning the node weights which are fed into the linear program for the routing optimization, different network nodes can be guaranteed different traffic loads, according to their estimated demands. Then, the throughputs of the reliable networks using LB-SPR are determined. The obtained values are compared with the throughputs of the reliable networks using the regular shortestpath routing. The analysis is performed for the real networks, and the regular network topologies, and it is shown that the use of LB-SPR can significantly increase the network throughput.
    Proceedings of the Global Communications Conference, 2010. GLOBECOM 2010, 6-10 December 2010, Miami, Florida, USA; 01/2010
  • Marija Antic, Aleksandra Smiljanic
    [Show abstract] [Hide abstract]
    ABSTRACT: The routing based on load balancing and shortest path routing (LB-SPR) was recently introduced, and it was shown to have advantages over the standard shortest path routing (SPR) algorithms: it can support higher guaranteed traffic loads, and it simplifies the resource reservation processes. In this paper, the cost of setting up the reliable network which is resilient to node or link failures is analyzed. In such a network, enough capacity has to be provisioned on all the links for routing the traffic even in the case of a failure. The cost of setting up the reliable network using the shortest path routing (SPR) is compared to the cost of setting up the reliable network using the load balanced shortest path routing (LB-SPR). It is shown that LB-SPR can significantly decrease the network cost.
    IEEE Communications Letters 01/2010; 14:263-265. · 1.16 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we present implementation and analysis of the novel routing protocol - the two-phase load balanced shortest path routing (LB-SPR). This routing scheme represents the modification of the existing OSPF protocol, and can be optimized to achieve the maximum guaranteed node traffic. Also, the proposed scheme allows the simple and straightforward process of bandwidth reservation, important for multimedia applications. In a testing network environment, we compare the performance of LB-SPR with OSPF, and confirm the better traffic distribution in the case of LB-SPR, which allows to route higher traffic loads. Then we analyze the jitter, as the possible critical aspect of load balancing, and show that the use of load balancing does not crucially affect the quality of transmission.
    Communications, Computers and Signal Processing, 2009. PacRim 2009. IEEE Pacific Rim Conference on; 09/2009
  • M. Antic, A. Smiljanic
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we first describe the load balanced shortest path routing (LB-SPR) protocol. Then, we present the linear program for the optimal capacity allocation, to minimize the resource consumption when LB-SPR is applied in the network. We show that when the load balancing is applied, the capacity allocation problem can be expressed only in terms of the total traffic generated by the network nodes, without the need to know the actual traffic distribution. Then, we compare the resource consumption for the proposed LB-SPR protocol and for the regular shortest path routing (SPR) protocols assuming only the traffic loads that users generate and receive at the network nodes. It will be shown that the proposed LB-SPR protocol needs less network resources. In other words, the LB-SPR protocol can route the same traffic at the lower price than the commonly used SPR protocols.
    High Performance Switching and Routing, 2009. HPSR 2009. International Conference on; 07/2009
  • Source
    M. Antic, A. Smiljanic
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we introduce the novel routing scheme based on load balancing and shortest-path routing. First, we present the linear program for routing optimization. The nonblocking network is considered, which only limits the traffic loads of the network nodes. Guaranteed node traffic loads pass through the network regardless of the actual traffic destinations. The derived optimization includes node priority weights that allow the network planner to assign higher or lower traffic values to the network nodes. Then we analyze the performance of the proposed strategy for some realistic network topologies, and show that the proposed scheme achieves higher guaranteed node traffic loads than the regular shortest-path routing.
    IEEE Communications Letters 07/2009; · 1.16 Impact Factor
  • Source
    IEEE Communications Letters. 01/2009; 13:450-452.
  • Source
    M. Antic, A. Smiljanic
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we propose the oblivious routing scheme based on shortest-path routing and load balancing. We present the LP model that finds the optimal routing. Then we compare the performance of the proposed scheme with the performance of the shortest-path routing for some regular and real-case network topologies. We show that the proposed routing strategy allows to achieve higher guaranteed traffic from/to a node in the network, compared to the case of the classical shortest-path routing.
    Communications, 2008. ICC '08. IEEE International Conference on; 06/2008