SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Hjalmarsson Håkan) ;pers:(Johansson Karl Henrik)"

Sökning: WFRF:(Hjalmarsson Håkan) > Johansson Karl Henrik

  • Resultat 1-10 av 13
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Briat, C., et al. (författare)
  • The Conservation of Information, Towards an Axiomatized Modular Modeling Approach to Congestion Control
  • 2015
  • Ingår i: IEEE/ACM Transactions on Networking. - 1063-6692 .- 1558-2566. ; 23:3, s. 851-865
  • Tidskriftsartikel (refereegranskat)abstract
    • We derive a modular fluid-flow network congestion control model based on a law of fundamental nature in networks: the conservation of information. Network elements such as queues, users, and transmission channels and network performance indicators like sending/acknowledgment rates and delays are mathematically modeled by applying this law locally. Our contributions are twofold. First, we introduce a modular metamodel that is sufficiently generic to represent any network topology. The proposed model is composed of building blocks that implement mechanisms ignored by the existing ones, which can be recovered from exact reduction or approximation of this new model. Second, we provide a novel classification of previously proposed models in the literature and show that they are often not capable of capturing the transient behavior of the network precisely. Numerical results obtained from packet-level simulations demonstrate the accuracy of the proposed model.
  •  
2.
  • Ebadat, Afrooz, et al. (författare)
  • Blind identification strategies for room occupancy estimation
  • 2015
  • Ingår i: 2015 European Control Conference (ECC). - Piscataway, NJ : IEEE Communications Society. - 9783952426937 ; , s. 1315-1320
  • Konferensbidrag (refereegranskat)abstract
    • We propose and test on real data a two-tier estimation strategy for inferring occupancy levels from measurements of CO2 concentration and temperature levels. The first tier is a blind identification step, based either on a frequentist Maximum Likelihood method, implemented using non-linear optimization, or on a Bayesian marginal likelihood method, implemented using a dedicated Expectation-Maximization algorithm. The second tier resolves the ambiguity of the unknown multiplicative factor, and returns the final estimate of the occupancy levels. The overall procedure addresses some practical issues of existing occupancy estimation strategies. More specifically, first it does not require the installation of special hardware, since it uses measurements that are typically available in many buildings. Second, it does not require apriori knowledge on the physical parameters of the building, since it performs system identification steps. Third, it does not require pilot data containing measured real occupancy patterns (i.e., physically counting people for some periods, a typically expensive and time consuming step), since the identification steps are blind.
  •  
3.
  • Ebadat, Afrooz, et al. (författare)
  • Multi-room occupancy estimation through adaptive gray-box models
  • 2015
  • Ingår i: IEEE 54th Annual Conference on Decision and Control (CDC). - Piscataway, NJ : IEEE Communications Society. - 9781479978861 ; , s. 3705-3711, s. 3705-3711
  • Konferensbidrag (refereegranskat)abstract
    • We consider the problem of estimating the occupancy level in buildings using indirect information such as CO2 concentrations and ventilation levels. We assume that one of the rooms is temporarily equipped with a device measuring the occupancy. Using the collected data, we identify a gray-box model whose parameters carry information about the structural characteristics of the room. Exploiting the knowledge of the same type of structural characteristics of the other rooms in the building, we adjust the gray-box model to capture the CO2 dynamics of the other rooms. Then the occupancy estimators are designed using a regularized deconvolution approach which aims at estimating the occupancy pattern that best explains the observed CO2 dynamics. We evaluate the proposed scheme through extensive simulation using a commercial software tool, IDA-ICE, for dynamic building simulation.
  •  
4.
  • Jacobsson, Krister, et al. (författare)
  • ACK-clocking dynamics: Modelling the interaction between windows and the network
  • 2008
  • Ingår i: 27TH IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (INFOCOM). - 9781424420254 ; , s. 181-185
  • Konferensbidrag (refereegranskat)abstract
    • A novel continuous time fluid flow model of the dynamics of the interaction between ACK-clocking and the link buffer is presented.. A fundamental integral equation relating the instantaneous flow rate and the window dynamics is derived. Properties of the model, such as well-posedness and stability, are investigated. Packet level experiments verily that this new model is more accurate than existing models, correctly predicting qualitatively different behaviors, for example when round trill delays are heterogeneous.
  •  
