Cross-layer optimization: Difference between revisions

Revision as of 21:02, 15 March 2021

Revision as of 01:09, 3 June 2021

Line 2:

'''Cross-layer optimization''' is an escape from the pure [[waterfall model|waterfall]]-like concept of the [[OSI model|OSI communications model]] with virtually strict boundaries between layers. {{clarify|date=December 2019|text=The cross layer approach transports feedback dynamically via the layer boundaries to enable the compensation for overload, latency or other mismatch of requirements and resources by any control input to another layer, but that layer directly affected by the detected deficiency.<ref>http://www.ece.purdue.edu/~shroff/Shroff/journal/LSS06.pdf{{Dead link |date=November 2017}}</ref><ref>{{cite web |url=http://netlab.caltech.edu/pub/papers/tcpip-ton2004.pdf |title=Archived copy |access-date=2008-06-25 |url-status=dead|archive-url=https://web.archive.org/web/20080704184307/http://netlab.caltech.edu/pub/papers/tcpip-ton2004.pdf |archive-date=2008-07-04 }}</ref>}}

Strict boundaries between layers are enforced in the original OSI networking model, where data is kept strictly within a given layer. Cross‑layer optimization removes such strict boundaries to allow communication between layers by permitting one layer to access the data of another layer to exchange information and enable interaction. {{clarify|date=December 2019|text=For example, having knowledge of the current physical state will help a channel allocation scheme or automatic repeat request (ARQ) strategy at the MAC layer in optimizing tradeoffs and achieving throughput maximization.<ref>[{{Cite web|url=https://archive.today/20130415081707/http://tr.ietejournals.org/downloadpdf.asp?issn=0256-4602;year=2012;volume=29;issue=3;spage=229;epage=247;aulast=Bin-Salem;type=2]|title=IETE Technical Review : Paid Content}}</ref>}}

{{clarify|date=December 2019|text=Especially in information routing with concurrent demand for limited capacity of channels there may be a need for a concept of intervention to balance between e.g. the needs of intelligible speech transmission and of sufficiently dynamic control commands. Any fixed allocation of resources will lead to a mismatch under special conditions of operations.}} Any highly dynamic change of resource allocation might affect the intelligibility of voice or the steadiness of videos. However, as with other optimizing strategies, the algorithm consumes time as well.<ref>{{cite web |url=http://graphics.stanford.edu/projects/lgl/papers/sab-adhocnow-04/sab-adhocnow-04.pdf |title=Archived copy |access-date=2008-06-25 |url-status=dead|archive-url=https://web.archive.org/web/20080516005547/http://graphics.stanford.edu/projects/lgl/papers/sab-adhocnow-04/sab-adhocnow-04.pdf |archive-date=2008-05-16 }}</ref>

Line 21:

* adaptation

* scheduling

* resource allocation<ref>{{Cite journal|last=Karmokar|first=Ashok|date=21 November 2012|title=Energy-Efficient Green Radio Communications for Delay Tolerant Applications|url=https://www.sciencedirect.com/science/article/pii/B9780124158443000073|journal=Handbook of Green Information and Communication Systems|pages=183–208|doi=10.1016/B978-0-12-415844-3.00007-3|isbn=9780124158443}}</ref>

* power control

* congestion control