SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Zou Zhenhua) srt2:(2010)"

Sökning: WFRF:(Zou Zhenhua) > (2010)

  • Resultat 1-2 av 2
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Soldati, Pablo, et al. (författare)
  • Optimal Routing and Scheduling of Deadline-Constrained Traffic Over Lossy Networks
  • 2010
  • Ingår i: 2010 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE GLOBECOM 2010. - 9781424456383
  • Konferensbidrag (refereegranskat)abstract
    • The traditionally wired automation infrastructure is quickly migrating to more flexible and scalable wireless solutions. To cope with the stringent requirements of process automation in terms of latency and reliability, the network resources must be optimized to ensure timely and reliable communication. This paper considers the joint routing and transmission scheduling problem for reliable real-time communication over lossy networks. Specifically, we impose a strict latency bound for packet delivery from source to destination, and devise optimal transmission scheduling policies that maximize the success probability of delivering the packet within the specified deadline. A solution to this problem allows to characterize the set of achievable latencies and packet reliability for a given network. We offer a complete understanding of the problem when erasure events on links are independent and follow a Bernoulli process. We consider both static and dynamic resource allocation policies, and compare them in numerical examples.
  •  
2.
  • Zou, Zhenhua, et al. (författare)
  • Delay-constrained maximum reliability routing over lossy links
  • 2010
  • Ingår i: Proceedings of the IEEE Conference on Decision and Control. - : IEEE. - 9781424477456 ; , s. 973-978
  • Konferensbidrag (refereegranskat)abstract
    • This paper studies the problem of joint routing and transmission scheduling for reliable real-time communication over lossy networks. We impose a strict latency bound on the packet delivery from source to destination and develop transmission scheduling policies that maximize the probability that the packet is delivered within the specified deadline. A solution to this problem allows to characterize the set of achievable latencies and packet loss probabilities for a given network. We develop dynamic programming-based solutions for deadline-constrained maximum reliability routing under Bernoulli and Gilbert-Elliot packet loss models. Particular instances of the problem that admit numerically efficient solutions are discussed and our results are demonstrated on several examples.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-2 av 2
Typ av publikation
konferensbidrag (2)
Typ av innehåll
refereegranskat (2)
Författare/redaktör
Johansson, Mikael (2)
Zhang, Haibo (2)
Soldati, Pablo (2)
Zou, Zhenhua (2)
Lärosäte
Kungliga Tekniska Högskolan (2)
Språk
Engelska (2)
Forskningsämne (UKÄ/SCB)
Teknik (2)
År
2010 (2)Ta bort avgränsningen

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