Learn More
Context-aware Web services are currently emerging as an important technology for building innovative context-aware Web applications. Unfortunately, context-aware Web services are still difficult to build. This paper describes Smart Adelaide Guide, a context-aware Web application developed by ContextServ platform, a research project sponsored by Australian(More)
For a given graph G with positive integral cost and delay on edges, distinct vertices s and t, cost bound C ∈ Z + and delay bound D ∈ Z + , the k bi-constraint path (kBCP) problem is to compute k disjoint st-paths subject to C and D. This problem is known NP-hard, even when k = 1 [4]. This paper first gives a simple approximation algorithm with factor-(2,(More)
Let <i>G</i>=(<i>V, E</i>) be a digraph with nonnegative integral <i>cost</i> and <i>delay</i> on each edge, <i>s</i> and <i>t</i> be two vertices, and <i>D</i> &#8712; Z+/o be a delay bound, the <i>k disjoint Restricted Shortest Path</i> (<i>k RSP</i>) problem is to compute <i>k</i> disjoint paths between <i>s</i> and <i>t</i> with the total cost minimized(More)
We initiate the study of the Reliable Resource Allocation (RRA) problem. In this problem, we are given a set of sites equipped with an unbounded number of facilities as resources. Each facility has an opening cost and an estimated reliability. There is also a set of clients to be allocated to facilities with corresponding connection costs. Each client has a(More)
Network applications, such as multimedia streaming and video conferencing, impose growing requirements over Quality of Service (QoS), including bandwidth, delay, jitter, etc. Meanwhile, networks are expected to be load-balanced, energy-efficient, and resilient to some degree of failures. It is observed that the above requirements could be better met with(More)