5.
  • Jacobsson, Krister, et al. (författare)
  • Estimation of RTT and bandwidth for congestion Control Applications in Communication Networks
  • 2004
  • Konferensbidrag (refereegranskat)abstract
    • Heterogeneous communication networks with their variety of application demands, uncertain time-varying traffic load, and mixture of wired and wireless links pose several challenging problem in modeling and control. In this paper we focus on the round-trip time (RTT), which is a particularly important variable for efficient end-to-end congestion control, and on bandwidth estimation. Based on a simple aggregated model of the network, an algorithm combining a Kalman filter and a change detection algorithm is proposed for RTT estimation. It is illustrated on real data that this algorithm provides estimates of significantly better accuracy as compared to the RTT estimator currently used in TCP, especially in scenarios where new cross-trafficflows cause bottle-neck queues to rapidly build up which in turn induces rapid changes of the RTT. Standard techniques for bandwidth estimation is based on measurements of inter-arrival times of packets as the bandwidth is proportional to the inverse of the inter-arrival time. Two main classes of bandwidth estimators are analyzed wrt how variations in the inter-arrival times affect the estimates. It is shown that linear time-invariant filtering of instantaneous bandwidth estimates does not change the bias. In contrast to this, smoothing the inter-arrival-time samples, does give a bias reduction which depends on the smoothing filter. Hence, with such approach, noise attenuation can be traded against tracking ability wrt changes in the actual bandwidth.
  •  
6.
  • Jacobsson, Krister, et al. (författare)
  • Round trip time estimation in communication networks using adaptive Kalman filtering
  • 2004
  • Konferensbidrag (refereegranskat)abstract
    • Heterogeneous communication networks with their variety of application demands, uncertain time-varying traffic load, and mixture of wired and wireless links pose several challenging problem in modeling and control. In this paper we focus on the roundtrip time (RTT), which is a particularly important variable for efficient end-to-end congestion control. Based on a simple aggregated model of the network, an algorithm combining a Kalmanfilter and a change detection algorithm is proposed for RTT estimation. It is illustrated on real data that this algorithm provides estimates of significantly better accuracy as compared to the RTT estimator currently used in TCP, especially in scenarios where new cross-trafficflows cause a bottle-neck link to rapidly build up a queue, which in turn induces rapid changes of the RTT.
  •  
7.
  • Jacobsson, Krister, et al. (författare)
  • Some modeling and estimation issues in control of heterogeneous networks
  • 2004
  • Konferensbidrag (refereegranskat)abstract
    • Heterogeneous communication networks with their variety of application demands, uncertain time-varying trafc load, and mixture of wired and wireless links pose several challenging problem in modeling and control. In this paper we focus on the round-trip time (RTT), which is a particularly important variable for efficient end-to-end congestion control. Based on a simple aggregated model of the network, an algorithm combining a Kalman lter and a change detection algorithm is proposed for RTT estimation. It is illustrated on real data that this algorithm provides estimates of significantly better accuracy as compared to the RTT estimator currently used in TCP.We also analyze how wireless links affect the RTT distribution. Link re-transmissions induce delays which do not conform to the assumptions on which the transport protocol is based. This causes undesired TCP control actions which reduce throughput. A link layer solution based on adding carefully selected delays to certain packets is proposed to counteract this problem.
  •  
8.
  •  
9.
  • Jacobsson, Krister, et al. (författare)
  • Unbiased bandwidth estimation in communication protocols
  • 2005
  • Ingår i: Proceedings of the 16th IFAC World Congress, 2005. - : IFAC. - 008045108X - 9780080451084
  • Konferensbidrag (refereegranskat)abstract
    • Heterogeneous communication networks with their variety of application demands, uncertain time-varying trafc load, and mixture of wired and wireless links pose several challenging problem in modeling and control. In this paper we focus on bandwidth estimation and elucidate why estimates based directly on bandwidth samples are biased. Previously, this phenomenon has been observed but not properly explained, it seems. Standard techniques for bandwidth estimation are based on measurements of inter-arrival times of packets as the bandwidth is proportional to the inverse of the  nterarrival time. Two main classes of bandwidth estimators are analyzed wrt how variations in the inter-arrival times affect the estimates. It is shown that linear time-invariant ltering of instantaneous bandwidth estimates does not change the bias. In contrast to this, smoothing the inter-arrival-time samples does give a bias reduction which depends on the properties of the smoothing lter. Hence, with such approach, noise attenuation can be traded against tracking ability wrt changes in the actual bandwidth.
  •  
10.
  • Li, Kezhi, et al. (författare)
  • Piecewise sparse signal recovery via piecewise orthogonal matching pursuit
  • 2016
  • Ingår i: 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). - : Institute of Electrical and Electronics Engineers (IEEE). - 9781479999880 ; , s. 4608-4612
  • Konferensbidrag (refereegranskat)abstract
    • In this paper, we consider the recovery of piecewise sparse signals from incomplete noisy measurements via a greedy algorithm. Here piecewise sparse means that the signal can be approximated in certain domain with known number of nonzero entries in each piece/segment. This paper makes a two-fold contribution to this problem: 1) formulating a piecewise sparse model in the framework of compressed sensing and providing the theoretical analysis of corresponding sensing matrices; 2) developing a greedy algorithm called piecewise orthogonal matching pursuit (POMP) for the recovery of piecewise sparse signals. Experimental simulations verify the effectiveness of the proposed algorithms.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 13

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