### Abstract

We present two efficient, deterministic, distributed and scalable service discovery algorithms that are suitable for both grid and ubiquitous computing environments. Our first service discovery algorithm assumes the presence of collision detection capabilities at each of the nodes or devices and runs in O{n log n) time in the worst case, n being the number of nodes. The second algorithm does not assume collision detection capabilities of the devices. It has a worst case run time of O(nD) time, D being the diameter of the network.

Original language | English |
---|---|

Title of host publication | Advances in Computer Science and Eng.: Reports and Monographs - Innovative Applications of Information Technology for the Developing World - Proc. of the 3rd Asian Applied Comput. Conf., AACC 2005 |

Pages | 263-267 |

Number of pages | 5 |

Volume | 2 |

Publication status | Published - 1 Dec 2007 |

Externally published | Yes |

Event | 3rd Asian Applied Computing Conference, AACC 2005 - Kathmandu, Nepal Duration: 10 Dec 2005 → 12 Dec 2005 |

### Other

Other | 3rd Asian Applied Computing Conference, AACC 2005 |
---|---|

Country | Nepal |

City | Kathmandu |

Period | 10/12/05 → 12/12/05 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science Applications
- Information Systems

### Cite this

*Advances in Computer Science and Eng.: Reports and Monographs - Innovative Applications of Information Technology for the Developing World - Proc. of the 3rd Asian Applied Comput. Conf., AACC 2005*(Vol. 2, pp. 263-267)

**Service discovery in a grid or ubiquitous computing environment.** / Sinha, Koushik.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Advances in Computer Science and Eng.: Reports and Monographs - Innovative Applications of Information Technology for the Developing World - Proc. of the 3rd Asian Applied Comput. Conf., AACC 2005.*vol. 2, pp. 263-267, 3rd Asian Applied Computing Conference, AACC 2005, Kathmandu, Nepal, 10/12/05.

}

TY - GEN

T1 - Service discovery in a grid or ubiquitous computing environment

AU - Sinha, Koushik

PY - 2007/12/1

Y1 - 2007/12/1

N2 - We present two efficient, deterministic, distributed and scalable service discovery algorithms that are suitable for both grid and ubiquitous computing environments. Our first service discovery algorithm assumes the presence of collision detection capabilities at each of the nodes or devices and runs in O{n log n) time in the worst case, n being the number of nodes. The second algorithm does not assume collision detection capabilities of the devices. It has a worst case run time of O(nD) time, D being the diameter of the network.

AB - We present two efficient, deterministic, distributed and scalable service discovery algorithms that are suitable for both grid and ubiquitous computing environments. Our first service discovery algorithm assumes the presence of collision detection capabilities at each of the nodes or devices and runs in O{n log n) time in the worst case, n being the number of nodes. The second algorithm does not assume collision detection capabilities of the devices. It has a worst case run time of O(nD) time, D being the diameter of the network.

UR - http://www.scopus.com/inward/record.url?scp=84894458614&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84894458614&partnerID=8YFLogxK

M3 - Conference contribution

SN - 1860948278

SN - 9781860948275

VL - 2

SP - 263

EP - 267

BT - Advances in Computer Science and Eng.: Reports and Monographs - Innovative Applications of Information Technology for the Developing World - Proc. of the 3rd Asian Applied Comput. Conf., AACC 2005

ER -