Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

ENTCS
2006

favoriteEmaildiscussreport

121views more ENTCS 2006»

A Logic for Graphs with QoS

13 years 4 months ago

A Logic for Graphs with QoS

Download www.it.uu.se

We introduce a simple graph logic that supports specification of Quality of Service (QoS) properties of applications. The idea is that we are not only interested in representing whether two sites are connected, but we want to express the QoS level of the connection. The evaluation of a formula in the graph logic is a value of a suitable algebraic structure, a c-semiring, representing the QoS level of the formula and not just a boolean value expressing whether or not the formula holds. We present some examples and briefly discuss the expressiveness and complexity of our logic. Key words: Graph Logics, QoS, Semirings, Distributed Systems.

GianLuigi Ferrari, Alberto Lluch-Lafuente

Real-time Traffic

ENTCS 2006 | Graph Logics | QoS Level | Simple Graph Logic |

claim paper

Related Content

» Modelling Multicast QoS Routing by using BestTree Search in Andor Graphs and Soft Constrai...

» Applying CLP to Predict ExtraFunctional Properties of ComponentBased Models

» Fuzzy Logic Control Based QoS Management in Wireless SensorActuator Networks

» A Logic for Application Level QoS

» Unicast and multicast QoS routing with softconstraint logic programming

» Predictive QoS routing to mobile sinks in wireless sensor networks

» QoS Provision Using Dual RF Modules in Wireless LAN

» A New Class of QoS Routing Strategies Based on Network Graph Reduction

» Linear time construction of redundant trees for recovery schemes enhancing QoP and QoS

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2006
Where	ENTCS
Authors	GianLuigi Ferrari, Alberto Lluch-Lafuente

Comments (0)