SwePub
Sök i SwePub databas

  Utökad sökning

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

Sökning: db:Swepub > Blekinge Tekniska Högskola > (1990-1994)

  • Resultat 1-10 av 113
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  •  
2.
  • Adolfsson, Vilhelm, et al. (författare)
  • Localized Galerkin Estimates for Boundary Integral Equations on Lipschitz Domanis
  • 1992
  • Ingår i: SIAM Journal on Mathematical Analysis. - : SIAM. ; 5:23, s. 751-764
  • Tidskriftsartikel (refereegranskat)abstract
    • The Galerkin method is studied for solving the boundary integral equations associated with the Laplace operator on nonsmooth domains. Convergence is established with a condition on the meshsize, which involves the local curvature on certain approximating domains. Error estimates are also proved, and the results are generalized to systems of equations.
  •  
3.
  • 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
  •  
4.
  • Arvidsson, Åke (författare)
  • Management of Reconfigurable Virtual Path Networks
  • 1994
  • Ingår i: The Fundamental Role of Teletraffic in the Evolution of Telecommunication Networks. - Amsterdam : Elsevier. - 9920106445 ; , s. 931-940
  • Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
    • We study dynamically rearrangable end-to-end transport networks by means of SDH/SONET and/or ATM virtual paths. The concept and its advantages are brie y reviewed and we propose a new algorithm for designing such networks. Our algorithm provides integer solutions, handles non-linear equivalent bandwidths, finds its own paths, and allows for an arbitrary design optimisation criterion. It is found to perform equal to or better than an earlier, comparable though more restricted, algorithm. We also put forward a strategy for managing virtual paths in real time. It consists of a repeated cycle of on-line measurement of offered traffics followed by the design and implementation of a new virtual path network. Methods and parameters for traffic measurements and network updating frequency are studied and optimised. Applying the strategy to rearrangeable networks subject to variable traffics in a simulator, we discover considerable gains and a robustness in our parameter settings.
  •  
5.
  • Arvidsson, Åke (författare)
  • On Dynamic Capacity Management in Voice/Frame Relaying Networks
  • 1992
  • Konferensbidrag (refereegranskat)abstract
    • We consider call admission and capacity management in a dynamically reconfigurable network that carries a multitude of traffics. Our approach is a heuristic capacity as- signment algorithm designed to maximise an arbitrary profit function. The algorithm is based on the concept of equivalent circuits, i.e. a given relationship between transmis- sion capacities and call handling capabilities expressed as effective numbers of circuits. Such relationships are examined for the two traffics of our application, voice and frame relaying. Methods and results are independent of the transfer mode used.
  •  
6.
  • Arvidsson, Åke, et al. (författare)
  • Performance Comparison of Bursty Traffic Models
  • 1991
  • Konferensbidrag (refereegranskat)abstract
    • Models of bursty arrival processes are reviewed and compared with re- spect to their in uence on the performance of a single server system. Considerable variations are found between different models fitted to the same traffic, though some models exhibit similar behaviour. Comparing the ability of the models to reproduce the performance of an explicitly given parcel they all tend to fail.
  •  
7.
  •  
8.
  •  
9.
  • Arvidsson, Åke (författare)
  • Real Time Management of Virtual Paths
  • 1994
  • Konferensbidrag (refereegranskat)abstract
    • We propose a simple and robust automatic strat- egy for managing SDH/SONET and/or ATM virtual paths in real time to handle slow traffic variations. It consists of on-line measurements of offered traffics followed by the design and possi- ble implementation of a new virtual path network in a repeated cycle. Methods and parameters for traffic measurements and network updating are studied and optimised to achieve maximal traffic carrying capability at minimal cost. Applying our strat- egy to networks subject to partially unknown, variable traffics we discover a considerable adaptivity, large savings in transmis- sion capacity, and a performance far better than achieved by deterministic management.
  •  
10.
  • 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.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 113
Typ av publikation
konferensbidrag (67)
rapport (26)
tidskriftsartikel (11)
licentiatavhandling (5)
bok (1)
annan publikation (1)
visa fler...
doktorsavhandling (1)
bokkapitel (1)
visa färre...
Typ av innehåll
refereegranskat (81)
övrigt vetenskapligt/konstnärligt (32)
Författare/redaktör
Nordholm, Sven (33)
Claesson, Ingvar (32)
Nordebo, Sven (18)
Börjesson, Per Ola (15)
Gustavsson, Jan-Olof (13)
Eriksson, Per (12)
visa fler...
Bengtsson, Bengt (11)
Arvidsson, Åke (9)
Eriksson, Håkan (7)
Ödling, Per (6)
Nilsson, Håkan (6)
Ågren, Björn (5)
Lennerstad, Håkan (5)
Holmer, Nils-Gunnar (5)
Lagö, Thomas L (5)
Lundberg, Lars (4)
Bosch, Jan (4)
Hägg, Staffan (4)
Adolfsson, Stefan (4)
Harris, Richard (4)
Johansson, Conny (3)
Gustavsson, Rune (3)
Ygge, Fredrik (3)
Hansson, Karin (3)
Ohlsson, Lennart (3)
Svensson, Anders (2)
Blomberg, Mats (2)
Dahl, Mattias (2)
Popescu, Adrian (2)
Ericson, Klas (1)
Adolfsson, Vilhelm (1)
Goldberg, Max (1)
Jawerth, Björna (1)
Davidsson, Paul (1)
Granström, Björn (1)
Lövström, Benny (1)
Brorsson, Mats (1)
Mattsson, Michael (1)
Larsson, R (1)
Søilen, Klaus Solber ... (1)
Elenius, Kjell (1)
Johansson, Sven (1)
Winberg, Mathias (1)
Ismailov, Yuri (1)
Berry, Les (1)
Astor, Eric (1)
Ayani, Rassul (1)
Rajaei, Hassan (1)
Rönngren, Robert (1)
Beek, Johan Jaap van ... (1)
visa färre...
Lärosäte
Luleå tekniska universitet (10)
Kungliga Tekniska Högskolan (1)
Språk
Engelska (109)
Svenska (4)
Forskningsämne (UKÄ/SCB)
Teknik (85)
Naturvetenskap (27)
Humaniora (3)
Medicin och hälsovetenskap (1)
Samhällsvetenskap (1)

År

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