2013 Fifth International Conference on Communication Systems and Networks (COMSNETS) 2013
DOI: 10.1109/comsnets.2013.6465570
|View full text |Cite
|
Sign up to set email alerts
|

IP traceback in star colored networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2014
2014
2018
2018

Publication Types

Select...
2
2
1

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 12 publications
0
5
0
Order By: Relevance
“…where k l is the largest addend Detail proof of this equation is given in Roy et al [8] Case 2: number of available colors c greater than path length l: in practice, we have shown that 11 bits are sufficient to color all routers in the Internet. It means there are 2048 colors available to color the Internet.…”
Section: Path Identifier Collisionsmentioning
confidence: 88%
See 4 more Smart Citations
“…where k l is the largest addend Detail proof of this equation is given in Roy et al [8] Case 2: number of available colors c greater than path length l: in practice, we have shown that 11 bits are sufficient to color all routers in the Internet. It means there are 2048 colors available to color the Internet.…”
Section: Path Identifier Collisionsmentioning
confidence: 88%
“…Our proposed color balanced star coloring approach has two distinct advantages. First, our approach optimizes the bit space required to encode the colors [8], whereas they use a greedy approach. Second, the proposed coloring technique minimizes color collision and thus false positives and false negatives.…”
Section: Packet Marking Schemesmentioning
confidence: 99%
See 3 more Smart Citations