Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | Springer Nature Link |
|---|---|
| Author | Huang, Sheng Zhang, YunShui Sun, LiQin Yang, XiaoLong Long, KePing |
| Copyright Year | 2014 |
| Abstract | Multi-path routing in the optical burst switching (OBS) networks can reduce the burst loss probability (BLP) by distributing the data burst traffic to multiple paths, compared with single path routing. Unlike the other multi-path routing schemes without considering the carrying capability of the routes, a new multi-path routing scheme based on effective voids (MPEV) is proposed to balance the load of multi-path and reduce the BLP in the paper. MPEV scheme first obtains the information on effective voids of the bottleneck link of multipath by sending a probe packet periodically. The effective voids can accommodate data bursts and accurately represent the available channel resource that is the main determinant of the BLP for OBS networks without optical random access memory. Then MPEV scheme distributes the burst traffic between an ingress node and an egress node to multiple link-disjoint paths by the ratio of the effective voids. More traffic is distributed to the path that has more effective voids, and vice versa. And the distributed amount is proportional to the effective voids of the bottleneck link. So MPEV scheme can balance the load of multi-path routes and can effectively reduce the BLP by avoiding the high load of a single path. And it is easy to implement and agilely adapt to dynamic network traffic. The performance of MPEV scheme is analyzed by queuing theory and is evaluated by simulation. The numerical results show that the proposed scheme can effectively reduce the BLP and balance the traffic load over multiple paths at the same time. |
| Starting Page | 1 |
| Ending Page | 9 |
| Page Count | 9 |
| File Format | |
| ISSN | 1674733X |
| Journal | Science in China Series : Information Sciences |
| Volume Number | 58 |
| Issue Number | 2 |
| e-ISSN | 18691919 |
| Language | English |
| Publisher | Science China Press |
| Publisher Date | 2014-07-31 |
| Publisher Place | Heidelberg |
| Access Restriction | One Nation One Subscription (ONOS) |
| Subject Keyword | optical burst switching multi-path routing effective voids bottleneck link balance traffic load Information Systems and Communication Service |
| Content Type | Text |
| Resource Type | Article |
| Subject | Computer Science |
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...
|