separate bound propagation method from insertion method to allow propagating changes from a given bound queue

(it used to create multiple side effects wrt request pointers and how we access base/sub requests)

TODO: handle diverse fail/unfulfilled cases wrt list size, isEntry etc

(getArrival used to return the last connection)

(note to self : maybe rework this to have an "enhanced graph" wrapper for preprocesses etc ?)

(no account for her on LIMOS' Gitlab, so I can't properly add authorship)