A. Nilsson

Publications (2)0 Total impact

• Conference Proceeding: Performance of QoS agents for provisioning network resources

  O. Schelen, A. Nilsson, J. Norrgard, S. Pink
  [show abstract] [hide abstract]
  ABSTRACT: We have designed an agent-based architecture for quantitative service provisioning in differentiated services capable networks. For each link-state routing domain in the network there is a topology-aware QoS agent (also known as a bandwidth broker) responsible for admission control. The architecture provides resource reservations for aggregated virtual leased lines between network domains. In this paper, we present performance measurements for resource provisioning in a prototype QoS agent. This includes an evaluation of two data structures for advance reservations and accompanying algorithms. We also compare the cost for on-demand route computations with pre-computation of routes. The objective in this paper is to evaluate the performance of end-to-end admission control within a single link-state routing domain. In a domain with 15 routers, 28 transition networks and 64 stub networks, our prototype performs approximately 25000 end-to-end admission decisions per second. The results show that an ordinary PC can be used for running a QoS agent that performs path-sensitive admission control and maintains per link resource reservations in a link-state routing domain
  Quality of Service, 1999. IWQoS '99. 1999 Seventh International Workshop on; 02/1999
• Source

  Available from: psu.edu

  Conference Proceeding: Extended expedited forwarding: the in-time PHB group

  J. Karlsson, U. Bodin, A. Brodnik, A. Nilsson, O. Schelen
  [show abstract] [hide abstract]
  ABSTRACT: This paper presents a new set of forwarding behaviors that fits rate-adaptive and delay-sensitive applications with limited loss tolerance. We consider an application to have limited loss tolerance if it needs loss-free forwarding of specific packets up to a certain rate. The new set of forwarding behaviors are attractive for developing real-time applications for the Internet. In particular, such applications can be designed to use reserved forwarding capacity efficiently and compete for more bandwidth while being fair to best-effort traffic. To provide the new set of forwarding behaviors, we define a scheduling mechanism that can be implemented efficiently. Through simulations, we show that this mechanism supports the defined forwarding behaviors.
  Computers and Communication, 2003. (ISCC 2003). Proceedings. Eighth IEEE International Symposium on;