Service discovery in a grid or ubiquitous computing environment

Koushik Sinha

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish
Title of host publicationAdvances 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
Pages263-267
Number of pages5
Volume2
Publication statusPublished - 1 Dec 2007
Externally publishedYes
Event3rd Asian Applied Computing Conference, AACC 2005 - Kathmandu, Nepal
Duration: 10 Dec 200512 Dec 2005

Other

Other3rd Asian Applied Computing Conference, AACC 2005
CountryNepal
CityKathmandu
Period10/12/0512/12/05

Fingerprint

Grid computing
Ubiquitous computing

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Cite this

Sinha, K. (2007). Service discovery in a grid or ubiquitous computing environment. In 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.

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 2007. p. 263-267.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sinha, K 2007, Service discovery in a grid or ubiquitous computing environment. in 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.
Sinha K. Service discovery in a grid or ubiquitous computing environment. In 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. 2007. p. 263-267
Sinha, Koushik. / Service discovery in a grid or ubiquitous computing environment. 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 2007. pp. 263-267
@inproceedings{397f1c7152c84339b47b021d8973fb4d,
title = "Service discovery in a grid or ubiquitous computing environment",
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.",
author = "Koushik Sinha",
year = "2007",
month = "12",
day = "1",
language = "English",
isbn = "1860948278",
volume = "2",
pages = "263--267",
booktitle = "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",

}

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 -