zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Asymptotic identity in min-plus algebra: a report on CPNS. (English) Zbl 1233.68032
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.
68M10Network design and communication of computer systems
68M11Internet topics