Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | IEEE Xplore Digital Library |
|---|---|
| Author | Jiali You Pengfei Zheng Jinlin Wang |
| Copyright Year | 2013 |
| Description | Author affiliation: Grad. Univ. of Chinese Acad. of Sci., Beijing, China (Pengfei Zheng) || Nat. Network New Media Eng. Res. Center, Inst. of Acoust., Beijing, China (Jiali You; Jinlin Wang) |
| Abstract | For some media service systems in Internet, providing the service in real time is the key point to obtain the satisfying performance. In order to get good user experience, nodes are often organized as groups and the nodes in a same group can cooperate with each other. Accordingly, how to organize the nodes is an important problem that affects the performance of systems. Usually, enough node capability and the required media content are the two essential elements of nodes to provide the media service. In this paper, the relationship among nodes about these two elements are analogized as the spring tension and gravitation between particles, and a novel potential energy based clustering algorithm is proposed to generate node groups for media services. Moreover, an overlay structure for several media service applications is designed, in which a priority neighbor list is generated for each node by the proposed clustering approach. Based on this structure, nodes in the priority neighbor list may be the potential service helpers in the future. To evaluate our algorithm, a service scenario is simulated and different parameters in the media system are discussed adequately. Compared with some other clustering algorithms, if the potential energy based clustering algorithm is used, there is a chance to improve the service response time obviously and the average execution time of tasks can be reduced. |
| Starting Page | 703 |
| Ending Page | 708 |
| File Size | 972531 |
| Page Count | 6 |
| File Format | |
| ISBN | 9781467331487 |
| ISSN | 17389445 |
| e-ISBN | 9788996865018 |
| Language | English |
| Publisher | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher Date | 2013-01-27 |
| Publisher Place | South Korea |
| Access Restriction | Subscribed |
| Rights Holder | GIRI |
| Subject Keyword | Clustering algorithms Algorithm design and analysis Media Springs Bismuth Protocols Force node group Media service cluster potential energy overlay structure |
| 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...
|