Name
Abstract | ||
|---|---|---|
Quality of service requirements and the increasing amount of data transmission demand for efficient protection mechanisms. Existing mechanisms like 1+1 and 1+N path protection offer instantaneous recovery but they suffer from high capacity needs and nodal degree requirements, respectively. The high nodal degree requirement makes an implementation of the 1+N mechanism in transport networks difficult. In this paper, we develop two new mechanisms by applying network coding on a virtualized protection scheme. These mechanisms are more resource-efficient compared to 1+1, and are implementable in transport networks even under stringent nodal degree constraints. The difference between the two mechanisms lies in complexity and performance. Therefore, either of them can be preferred as a good compromise between 1+1 and 1+N in different scenarios according to the needs and available resources. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/GLOCOM.2010.5683258 | Global Telecommunications Conference |
Keywords | Field | DocType |
data communication,network coding,quality of service,data transmission,network coding,path protection,quality of service,single domain network protection,stringent nodal degree constraints,transport networks,virtualized protection scheme | Linear network coding,Single domain,Data transmission,Computer science,Computer network,Peer to peer computing,Quality of service,Path protection,Distributed computing | Conference |
ISSN | ISBN | Citations |
1930-529X E-ISBN : 978-1-4244-5637-6 | 978-1-4244-5637-6 | 10 |
PageRank | References | Authors |
0.59 | 4 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| isil burcu barla | 1 | 27 | 2.23 |
| Franz Rambach | 2 | 22 | 1.80 |
| Dominic A. Schupke | 3 | 234 | 29.58 |
| Georg Carle | 4 | 951 | 133.84 |