Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | IEEE Xplore Digital Library |
|---|---|
| Author | Haibo Su Wentao Chen Shijun Lin Depeng Jin Lieguang Zeng |
| Copyright Year | 2008 |
| Description | Author affiliation: State Key Lab. on Microwave & Digital Commun., Tsinghua Univ., Beijing (Haibo Su; Wentao Chen; Shijun Lin; Depeng Jin; Lieguang Zeng) |
| Abstract | Network tomography has been widely used recently as an method to infer the network internal link-level characteristics by end-to-end measurement. In this paper, we consider the problem of estimating link loss rates using network tomography. The existing methods make the inference based on the whole tree of network, which is very complex for large scale network. To overcome this limitation, we propose a low complexity inference approach named LCIA. In the LCIA, we deploy monitors at internal nodes to reduce the complexity of inferring the link loss rates. It mainly consists of two steps. The first step is to deploy monitors at specific internal nodes to divide the original tree into several sub-trees with minimum depth. The second step is to infer the link loss rates of sub-trees by a new estimator which is an explicit function of loss measurements. The LCIA has the following features. First, it greatly reduces the inference complexity as the inference on the sub-trees is much simpler. Second, it improves the accuracy of the estimated results since the variance of loss estimator on sub-trees with lower depth is smaller than that on the original tree. The analytical and simulation results demonstrate that the LCIA outperforms the existing methods both on computation complexity and inference accuracy. |
| Starting Page | 1 |
| Ending Page | 6 |
| File Size | 241390 |
| Page Count | 6 |
| File Format | |
| ISBN | 9781424423248 |
| ISSN | 1930529X |
| DOI | 10.1109/GLOCOM.2008.ECP.293 |
| Language | English |
| Publisher | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher Date | 2008-11-30 |
| Publisher Place | USA |
| Access Restriction | Subscribed |
| Rights Holder | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subject Keyword | Maximum likelihood estimation Laboratories Loss measurement Network topology Computed tomography Unicast Multicast algorithms Inference algorithms Microwave theory and techniques Digital communication |
| Content Type | Text |
| Resource Type | Article |
National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.
Learn more about this project from here.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
| Sl. | Authority | Responsibilities | Communication Details |
|---|---|---|---|
| 1 | Ministry of Education (GoI), Department of Higher Education |
Sanctioning Authority | https://www.education.gov.in/ict-initiatives |
| 2 | Indian Institute of Technology Kharagpur | Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project | https://www.iitkgp.ac.in |
| 3 | National Digital Library of India Office, Indian Institute of Technology Kharagpur | The administrative and infrastructural headquarters of the project | Dr. B. Sutradhar bsutra@ndl.gov.in |
| 4 | Project PI / Joint PI | Principal Investigator and Joint Principal Investigators of the project |
Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon |
| 5 | Website/Portal (Helpdesk) | Queries regarding NDLI and its services | support@ndl.gov.in |
| 6 | Contents and Copyright Issues | Queries related to content curation and copyright issues | content@ndl.gov.in |
| 7 | National Digital Library of India Club (NDLI Club) | Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach | clubsupport@ndl.gov.in |
| 8 | Digital Preservation Centre (DPC) | Assistance with digitizing and archiving copyright-free printed books | dpc@ndl.gov.in |
| 9 | IDR Setup or Support | Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops | idr@ndl.gov.in |
|
Loading...
|