Asymptotic identity in min-plus algebra: a report on CPNS (Q642426): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 09:35, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Asymptotic identity in min-plus algebra: a report on CPNS |
scientific article |
Statements
Asymptotic identity in min-plus algebra: a report on CPNS (English)
0 references
26 October 2011
0 references
Summary: Network calculus is a theory initiated primarily in computer communication networks, especially with respect to the aspect of real-time communication, where min-plus algebra plays a role. Cyber-physical networking systems (CPNSs) are recently developing fast, and models of data flow as well as systems in CPNSs are, accordingly, greatly desired. Though min-plus algebra may be a promising tool to linearize any node in CPNSs, as can be seen from its applications to Internet computing, there are tough problems remaining unsolved in this regard. The identity in a min-plus algebra is one problem we address. We point out the confusion about the conventional identity in a min-plus algebra and present an analytical expression of the asymptotic identity that may not cause confusion.
0 references
computer communication networks
0 references
min-plus algebra
0 references
cyber-physical networking systems
0 references
real-time communication
0 references