SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "(db:Swepub) lar1:(bth) srt2:(1990-1994) srt2:(1993)"

Sökning: (db:Swepub) lar1:(bth) srt2:(1990-1994) > (1993)

  • Resultat 1-10 av 28
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Arvidsson, Åke, et al. (författare)
  • Analysis of the Accuracy of Bursty Traffic Models
  • 1993
  • Konferensbidrag (refereegranskat)abstract
    • Traffic models are an essential component of performance analyses of telecommunication networks. This paper investigates the modeling of bursty traffic streams in both single source and multiple source environments. Using a ranking scheme it is shown that, for the single server case, the switched Poisson process models performed the best and that for the multiple source case, models based on the switched Poisson process, or its discrete version (switched Bernoulli) together with the threshold model may give the closest match to the performance of the “real data“. The results also seem to suggest that for traffic for which there is no known, ideal model, a traffic-oriented fitting method performs better than a model oriented one. This study has concentrated on a particular set of “real data” and it has not tried to consider the many different types of bursty traffic, since, at the time of commencing this study, there was little real data available
  •  
2.
  • Arvidsson, Åke (författare)
  • Strategies for Dynamic Capacity Management
  • 1993
  • Konferensbidrag (refereegranskat)abstract
    • We study networks based on virtual paths, i.e. rearrangable end-to-end transport network. Virtual paths networks are readily implemented in any network using the synchronous digital hierarchy and/or the asynchronous transfer mode. The concept and its advantages, for example cost savings, network operation simplification and enhanced network management capabilities, are discussed. Algorithms for virtual path designs are reviewed and a new algorithm is presented which is found to compare favourably with the algorithm providing the most similar features. Applying it to a real network, we turn to operational aspects of reconfigurable networks such as methods and parameters for traffic estimation and network updating. The validity of the results is demonstrated by means of simulations of a number of networks subject to variable traffics.
  •  
3.
  • Arvidsson, Åke (författare)
  • Strategies for Dynamic Network Management
  • 1993
  • Konferensbidrag (refereegranskat)abstract
    • We study management of transport networks based on virtual paths, i.e. rearrangable end-to-end transport network \highways". Among its main advantages are found cost savings, network op- eration simplification and enhanced network management capabilities. Virtual paths networks are readily implemented in any network using the synchronous digital hierarchy and/or the asyn- chronous transfer mode. Algorithms for virtual path designs are reviewed and found to have a few shortcomings. A new algorithm is therefore proposed and it is found to compare favourably with the algorithm providing the most similar features. Applying the proposed algorithm to a large number of networks, we discuss operational con- siderations associated with reconfigurable networks and investigate simple traffic estimation pro- cedures and their performance in this context. Finally, the choice of reconfiguration parameters such as updating frequency, and the impact of network design time are examined.
  •  
4.
  •  
5.
  •  
6.
  •  
7.
  •  
8.
  •  
9.
  •  
10.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 28

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy