2016
DOI: 10.11591/ijece.v6i1.pp421-430
|View full text |Cite
|
Sign up to set email alerts
|

Issues in Routing Mechanism for Packets Forwarding: A Survey

Abstract: Nowadays internet has become more popular to each and every one. It is very sensitive to nodes or links failure due to many known or unknown issues in the network connectivity. Routing is the important concept in wired and wireless network for packet transmission. During the packet transmission many times some of the problems occur, due to this packets are being lost or nodes not able to transmit the packets to the specific destination. This paper discusses various issues and approaches related to the routing … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 30 publications
(55 reference statements)
0
4
0
Order By: Relevance
“…Routing is the important concept in wired and wireless network for packet transmission [11] and to maximize the packet successfully passed to the destination node [12]. A routing protocol in a mobile ad hoc network has an important role in finding the data transmission path.…”
Section: Routing Protocol and Congestion Control In Tcp 21 Routing mentioning
confidence: 99%
“…Routing is the important concept in wired and wireless network for packet transmission [11] and to maximize the packet successfully passed to the destination node [12]. A routing protocol in a mobile ad hoc network has an important role in finding the data transmission path.…”
Section: Routing Protocol and Congestion Control In Tcp 21 Routing mentioning
confidence: 99%
“…(1) Q Threshold = Q max =0.75× Buffer queue-size = 3× Q min (2) Where Q min denotes to the quarter of actual queue size of node which represents the minimum threshold of the actual queue size. And the Q Threshold denotes to the three quarters of actual queue size that represents the maximum threshold of the actual queue size.…”
Section: Q Min = 025× Buffer Queue-sizementioning
confidence: 99%
“…Therefore, Nodes (2, 3, 5) must check it, if anyone has new link with others. First save (2,3,5) in the vector queue. Moreover, the unique function avoids the insertion of any double node number inside the vector queue.…”
Section: Alternative Route Determinationmentioning
confidence: 99%
See 1 more Smart Citation