text:
|Publication number
|Publication type
|Application number
|Publication date
|Jun 28, 2011
|Filing date
|Nov 3, 2006
|Priority date
|Nov 4, 2005
|Fee status
|Publication number
|Jeonghun Noh, Eric E. Setton, Bernd Girod
|Original Assignee
|The Board Of Trustees Of The Leland Stanford Junior University
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (18), Referenced by (22), Classifications (24), Legal Events (1)
|External Links: USPTO, USPTO Assignment, Espacenet
This patent document claims the benefit, under 35 U.S.C. �119(e), of U.S. Provisional Patent Application No. 60/733,561 filed on Nov. 4, 2005 and entitled "Rate-distortion optimized video peer-to-peer multicast streaming."
The present invention relates generally to communications, and more particularly to packet-based video communications in a peer-to-peer network.
Packet-based video streaming has been used in a variety of broadcast and on-demand video applications for a variety of types of video such as sporting events, television, concerts and movies. With these approaches, video data is packetized in accordance with a communications protocol for a particular network over which the video is to be delivered. The packetized video data is delivered to recipients in one or more of a variety of manners, using a host or source to provide the video data. In some applications, network nodes (e.g., servers or peers) both receive video data and provide the received video data to recipients.
One approach to packet-based video transfer involves a peer-to-peer (P2P) transfer approach, where viewers contribute their resources to the network to act as relays for the media streams. Such peer-to-peer transfer has grown tremendously in recent years. In 2003, peer-to-peer became the most popular Web application, and, at the end of 2004, peer-to-peer protocols represented over 60% of the total Internet traffic, dwarfing web browsing, which is the second most popular application. This rapid success is fueled by file transfer networks that allow users to swap media files, despite the large latency often necessary to complete a download. Growth in peer-to-peer approaches is expected to continue at a fast pace, as new compelling peer-to-peer applications are developed.
One approach to peer-to-peer video transfer is peer-to-peer multicast, where a media stream is sent to a large audience using the uplink of viewers in the audience to forward the media stream. Similar to file transfer networks, data propagation is accomplished, via a distributed protocol, which lets peers self-organize into distribution trees or meshes. Different transmission trees are established, which connect the different peers interested in receiving the media stream. These trees are rooted at the source and the branches of each tree link a peer to its descendants. Complementary portions of the video stream are distributed over the different trees, and peers join each of the multiple trees to decode and playout the video successfully. As video traffic is relayed by the peers along the different branches of the multicast trees, the video source need only serve a small subset of peers.
While useful and growing in popularity, peer-to-peer approaches such as those involving multicast have been limited in their ability to provide quality video, particularly on a real-time basis, as is desirable to achieve a TV-like viewing experience. For example, the access bandwidth of peers is often insufficient to support high quality video, peers may choose to disconnect at any time (making for an unreliable and dynamic network fabric), and each relay point or "hop" in a peer-to-peer network (e.g., a peer's PC that relays data) introduces additional delay. When links are congested, these challenges become exacerbated, particularly for low-latency applications such as interactive video streaming.
These and other characteristics have been challenging to the implementation of video in packet-based network environments.
The present invention is directed to overcoming the above-mentioned challenges and others related to the types of applications discussed above and in other applications. These and other aspects of the present invention are exemplified in a number of illustrated implementations and applications, some of which are shown in the figures and characterized in the claims section that follows.
According to an example embodiment of the present invention, peer-to-peer packet-based video streaming is facilitated using an approach to the prioritization of packets for delivery from one peer to another. For packets in a queue for delivery to one or more peers, the packets are delivered in accordance with a priority associated with each packet that is related to the quality of video to be presented at the peers.
According to another example embodiment of the present invention, and as may be implemented in connection with the above prioritization approach, packets are temporally spaced to mitigate congestion in the delivery of the packets to a peer.
In connection with another example embodiment of the present invention, an efficient encoding rate is determined for a low-latency streaming architecture that facilitates a tradeoff between video quality and self-inflicted congestion. For instance, in some applications, such an approach involves making a determination of an amount of over-provisioning for links supporting a delay-constrained video stream.
According to another example embodiment of the present invention, pre-encoded streams are passed over a peer-to-peer packet-based network in a manner that mitigates distortion of video presented at the peers. Packets of the pre-encoded streams are scheduled for delivery (and subsequently delivered) using estimated congestion-distortion characteristics of the video. With this approach, a determination is made as to which packets should be sent, and at which time, to facilitate a desirable decoded video quality while mitigating or avoiding the creation of unnecessary queuing delay over links in the network.
According to another example embodiment of the present invention, a system communicates packetized video over a peer-to-peer packet-based network using packet-by-packet video transmission scheduling. A video source provides a packet-based video stream to the packet-based network. A plurality of peer packet-based devices are coupled to the packet-based network to receive video packets and send video packets to other peers in the network. The video source and the peer devices facilitate video communications for passing video data from the video source to the plurality of peer devices by processing selected packets in the video stream at a higher priority than other packets and by temporally spacing the packets in the packet stream to mitigate congestion on the peer-to-peer packet-based network. The prioritization is effected, for example, based upon the effect of the packets upon the quality of video at the peer devices, as estimated or otherwise determined.
According to another example embodiment of the present invention, a packet-based peer device relays packetized video over a peer-to-peer packet-based network using packet-by-packet video transmission scheduling. The packet-based network has an ancestral tree structure including at least two peers to which the peer device streams the packetized video, and at least one source from which the peer device receives packetized video. The peer device includes a prioritization engine that prioritizes packets in a queue as a function of the effect of the packet upon a video frame and characteristics of the ancestral tree structure. The peer device also includes a packet processing engine that delivers a packetized stream of video to other peers in response to the prioritization of the packets. In some applications, the peer device is a personal computer (PC) or other packet-communicating device programmed with functionality for the prioritization engine and the packet processing engine.
The above summary is not intended to describe each illustrated embodiment or every implementation of the present invention. The figures and detailed description that follow more particularly exemplify these embodiments
The invention may be more completely understood in consideration of the detailed description of various embodiments of the invention that follows in connection with the accompanying drawings in which:
While the invention is amenable to various modifications and alternative forms, specifics thereof have been shown by way of example in the drawings and will be described in detail. It should be understood, however, that the intention is not to limit the invention to the particular embodiments described. On the contrary, the intention is to cover all modifications, equivalents, and alternatives falling within the spirit and scope of the invention.
The present invention is believed to be applicable to a variety of different video applications, devices and networks, and the invention has been found to be particularly suited for the delivery of packet-based video in a peer-to-peer network. While the present invention is not necessarily limited to such applications, various aspects of the invention may be appreciated through a discussion of examples using this context.
According to an example embodiment of the present invention, a peer-to-peer packet-based video streaming system includes peers implementing video delivery approaches that involve selectively-weighted video packet delivery priorities. The network is established among peers, with each peer receiving a video stream from at least one source, such as a primary source with a secondary source identified as a backup. Each peer is also adapted for scheduling and passing received streamed video packets to one or more other peers in the network, using the aforesaid video delivery approaches. A control protocol implemented at the peers facilitates the establishment of a peer tree for each peer, the prioritization of video packets streamed to other peers, as well as requests for video packets.
Video packets are prioritized at the peers for delivery in one or more of a variety of manners. In one embodiment, each packet in a delivery queue is associated with a particular video frame or a portion of a particular video frame, and an importance of that video frame (or portion) is determined, relative to other video frames to which other packets in the delivery queue apply, as corresponding to an image quality of the video. The packet or packets in the queue bearing higher relative importance are communicated before packets with lower relative importance.
In some applications, the peer-to-peer network is established as a series of trees, in which the peers are connected to one another such that a parent peer is a peer that delivers video packets to child peers that receive the video packets. Each peer is an interior node or a leaf (i.e., an end node with no child peers to which video is distributed) in all of the different trees in the peer-to-peer network, unless the node has been disconnected and is trying to reestablish a connection. Peers receive video traffic from one or more of their different parents in each of the trees. When one of their parents leaves the session, peers issue retransmission requests to the parents they are still connected to, in order to mitigate losses, while the control protocol seeks a suitable parent to reconnect to.
In connection with the above examples, for some embodiments, requests for missing packets are prioritized at a requesting peer (e.g., a child peer), and in other applications, are prioritized at a peer serving the request (e.g., a parent peer), in a manner similar to the prioritization of video packets in a queue for delivery. For instance, where a series of packets is requested for re-transmission to a particular peer, or for another peer to which the particular peer is to deliver the series of packets, packets in the series are prioritized for delivery to the requesting peer as described above. Where prioritization is implemented at a requesting peer, the packets are requested according to the prioritization, with the request being served accordingly. Where prioritization is implemented at a serving peer (or other video source), the re-transmission request is sent to the serving peer, which prioritizes packets in the re-transmission request.
According to another example embodiment of the present invention, a packet-based video scheduling approach for peer-to-peer networks involves the use of congestion-distortion scheduling in presenting video packets from a peer to other peers. A prioritization scheme is used to schedule the transmission of video packets destined to multiple peers, with the prioritization based upon the unequal contribution of different packets to overall video distortion, and information about the structure of the peer-to-peer network to favor peers with a large set of descendants. Packet transmissions from each peer are spaced to mitigate and/or avoid creating congestion on an uplink from which the peer receives video packets. Peers receiving the video packets scheduled with the congestion-distortion scheduling implement a distortion-based scheduling approach to recover missing video packets when the peer is disconnected from one (or several) peer-to-peer tree(s) or otherwise benefits from a re-transmission of packets (e.g., for lost or damaged packets).
In another example embodiment of the present invention, a distortion-based scheduling approach, such as those described, above, is implemented in connection with an adaptive scheduling approach involving the selective use of switching slices. For instance, one such application involves adaptive scheduling of video packets using switching intra (SI) slices and switching predicted (SP) slices. An SI slice facilitates complete decoding of an image without knowledge of other slices, and the SP slice is encoded and decoded using data from other slices. Generally, an SP slice approach is used to transmit the same image as an SI slice while using less bandwidth, but can lead to error propagation associated with reliance upon data from other slices. In this regard, SI frames are selectively inserted into a video stream to facilitate performance of the video stream, at a video source as well as at peers redistributing the video, as appropriate. An SI frame is regenerated at a peer to create an SI picture during the decoding process of an SP frame. Such an SI picture may be implemented, for example, to stop decoding errors. For general information regarding SI and SP slices, and for specific information regarding such approaches as may be implemented in connection with one or more example embodiments herein, reference may be made to ITU-T and ISO/IEC JTC1, Advanced Coding for Generic Audiovisual Services, ITU-T Recommendation H.264—ISO/IEC 14496-10(AVC), 2003, which is fully incorporated herein by reference.
Turning now to the figures,
Generally, parent sources 120-N provide video packets to the peer 110, which provides the received packet-based video to peers 130-136. In this context, the peer 110 acts as a peer descendent, relative to parent sources 120-N, and as a parent source peer, relative to peer descendents 130-136. Moreover, each of peer descendents 130-136 may correspondingly act as a peer parent source to additional peer descendents. In addition, for certain applications, one or more of the parent sources 120-N are video sources such as broadcast or video distribution sources, that do not playback video in the context of the peers. For instance, referring to
The peer 110 includes a packet processing engine 150 that processes incoming packets and facilitates the delivery of outgoing packets for video streams. The packet processing engine 150 further facilitates the request of missing packets, or of a stream of packets as appropriate (e.g., when a parent source is disconnected from the network), and serves requests for missing packets as received from peer descendents. The peer 110 also includes a prioritization engine 140 that facilitates the prioritization of packet delivery to peer descendents, as well as the prioritization of packet requests sent to one or more parent sources. In certain embodiments, the peer 110 includes a packet storage arrangement 160 that stores video packets (e.g., a queue of packets to be sent to other descendents or played back at the peer), or an entire set of video data.
For illustration, the following description involves the delivery of a packet-based video stream, represented by incoming packets 151, 153 and 155, from parent source 120 to the peer 110, and the corresponding distribution of a packet stream, represented by outgoing packets 152 and 154, corresponding to the same video stream to peer descendent 136. However, the approaches described are applicable to implementation with each of the parent sources 120-N and peer descendents 130-136. In addition, for many applications, the peer 110 receives several groups, or streams, of packets from different sources for a particular video stream, and combines the packets for playback and/or distribution to other descendents.
Peers in the network, such as that shown in
In some embodiments, the peer 110 monitors links to parent sources 120-N to identify any links that become unstable or that terminate due to disconnection of a parent source or other condition. When a parent link becomes unstable or terminates, a tree structure is re-established using one or more different parents, using an approach to the above-discussed establishment of a tree structure for the peer 110. In this regard, the peer 110 insulates itself against unexpected changes in the tree and facilitates rapid recovery from conditions such as those relating to the termination of a video stream.
For delivery of the video stream represented by incoming packets 151-155, the prioritization engine 140 uses image data 142 to prioritize packets in accordance with the effect that the packets have on the quality of the video using, for example, the approaches described above for basing priority upon video frame quality. In some instances, ancestral tree data 144 is also used in the prioritization of video data, such as by assigning higher priority to peer descendents that serve more sub-descendants than other peer descendents, thus affecting the quality of more video in the tree.
The image data 142 includes a variety of information that is used by the prioritization engine 140 in different manners, depending upon the application. For example, in some applications, the image data 142 includes information characterizing video frames for previously-received streaming video received at the peer 110, or for estimated characteristics of video to be received at the peer 110.
The packet processing engine 150 uses the packet priority data 146 in scheduling the delivery of the outgoing packet stream represented by packets 152-154. For instance, where incoming packets are stored in a queue in the packet storage 160, a packet or set of packets corresponding to a highest relative priority at a given instance or frame of time is sent to peer descendents before other packets in the queue at that time.
In some embodiments, the packet processing engine 150 uses characteristics of an uplink to one or more parent sources 120-N in scheduling the delivery of the outgoing packets. In one example, the packet processing engine 150 uses the spacing of incoming packets (e.g., 151-155) to correspondingly set the spacing of outgoing packets (e.g., 152 and 154) to mitigate and/or prevent congestion in communicating an outgoing video stream to the peer descendents.
Relative to requests made by peer descendents to the peer 110 for the delivery and/or re-delivery of video packets, for some embodiments, the prioritization engine 140 prioritizes the delivery of requested packets in a manner similar to that described above with the delivery of an outgoing packet stream. For illustration, peer descendent 134 is shown providing a packet request to the peer 110, which in turn delivers a requested packet 156 (or a stream of such packets, as appropriate). In some applications, requested packets are delivered in accordance with one or more of a determined importance of the packets using image data 142, relative to other packets to be delivered to the requesting descendent, and the importance of the descendent relative to other descendants from an ancestral tree perspective, using ancestral tree data 144.
In other embodiments, the peer descendent making the request assigns a priority to the requested packets (e.g., as described below), and the packet processing engine 150 serves the requests in accordance with the assigned priority and, in some applications, in accordance with a priority associated with ancestral tree data 144 as determined by the prioritization engine 140. For the latter approach and in some applications, the prioritization engine 140 uses packet request data received from a peer descendent, together with ancestral tree data 144, to generate packet priority data 146 corresponding to the packet request and appropriately serve outgoing packets to the peer descendents 130-136.
When packets are missing, damaged or needed for other reasons, the packet processing engine 150 requests packets from one or more of the parent sources 120-N, with a request shown to parent source N, with corresponding delivery of a requested packet 157, for illustration. Consistent with the above discussion made in connection with descendent requests served by the peer 110, the packet request is made using one or more approaches. In some applications, the peer 110 makes a request for a packet or packets from the parent source N, and the parent source N prioritizes the delivery of requested packets to the peer 110, either separately and/or using priority information provided via the peer request. In other applications, the prioritization engine 140 assigns packet priority data 146 to packets to be requested, and the packet processing engine makes the packet request in accordance with the priority data.
In accordance with the above and other description herein, the peer 110 and corresponding packet processing engine 150 and prioritization engine 140 are implemented in one or more of a variety of manners. For instance, the peer 110 may be a personal computer, with hardware and/or software implemented to effect the functions described with one or both of the packet processing engine 150 and the prioritization engine 140. Similarly, the packet storage 160 is implemented with such a personal computer, or with another storage approach such as storage at a network location and/or at an external device, local to the peer 110.
The following embodiments and related discussion involve aspects of the invention that may, for example, be implemented in connection with the arrangement and approach 100 shown in
In one embodiment, a multicast source is responsible for sending a media stream over different transmission trees as may be implemented, for example, with one of the parent sources 120-N in
The multicast source is also responsible for packetizing the media stream, prior to transmission. As video is transmitted to the different peers over multiple paths, out-of-order arrivals are expected. Packet headers are therefore used to provide enough information to reconstitute the media stream before decoding. Video packet headers are created by the source; they contain the packet number, the video frame number, the total number of packets in the frame, the place of the particular packet among them and the playout deadline of the packet. Before transmitting a packet on one of the trees, the source will also indicate in its header the sequence number of the previous packet it transmitted over this tree.
When a peer receives a video packet on one of the multicast trees, it immediately forwards it to its descendants on the same tree, as long as it is not past its playout deadline. For example, relative to
Retransmission-of packets is effected-in a variety of manners. In some applications, retransmission is effected when a control protocol detects a parent disconnection, and the peer creates a list of missing packets. This list contains the sequence number of all the packets which should have been received over the tree that the peer is disconnected from. The range considered extends from the next packet to be decoded, to the highest packet number received on the other multicast trees. To ensure that all of the missing packets are identified, the list of missing packets is refreshed (e.g., every 100 ms) until the peer has re-established a connection to the missing tree (or to another tree) and has received several video packets.
In some applications, when packets are dropped, out of order arrivals are detected using information contained in the video header, which includes the sequence number of the packet previously sent along the same multicast tree. A peer requests missing packets that are not past due from its different parents, following the sequence number of the packets, with lower sequence numbers requested first. In various applications, peers requesting retransmissions do so over one or more alternate paths.
In other embodiment, a retransmission scheduler (e.g., implemented with the packet processing engine 150) limits the congestion created by retransmissions by bounding the number of unacknowledged retransmission requests from a peer to each of its parents. In some applications, when two or more parents are available to serve a retransmission request, the peer chooses one of them at random, or chooses one of them based upon characteristics of each parent, such as the ability of the parent to take on more video data traffic and/or the number of descendents that the parent is serving.
Parent sources respond to retransmission requests in a variety of manners. In some applications, when a parent receives a retransmission request for a packet it has not received, the parent informs the requesting peer by sending a negative acknowledgment (NACK) back; if the parent has received the requested packet, it is retransmitted accordingly. The time at which a retransmission reply will be received by the peer depends on the state of the bottleneck queue of its parent, on its uplink throughput and on future packet arrivals. Peers are programmed to characterize a retransmission request as lost if it has not been acknowledged or if no reply has been received in some specified time, and accordingly resubmits a retransmission request, to the same or a different parent.
In another example embodiment, a congestion-distortion optimized (CoDiO) approach is implemented for scheduling the transmission (or retransmission) of video packets from peer-to-peer. Video is scheduled in a server-client scenario using CoDiO or CoDiO light approaches using a video streaming protocol without acknowledgments (ACKs), thereby mitigating any reduction in uplink throughput of clients in peer-to-peer streaming as would be associated with ACKs. Generally, CoDiO approaches have implemented ACKs; with this embodiment, a CoDiO approach is implemented without ACKs, using a sender-driven prioritization scheme together with knowledge of the peer-to-peer tree structure over which the video is distributed. The transmission of video packets destined to multiple peers is scheduled, based upon the unequal contribution of different packets to overall video distortion, and information collected about the structure of the tree or trees to favor peers with a large set of descendants. In addition, the transmissions are spaced to mitigate or avoid the creation of congestion on an uplink to the transmitting peer. At the receiver peer, a distortion-based algorithm is implemented to recover missing video packets when the receiver peer is disconnected from one (or several) multicast tree(s).
In connection with other example embodiments of the present invention, a video packet sender-driven prioritization approach is implemented as follows to mitigate congestion on multi-hop paths separating the sender from any particular recipient peer. For example, where the rate of a video stream varies or where unexpected retransmission requests are made, a peer may sometimes lack the resources to forward all the data expected by its descendants. In such instances, the peer implements a scheduling approach to maintain video quality; for certain applications, the peer delays or drops some packets to ensure timely delivery of a more significant portion of the video. A prioritization approach (e.g., an algorithm implemented with the prioritization engine 140) iteratively determines the next most important packet by comparing the importance of each queued packet. As packets in the queue change (are sent, dropped or added to the queue), these changes are used in prioritizing packets in the queue.
For Packet n the importance, denoted by the quantity {tilde over (D)}(n), is computed at a peer (or video source) as a function of the video frame type and of the order in the GOP (group of packets). This quantity reflects the sensitivity of the video quality to the reception of the packet. In some applications, this sensitivity is estimated such as when peers do not collect detailed rate-distortion information about the stream they are transmitting and when the state of the reception buffer of their descendants is not known, this sensitivity needs to be approximated. For certain applications, the quantity {tilde over (D)}(n) is set as the number of frames that will be affected if the frame Packet n belongs to is not decoded correctly.
One example encoding structure showing an importance {tilde over (D)}(n) of different frames for an open encoding structure with periodic I frames (intraframes) is as follows:
With the importance of an I frame at 19, its loss affects the 16-frame GOP as well as the 3 preceding B frames (a bi-directional or bi-directional predictive frame for MPEG). The importance of the different P frames (predictive, or predicted frame for MPEG) is 15, 11 and 7, depending on their place in the GOP, and the importance of each B frame is 1. In a peer-to-peer multicast scenario using CoDiO P2P (peer-to-peer), a peer schedules video streams packet by packet, rather than frame by frame; in this case, the importance of a packet corresponds to the importance of the frame it belongs to. In this regard, the aforesaid determination of frame importance is applied to packets belonging to that frame in prioritizing the packets, relative to packets that belong to other frames. The peer scheduling packets considers packets or frames as long as they are not past their playout deadline, and further adjusts the priority of packets to the number of descendants in the multicast tree that would be affected by the loss or late arrival of this packet.
In some applications, each next most important packet in a particular queue is determined by comparing the impact of each queued packet. For a Packet n, addressed to Peer m, the impact is expressed in Equation 5.1, which is applicable to the transmission and retransmission of packets:
I(n,m)={tilde over (D)}(n)*(NumDescendants(m)+1) (5.1)
In Equation 5.1, NumDescendants(m) represents the number of peers to which Packet n will be forwarded after reaching Peer m, this information is collected by the control protocol when "hello" packets are exchanged between neighboring peers to maintain the multicast trees. The quantity {tilde over (D)}(n) is the importance described above.
Successive transmissions are spaced to ensure congestion is not created on the bottleneck link of the network path (i.e., the uplink of the forwarding peer), which is assumed as not shared with other applications. In this regard, transmissions are spaced based on the time needed for the previous video packet to traverse the uplink. In some applications, a small portion of the link is reserved to account for control traffic to limit the delay of control packets. In some implementations, 20 kb/s of throughput is set aside for this purpose, regardless of the uplink bandwidth for the peer.
In connection with various embodiments, a distortion-optimized approach is implemented, with optimization in this context relating to one or more degrees of mitigation of distortion, as follows. A list of missing frames is first determined by forming an estimated mapping between missing packets and their corresponding frame using the information contained in the header of the received video packets, such as information corresponding to one or more of packet number, frame number and number of packets in the frame. In some applications, the following algorithm A is used to estimate the frame number of a missing packet, n. The value initialized, associated with a frame, indicates whether a packet for this frame has been received. If the packet has been received, then the sequence number of the packets composing the frame is known, and in particular, the first_packet and the last_packet of the frame. The current_frame is the frame displayed by the peer. In some applications, history_window is set equal to 64. Upper and lower bounds for the frame number corresponding to Packet n are set; if during the process the frame number is not determined, the average between the upper and lower bound is returned.
Algorithm A: MapPacketToFrame(n)
comment: First, find an upper bound for the frame number.
upper_bound ← current_frame while (upper_bound ≦ current_frame + history_window) if (upper_bound.initi alized) if (upper_bound. first_packet > n) then then break do {open oversize brace} {open oversize brace} else if (upper_bound. f irst_packet ≦ n ≦ upper _bound.taat_packet) then return (upper_bound) upper_bound ← upper_bound + 1
comment: Then, find a lower bound for the frame number.
lower_bound ← upper_bound
while lower_bound > current_frame
if (lower_bound.initialized)
if (lower_bound.last_packet < n)
{open oversize brace}
{open oversize brace}
then break
lower_bound ← lower_bound − 1
if (upper_bound.initialized and upper_bound.first_packet − 1 = = n)
then return (upper_bound − 1)
else if (lower_bound.initialized and
lower_bound.last_packet + 1 = = n)
then return (lower_bound + 1)
Distortion is estimated using one or more of a variety of characteristics and approaches. In one embodiment, a peer-based packet scheduler uses characteristics of the GOP structure to determine which missing frame has the highest contribution to the total expected distortion. The importance of missing frames is compared by computing the expected video quality associated with the receipt of each of the missing frames. That is, where a particular frame has a higher expected effect on video quality than other frames, for packets in a particular queue, those packets associated with the higher effect on quality are scheduled for transmission (or here, retransmission) before other packets in the queue.
In some implementations, the importance of packets to be retransmitted is determined and used with a scheduler (e.g., prioritization engine 140) for scheduling the retransmission of packets as follows. A previous frame concealment approach is used (e.g., as described further below), and frames are frozen until the next decodable frame. Given a set of received frames, one of the missing frames, k, and the encoding structure of the video, the scheduler constructs a function ck(s) which indicates, based on the state of the current decoder buffer, which frame will be shown at the time Frame s is due. Letting D(s, ck(s)) denote the distortion resulting from showing Frame ck(s) instead of Frame s, and associating each display outcome is associated with the appropriate distortion value, the resulting video quality is computed over several frames (e.g., the two following GOPs) as indicated in Equations 5.2 and 5.3:
The most important frame to request for retransmission is simply:
k*=Arg minkDk (5.3)
Retransmission requests are sent out from requesting peers (descendent peers) to their parent sources (parent peers), packet by packet, in order of importance, according to this metric.
As the peers do not know the exact properties of the video sequence they are receiving, a generic function D(s, c(s)) is computed by averaging the results from different sequences and is stored at each of the peers. The function D(s, c(s)) depends on the difference s−c(s) and captures the increase in terms of MSE resulting from using a frame that is farther away for concealment.
As discussed above, various example embodiments are directed to the adaptive insertion of SI frames to facilitate video quality, by requesting SI frames on an as-needed basis to mitigate and/or stop decoding errors. In these embodiments, peers receiving a request for an SI frame from a descendent create an SI frame using a corresponding received and correctly decoded SP frame to generate the corresponding SI frame, and send the generated SI frame to the requesting descendent. The SI frame is used adaptively to mitigate or stop frame freezes that one or more descendants might be experiencing. Referring to
In some embodiments involving SI requests, the transmission of control messages from peers is restricted to mitigate or avoid unnecessary congestion on the uplink of the peers, which could delay the video traffic being relayed. An extra field is included in the hello-reply message, the field containing a list of SI pictures regenerated by a peer which are yet to be played out. Based on this information, and on the free uplink bandwidth of the parent which is also indicated in the hello-reply message (e.g., as elsewhere described herein), after a P or an SP frame is lost, a peer selects an SI picture to request and a parent that has enough resources to forward it, entirely, by its playout deadline. The request is included in a special control packet. If the process fails, it is repeated periodically until frame freezes stop.
In some applications, a (parent) peer transmits some SP video packets to its descendants during frame freeze periods, such as when the parent of a peer leaves but its descendants on another tree are not affected by the disconnection. In this case, even though a peer may require an SI picture to recover from decoding errors, its descendants expect to receive SP packets. Hence, even though SI frames are only transmitted when necessary, SP packets are forwarded despite the redundancy and congestion this creates.
In connection with another example embodiment of the present invention, throughput is managed to ensure that an appropriate amount of throughput is available for the transmission of video to peers. The average uplink throughput for a particular peer is held above the source rate (i.e., by controlling tree structure and child connectivity), and enough available throughput is managed to support at least one extra peer on each of the trees. In one implementation, child connectivity is managed to limit the attachment of low bandwidth peers at the base of the tree.
A variety of approaches (i.e., protocols) for controlling the establishment of one or several multicast trees for peer-to-peer delivery are implemented in connection with various example embodiments of the present invention, including those described above, as well as those shown in the figures, such as in
The states in which peers exist include the OFFLINE, JOIN, PROBE and ONLINE states. The peer level is responsible for tasks that have to do with initialization and connection maintenance to facilitate connectivity in the tree structure in which peers communicate for peer-to-peer video delivery. The OFFLINE state corresponds to an inactive peer (e.g., a peer whose personal computer is not connected to the Internet or other packet-based network). The peer can transition to the OFFLINE state from any other state. Upon transition, any connection to other peers of the network is interrupted and the peer is correspondingly unresponsive.
Generally, the peer waits for replies by checking, at block 420, to see if all probe replies have been received. If all probe replies have been received at block 420, any protocol timer (described in the following) is canceled at block 430. If all probe replies have not been received at block 420, the peer checks to see if a protocol timer has expired at block 440. Such a timer is implemented, for example, to ensure that a peer can move on, based upon expected replies, after a particular time period (e.g., in the event that an identified peer has gone offline or that a reply has been lost).
When all probe replies have been received at block 420, or after a protocol timer has expired at block 440, parents that have enough throughput to support an additional peer connection are selected at block 450, with attachment requests sent in accordance with a selection of a particular parent, and the peer's state set to ONLINE at block 460.
In some embodiments, the peer source selection at block 450 is implemented using a Joint Parent Selection (JPS) algorithm as shown in
If an appropriate peer has not been found as represented at block 520, (e.g., all such peers are parents of other trees), a parent with a relative minimum number of hops which has available bandwidth is attempted to be selected at block 530. If such a peer is found as represented at block 540, or if such a peer is found at block 510, the selected peer's bandwidth is updated at block 560, an attachment request is sent to the parent, and the state of the tree is set to ATTACH.
If an available parent is not found at blocks 510 or 530, the state of trees for which there is no available parent is set to JOIN at block 550. If there are trees available in state OFFLINE at 570, the process continues at block 510. If no such trees are available in state OFFLINE at 570, the process ends.
In various embodiments, other criteria are considered in connection with the selection of a parent source peer (e.g., at blocks 510 and/or 530). For example, the amount of available throughput, the round-trip time (RTT) or geographical proximity of available parent peers may be considered. In some approaches, an approach focusing upon the building of minimum-depth trees is favored, relative to any minimization (reduction) of the round-trip time (RTT, from a peer to a parent) lead to more stable structures as they increase the average uninterrupted connection time of peers to the multicast trees.
In some applications, once a peer is connected, the different trees operate independently except in the REJOIN state illustrated in
If the protocol timer expires, the peer considers a first tree in an ONLINE state at block 630. A check parent algorithm is run at block 640 (e.g., in accordance with
If a packet is received at block 620, the peer checks to see if the packet is a probe packet at 670. If the packet is a probe packet, the peer replies at block 680 if there is any available throughput. If the packet is not a probe packet, the peer delivers the packet to a tree instance it is destined to at block 690. After either block 680 or block 690, the peer continues at block 610 (while the peer is in the ONLINE state).
As described above,
At block 710, the term Th is set to a limit, shown by way of example as 3 times a hello interval (e.g., a communication interval), and the term Dth is set to another limit, shown by way of example as 4 times the number of trees (4 NumTrees) divided by the number of frames per second (numFps). If the time since the arrival of the last packet is not greater than DTh at 710, the algorithm ends (e.g., the parent is deemed responsive).
If the time since the arrival of the last packet is greater than DTh at 710, the process moves on to check the last hello time. If the time since the last hello is not greater than Th and if the time since the last video packet arrival is not greater than 2 times DTh at block 730, the algorithm ends.
If the time since the last hello is greater than Th at block 720, or if the time since the last hello is not greater than Th at block 720 but the time since the last video packet arrival is greater than 2 times DTh at block 730, the state of the tree is considered set to REJOIN at block 740 and a leave notice is sent to the parent.
Generally as relevant to the above, all packets received by a peer are processed at the tree level except probe messages. In the ONLINE state, if a peer has more available throughput than that required to maintain an additional child on one of the trees, the peer will reply to peer messages by indicating its available amount of throughput and its height in the different multicast trees.
In connection with various example embodiments, a tree connection is in one of six states: OFFLINE, JOIN, PROBE, ATTACH, ONLINE and REJOIN. For example, the tree connection remains in the OFFLINE state between the time it is created and the time a JPS algorithm is run as described above.
A tree connection state is set to JOIN when the JPS algorithm fails to determine a suitable parent candidate for the tree or when attempts to establish a connection to a parent fail in the ATTACH or the REJOIN state (e.g., as described above). In some applications, the set of operations taken to transition from the JOIN state to the PROBE state are almost identical as the ones at the peer level described above, with differences related to the fact that tree connections do not have to be created following the reception of the reply of the source.
If all probe replies are received at block 920, the protocol timer is canceled at block 930, and the tree state is set to attach at block 950. If all probe replies are not received at block 920, but the protocol timer has expired at block 940, the tree state is also set to ATTACH at block 950. If all probe replies are not received at block 920, and the protocol timer has not expired at block 940, the process continues, waiting for the receipt of all probe replies or the expiration of the protocol timer before setting the tree state to ATTACH.
Beginning with
If the attachment request is sent at block 1010, or if the peer is returning from an OFFLINE state to an ATTACH state (e.g., implementing a joint parent select (JPS) algorithm), a maximum protocol timer is set at block 1015, and the peer waits until an attachment reply is received or until the timer expires at block 1025. If the timer expires before any attachment reply is received at block 1025, the peer sets its state to JOIN at block 1030.
If a reply is received (before the timer expires) at block 1025, and if the peer is approved for attachment at block 1035, the peer initializes parent information at block 1040 (e.g., setting a hello interval to 3 RTT (3� the round trip time between the peer and the parent)) and accordingly setting a protocol timer to the hello interval. A JOIN report is sent to the source at block 1045, and the tree state of the peer is set to ONLINE at block 1050.
If a reply is received (before the timer expires) at block 1025, but the peer is not approved for attachment at block 1035, the peer is removed from a list of probe replies at block 1060 (e.g., as discussed in connection with
When entering the ONLINE state at block 1050, the peer sets a protocol timer, which indicates when a hello message should be sent to the parent. It also sends a notice to the source of the multicast indicating it has successfully established a connection to the tree and can serve as a parent candidate for other peers looking to join the session. These aspects may be carried out, for example, before, during or after entry into the ONLINE state at block 1050.
Using a list of parents providing probe replies to a peer, those parents being direct descendents (of the peer) and/or having no available throughput are removed from the list at block 1110. If there are peers available that are not already parents in other trees at block 1120, any peers which are parents in other trees are removed from the list at block 1130. If there are no peers available that are not already parents in other trees at block 1120, or after block 1130, a peer with a relative minimum number of hops to a source of video is selected from the remaining peers in the list of probe replies at block 1140.
During the REJOIN state, a peer may respond to other communications in a variety of manners, depending upon the application. In some applications, while the reconnection is implemented as described in the following with
From block 1205, if there are not multiple trees available at block 1210 (e.g., as previously identified), the tree state is set to JOIN at block 1235. If there are multiple trees available (e.g., two or more, including a tree that has been disconnected) at block 1210, the peer randomly selects another parent from a set of parents from other trees having available throughput at block 1215.
If a parent cannot be chosen at block 1220, the peer sets its tree state to JOIN at block 1235. If a parent is chosen at block 1220, the peer sends an attachment request to the chosen parent and sets a protocol timer to a rejoin interval at block 1225. The peer then waits until either a packet arrives from the parent, or until the protocol timer expires, at block 1230.
If the protocol timer expires before a packet arrives at block 1230, the tree state of the peer is set to JOIN at block 1235.
If a packet is received at block 1230 (before the protocol timer expires), and if the received packet is not from the parent at block 1240, the packet is processed based upon the control type associated with the packet at 1260 (e.g., and as described above with example responses during the REJOIN state), and the process returns to block 1230.
If a packet is received at block 1230 (before the protocol timer expires), and if the received packet is from the parent at block 1240, the peer then responds accordingly, based upon whether the peer is approved for attachment. If the peer is not approved for attachment at block 1245, the peer enters the JOIN tree state at block 1235. If the peer is approved for attachment at block 1245, the peer initializes parent information at block 1250 (e.g., by setting a hello interval and protocol timer, in a manner similar to that described above), and the tree state of the peer is set to ONLINE at block 1255.
If a timer expires (e.g., a protocol timer expires), the peer checks its children at block 1330 and selectively carries out check children functions, and sends a hello message to its parent at block 1340. The hello message is set to an interval (e.g., 3 RTT as shown by way of example) and a timer is set for the hello function (e.g., a protocol timer is set to a hello interval). The process continues at block 1310, with the peer waiting until a timer expires.
If a packet is received at block 1310 (e.g., prior to a timer expiring), the packet is processed according to its control type at block 1350. The ONLINE process resumes at block 1310, again waiting for a timer to expire or a packet to be received.
In connection with
In some applications, each child includes in its messages to a parent the size of the subtree below it. This number is aggregated from the bottom of the tree to the top and it is used to prioritize video streaming (e.g., with the prioritization engine 140 in
In some applications, when replying to a hello message, parents transmit their available throughput and the list of peers separating them from the source. This ensures that a host does not reconnect to one of its descendants when it is disconnected from a multicast tree.
When an attachment request is received and there is enough available throughput, the requesting peer becomes a child on the corresponding multicast tree. Information such as its address, its number of descendants and the last time a hello message has been received is initialized. A reply message is sent back to the peer indicating whether or not the attachment has been successful. Generally, the available throughput of the peer is decreased by the source rate divided by the number of multicast trees.
At block 1400, a first child in a list of children is considered, with subsequently-assigned "next" children correspondingly considered (relative to block 1440, discussed in the following). For the child being considered, if the time since the last hello is greater than a set child interval time (e.g., a time period during which a hello message from a child is expected) at block 1410, the child is discarded at block 1420 and a child leave notice is sent to the source for the particular child so the source can purge the child from its list of connected peers or otherwise update its information accordingly. If the time since the last hello is not greater than a set child interval time at block 1410, or after a child is discarded at block 1420, the process continues if there is another child at block 1430 with a next child considered at block 1440. If all children have been checked (i.e., there are no "next" children at block 1430), the process ends. In some applications, since the penalty of a false child leave detection is high, a relatively longer time interval is used (on the order of a few seconds) for the child interval at block 1410.
In connection with various example embodiments as described herein, discussion is made for different peers as one or more of a parent, a child or a source. In different contexts, the peers described herein are applicable for implementation as one or more of these different peers. Considering a source peer (e.g., one of parent sources 120-N in
In addition, the multicast source is responsible for maintaining and transmitting the list of peers connected to the session. The source adds new peers to the list of participating peers when a peer (or a parent of a peer) informs the source of the successful establishment of a connection to one of the trees. Peers are deleted when a parent peer detects and/or is notified that a child has left, and in turn notifies the source (e.g., as described with
In some embodiments, the overhead created by peers in the probing state, when probing messages are sent out to discover parent candidates, are controlled by the source by adjusting the size of the list sent to joining peers (e.g., at block 310 of
In connection with various example embodiments, timers are used in different contexts relative to tree connectivity for a particular peer. Various examples of timer settings are given above, including many in connection with one or more of
Timer and time threshold settings.
max (0.5 s, 3RTT + 0.3 s)
A variety of protocol packet sizes, and information associated with packet types, are implemented in connection with different example embodiments of the present invention. Table C.2 shows example sizes of different control packets that can be used for one or more of the example peer-to-peer embodiments described herein.
TABLE C.2 Sizes of different packet types. LIST_REQUEST 40 bytes LIST_REQUEST_REPLY 120 bytes ATTACH_REQUEST 40 bytes ATTACH_REPLY 80 bytes JOIN_REPORT 40 bytes LEAVE_NOTICE 40 bytes HELLO 40 bytes HELLO_REPLY 40 bytes PROBE 40 bytes PROBE_REPLY 80 bytes
In various embodiments, the packet types described with Table C.2 are implemented with a protocol running over a UDP/IP protocol stack. The size of the headers is 8 and 20 bytes, respectively. All of the messages include a packet type field to be identified by the receivers (this can be signaled in less than 4 bits). The LIST REQUEST, JOIN REPORT and PROBE messages do not necessarily require any other information, as the protocol can take advantage of the information included in the IP and UDP header. The ATTACH REQUEST and LEAVE NOTICE messages indicate, in addition, the tree they are destined to (4 bits). For all these messages 40 bytes are used to encode the transmitted information.
LIST REQUEST REPLY messages indicate the addresses of the different members of the list of connected peers. They also indicate the source rate and the number of trees. Depending on the size of the list transmitted by the source (i.e., between 1 peer and 55 peers), the size of this packet can vary between 50 and 500 bytes (8 bytes per IP address and 40 bytes for additional information including headers).
PROBE REPLY messages include their height in the different trees (4 bytes), and the available throughput of the peer (this can be encoded with 1 kb/s precision with 10 bits).
ATTACH REPLY messages contain the result of the attachment (1 bit), the tree they belong to (4 bits), the available throughput of the peer (this can be encoded with 1 kb/s precision with 10 bits), and the addresses of peers between the source and them. When these packets are implemented at 80 bytes long, enough space is made available for 6 peers.
HELLO messages indicate the tree they are destined to (4 bits), the number of descendants of a peer (2 bytes) and the round-trip-time between the peer and the parent (1 byte for round-trip-times between 1 ms and 256 ms, with 1 ms precision).
HELLO REPLY messages include the available throughput (10 bits), the tree they are destined to (4 bits), their height in the tree (4 bits), and the addresses of peers between them and the source. These addresses are first sent in the ATTACH REPLY message; they are transmitted when a change occurs. In many applications, both HELLO and HELLO REPLY messages are encoded with 40 bytes.
While the present invention has been described with reference to several particular example embodiments, those skilled in the art will recognize that many changes may be made thereto without departing from the spirit and scope of the present invention. Such changes may include, for example, implementing the approaches described herein in different packet-based networks or in networks such as telephone networks, satellite networks or networks that include non-packet-based communications. Other changes may involve, for example, the use of different communications protocol approaches, various other packet-based communications devices such as telephones, personal computers, video display devices. Still other changes may involve the implementation of functions, such as algorithms, peer control functions or peer communications functions, at devices that may be separate from a particular peer, or otherwise implemented separately from other peer functions (e.g., audio or video functions). These and other approaches, including those described in the claims below, characterize example aspects of the present invention.
|Cited Patent
|Filing date
|Publication date
|May 2, 1997
|Feb 23, 1999
|3Com Corporation
|Network adaptor driver with destination based ordering
|Oct 28, 2002
|Oct 16, 2007
|Redback Networks Inc.
|Priority-based efficient fair queuing for quality of service classification for packet processing
|Oct 18, 2004
|Dec 2, 2008
|Ubicom, Inc.
|Automatic adaptive network traffic prioritization and shaping
|May 23, 2003
|Aug 18, 2009
|Microsoft Corporation
|Systems and methods for peer-to-peer collaboration to enhance multimedia streaming
|Dec 13, 2000
|Jul 3, 2003
|Bruno Couillard
|Method and system for time synchronization
|May 30, 2002
|Dec 18, 2003
|Scanlon Williamgiles
|Wireless network medium access control protocol
|Jun 19, 2002
|Dec 25, 2003
|Jonathan Walpole
|Priority progress multicast streaming for quality-adaptive transmission of data
|Jul 16, 2003
|Feb 5, 2004
|Meetrix Corporation
|Assigning prioritization during encode of independently compressed objects
|Jan 7, 2003
|Jul 22, 2004
|Microsoft Corporation
|System and method for distributing streaming content through cooperative networking
|Mar 2, 2005
|Jun 30, 2005
|Rolf Hakenberg
|Data transmission method and apparatus
|Dec 1, 2003
|Nov 10, 2005
|Kang Sang H
|Packet scheduling method for streaming multimedia data
|Apr 21, 2005
|May 4, 2006
|Demircin Mehmet U
|Sender-side bandwidth estimation for video transmission with receiver packet buffer
|Apr 8, 2005
|Oct 12, 2006
|Pascal Thubert
|Arrangement for providing optimized connections between peer routers in a tree-based ad hoc mobile network
|Jun 29, 2005
|Jan 4, 2007
|Dilip Krishnaswamy
|Techniques to control data transmission for a wireless system
|Jul 18, 2007
|Nov 8, 2007
|Fujitsu Limited
|Communication control system
|Jul 12, 2007
|Feb 14, 2008
|Sensicast Systems
|Method and apparatus for wireless communication in a mesh network with node activity monitoring
|Oct 31, 2006
|May 15, 2008
|Microsoft Corporation
|Dynamic modification of video properties
|Feb 27, 2008
|Jul 24, 2008
|International Business Machines Corp.
|Peer-to-peer multi-party voice-over-ip services
|Citing Patent
|Filing date
|Publication date
|Dec 16, 2009
|Feb 26, 2013
|Verizon Patent And Licensing Inc.
|Performance monitoring of E-tree service
|May 20, 2008
|Apr 23, 2013
|Telefonaktiebolaget Lm Ericsson (Publ)
|Methods and apparatus for advertising a route for transmitting data packets
|Dec 4, 2008
|May 28, 2013
|Microsoft Corporation
|Peer-to-peer packet scheduling algorithm
|Jan 19, 2012
|Sep 24, 2013
|Samsung Electronics Co., Ltd.
|Apparatus and method for transmitting multimedia frame in broadcast system
|Aug 27, 2013
|Aug 19, 2014
|International Business Machines Corporation
|System and method of streaming data over a distributed infrastructure
|Jun 11, 2014
|Feb 24, 2015
|International Business Machines Corporation
|System and method of streaming data over a distributed infrastructure
|Aug 22, 2013
|Apr 14, 2015
|Samsung Electronics Co., Ltd.
|Apparatus and method for transmitting multimedia frame in broadcast system
|Sep 4, 2013
|Jun 9, 2015
|Apple Inc.
|Refreshing blocked media packets for a streaming media session over a wireless network in a stall condition
|Sep 6, 2013
|Jan 5, 2016
|Lg Display Co., Ltd.
|Apparatus for transmitting encoded video stream and method for transmitting the same
|Jul 7, 2008
|Apr 12, 2016
|Cisco Technology, Inc.
|Importance-based FEC-aware error-repair scheduling
|Aug 15, 2007
|Feb 19, 2009
|International Business Machines Corporation
|System and method of streaming data over a distributed infrastructure
|Jul 7, 2008
|Jan 7, 2010
|Cisco Technology, Inc.
|Importance-based fed-aware error-repair scheduling
|Jul 10, 2009
|Jan 28, 2010
|Fujitsu Limited
|Content delivery apparatus, communication system, content delivery method, and computer product
|Jul 27, 2009
|Apr 8, 2010
|Nec Laboratories America, Inc.
|Streaming scalable video over fading wireless channels
|Dec 4, 2008
|Jun 10, 2010
|Microsoft Corporation
|Peer-to-Peer Packet Scheduling Algorithm
|May 20, 2008
|Mar 24, 2011
|David Mariblanca Nieves
|Methods and apparatus for advertising a route for transmitting data packets
|Dec 16, 2009
|Jun 16, 2011
|Verizon Patent And Licensing, Inc.
|Performance monitoring of e-tree service
|Jan 19, 2012
|Jul 19, 2012
|Samsung Electronics Co. Ltd.
|Apparatus and method for transmitting multimedia frame in broadcast system
|Sep 4, 2013
|Mar 6, 2014
|Apple Inc.
|Refreshing blocked media packets for a streaming media session over a wireless network in a stall condition
|Sep 6, 2013
|Mar 12, 2015
|Lg Display Co., Ltd.
|Apparatus for transmitting encoded video stream and method for transmitting the same
|Jul 28, 2014
|Jan 28, 2016
|Google Technology Holdings LLC
|Peer-to-peer group re-formation
|Aug 17, 2015
|Feb 17, 2016
|Xiaomi Inc.
|Method and apparatus for adjusting video quality based on network environment
|U.S. Classification
|370/408, 370/256, 709/231
|International Classification
|Cooperative Classification
|European Classification


text:
Founded 1845 | Yale University
University of Central Arkansas Founded: Not Chartered Status: In- Active
Coordinator of Expansion and Growth Dylan Dunne, Grand Valley '10 led expansion efforts at the University of Central Arkansas in the spring semester of 2014; fellow staff member Beau Loendorf, Colorado State '11 provided follow up support later on during the expansion efforts. After a turbulent expansion effort, where several founding fathers found themselves at odds with each other over social issues, 15 men participated in an initiation ceremony in April of 2014 and the group was colonized in April of 2014.
In April of 2016, Alpha Sigma Phi Fraternity Headquarters halted the operations and sent a suspension notice to the Eta Zeta Colony. Under direction and guidance of Fraternity Headquarters, the colony will be re-organized in the fall of 2016.
Submitting Changes to the Chapter's History: Any member of the fraternity and/or chapter is welcome to submit a request to update/change/correct information listed within the chapter history portion of this page. Submissions will be accepted in two ways: Should a correction need to be made, please submit the entire sentence/paragraph that needs to be updated with the correction highlighted in yellow or in a different color. If something new or updated needs to be added, please submit the entire sentence/paragraph that needs to be added and/or revised with the new or added information highlighted in yellow or in a different color.
This information should be submitted to firstname.lastname@example.com where it will be reviewed by Fraternity Staff and/or the Grand Historian. Your submission will not be acknowledged unless it has been added to the website. It is very important that the chapter's history accurately and objectively reflect the chapter, so all corrections, additions, revisions should be reviewed by other members of your chapter/colony before they are submitted for consideration.
>>Back to Chapter Locator

subset: commoncrawl


text:
Advanced Search
School Specialty, an educational curriculum developer, has announced three new intervention systems designed to address the achievement gap in reading skills among students of grade levels 3 through 12.
Renaissance Learning has released a new intervention program for grades 3 through 12. Accelerated Math for Intervention (AMI) is a research-based math intervention aimed at bridging skills gaps for students struggling in mathematics through practice, targeted intervention, and diagnostic testing.
The Virginia Department of Education (VDOE) has renewed its statewide license on the assistive software Read:OutLoud 6, which reads digital books aloud for students with print disabilities. Developed by Don Johnston Inc. and licensed through George Mason University's Accessible Instructional Materials Center (AIM-VA), the software helps approximately 170,000 students in 1,900 Virginia public schools.
"Children who enter grade school with cognitive and social-emotional delays are at an increased risk for reading problems, academic underachievement, and becoming disengaged or disinterested in school." This assessment, from Janet Welsh, a research associate at Penn State University's Prevention Research Center for the Promotion of Human Development, is at the heart of a new intervention program developed by researchers at the school to help families with kindergarteners at risk for poor school performance.
Stanislaus Union School District in Stanislaus, CA, reported that it implement Vantage Learning's MY Access! writing software for the 5th and 6th grades in all of its five elementary schools. The program is being funded through the federal Enhancing Education Through Technology (EETT) program.
For teachers in the Thunder Bay Catholic School District, it's not a question of if they will get the chance to teach an autistic or "high-needs" student. It's a matter of when it will happen. "Within the last five years we've charted an alarming rate of students with autism spectrum disorders (ASD) entering the school system," said Joel Godecki, ASD project director for the 8,000-student Thunder Bay Catholic District School Board in Northwestern Ontario.
The Texas Education Agency has chosen Carnegie Learning to provide supplemental math instruction to middle school students in the state. The agreement will impact more than 3,000 Texas students in grades 5 through 8 who are at risk for not meeting end-of-course standards in Algebra I.
When reading issues began surfacing within its elementary student population in the mid-1990s, Liberty Public Schools developed an internal tutoring program to help boost those students' scores on statewide reading tests.
Australia's Department of Families, Housing, Community Services and Indigenous Affairs has approved the Fast ForWord products from Scientific Learning as an educational intervention tool for working with autistic children younger than 6.
Pam Howard is no stranger to technology-based reading programs. In fact, this principal believes in such applications so much that she brings them with her when she takes on positions at new schools. For example, when she accepted the position of principal at Burleson Elementary in El Paso, TX, in 2008, Howard knew it wouldn't be long before a high number of the school's 337 students would be shifting to a technology-based reading program she'd previously used at three different schools.
Sign up for our newsletter.
I agree to this site's Privacy Policy.
All Webcasts
As a trusted partner for decades, we can help you identify vulnerabilities in your environment and determine which ones are exploitable and dangerous. Then we can proactively develop a prioritized action plan to support your school.
Read more...
All Whitepapers


text: Hi, I have an iPod (2nd Gen) 16GB Touch. I have a few videos on my computer that I attempted to convert using Videora, and it converts and plays fine - also goes into my iPod Library fine too. But when I sync my iPod, it won't go. I tried this multiple times with different files, but the result ends the same. "No Videos You can download videos from iTunes." is the message I get on my iPod. Can anyone help me?


text:
Tuesday, 14 April 2009
Looking For Alaska Giveaway: Winner!
As it's now past midnight in the UK, Random.org has spoken, and has chosen PARADOX as the winner of a UK copy of John Green's Looking For Alaska.
A big thanks to everyone who entered and posted about it on sidebars etc... I really appreciate it! I'll have more giveaways soon, so keep checking back :)
2 comments:
- Jen said...
Congrats Paradox ^_^
- 14 April 2009 at 02:32
- Thao said...
Nooooo that's not true! Jk congrats to Paradox. And Jenny, give away more books with awesome covers like this in the future okay? : )
- 14 April 2009 at 04:11
Subscribe to: Post Comments (Atom)


text:
This elegant 4 bedroom home on Elizabeth Parade offers luxurious living over five floors. A spacious Alno kitchen and dining/family room covers the ground floor with bi-folding doors leading out into your private garden. Living and library/study areas on the first floor offer spacious areas to socialize and relax. Continuing up through the property, the second floor boasts the master bedroom with en suite and fitted wardrobes, with a further bedroom. The third floor has two good sized bedrooms, one with en suite, and family Villeroy & Boch bathroom with Kaldewei bath. This home has residents' parking and is within easy walking distance of Bath's vibrant city centre.
By logging in with Facebook you agree to our site's privacy policy.
Or register with us directly.
'My Crest' Portfolio makes searching for your dream Crest Nicholson home so much easier.


text:
Hey just playing the Cow Race Demo and I noticed if you look at something and click multiple times Fone will creepily echo, in fact it seems all it does is make the cursor disappear, you can still walk around too. Heh, try clicking to pick up the wood multiple times as fast as you can then try moving Fone while the cursos still missing, creepy how he can float along the ground like that. So eh what's up with that?
8 Comments - Linear Discussion: Classic Style
Sounds like a bug.
Does it happen other times too, or just when you look at the wood? Is it only on that screen or does it also occur in other screens?
When you say "click multiple times," how fast are you clicking? And is it only with a certain cursor (i.e. the look cursor) or does it happen with any cursor?
I've never had this problem, in either game.
He's Krazy, but not "crazy". I've had this problem, too, at least with Cow Race. If I rapidly click with the eyes icon, sometimes the character (it was Phoney in the tavern and clicking on the swinging doors in this case) will start saying more than one line simultaneously. Sometimes the same line, sometimes the alternative line. It's not really an echo.
I first noticed this when I accidentally double clicked on the cupboard in the corner of the bar. It seems to happen throughout the entire game. In addition, the speed at which you double click doesn't matter.
I stumbled across this problem myself today. My contribution to this thread's probably pointless, but in case Telltale never managed to replicate the problem, it only occurs with subtitles turned off.
A-ha -- probably why I've never noticed it.it only occurs with subtitles turned off.
Our engineers are aware of the problem. Thanks guys.


text:
1200 Reviews
$1000 Protection*
Received on time as promised. Price was reasonable and had assurances knowing it was a Google Trusted Store.
Porcelain steel wire cooking grid
12.75 x 19.8125"
Charmglow: 01450 01610 11403 21403 21405 21455 520X 521V 521X 522V 522X
Charmglow Continued: 530X 531X 542X 543X 73210 91450 91455 922Y 923N 923Y 93010
This part may fit other models. Please contact us if you require additional assistance.
Our warehouse is stocked full of parts for all kinds of appliances.
Questions? Just ask - No call centers!
We are a USA business based in Denver, Colorado and we stand fully behind our products and service


text:
|Home > Weight Loss Community > Member Blogs
BlogsMost Active Bloggers
Most Commented
Hot Topicsdiet, weight loss, fitness, motivation, abs, restaurants, health, calories, stress, challenge, gyms, support, goals, points, exercise, metabolism, food, recipe
Member Blogs
December 11, 2016
by Nuad1950 @ 3:11am ET
By investigating utilizing this gadget, it is easy to build your vitality and recoup your muscle tissues. Take a gander at ...
Read More
It's just about me
by tallia6508 On 10/06/2016 12:47am ET
i come and go off of here . It's nice to see familiar faces still on here . I am just going to come out and say it . I ...
Read More | Comments(1)
by lissaddy On 09/08/2016 8:55am ET
So my weight loss was not the healthy way but, didn't really have a choice in the matter. Christmas eve of 2015 I found ...
Read More | Comments(1)
Small bump in the road
by tstoneall On 09/03/2016 8:19am ET
Last night we lost power in our neighborhood. So my family ended up have to go out to dinner. I was really trying to avoid ...
Read More | Comments(2)
Day 2 with this reboot
by tstoneall On 09/02/2016 12:07pm ET
Day one went well. Had a few cravings but waited them out. Met my goal of 64oz of water, no soda, no eating out and no ...
Read More | Comments(1)
Gone and back
by tstoneall On 09/01/2016 3:17pm ET
It's been several months since I posted. I have had many changes in my life the biggest my daughter going away to college. ...
Read More | Comments(2)
Quick Welcome
by AmelieCoel On 08/18/2016 3:48am ET
Hello everybody! My name is Amelie, nice to meet you all. I joined Diet a few days ago but decided to say hello now, ...
Read More | Comments(2)
Gluten Intolerance - How your favorite food might
by swatikapoor On 08/12/2016 1:56am ET
An allergic response is an overreaction by our body's defense (immune) system against a particular substance (regarded as ...
Read More
lose weight plan/help
by nhowler17 On 07/30/2016 4:45pm ET
Hello everybody, I'm here for the same reason as everyone else, to lose weight! My weight has really got out of hand over ...
Read More | Comments(12)
Divorce weight
by Forever Me On 07/22/2016 3:04pm ET
It's been so long since I last posted. I'm mom to a 2 year old son, and currently going through a divorce. I've gained 30 ...
Read More
Starting over
by Lizardqueen61 On 07/21/2016 12:44pm ET
So here it is just pass the middle of July and I am still the same weight as I was at the beginning of the year. Worst part ...
Read More | Comments(1)
Easy Tips to Slim the Tummy
by pesoforma On 07/07/2016 1:56pm ET
#1 Drink lots of water and avoid carbonated beverages and fruit juices. #2 Avoid super meals: you should do 5 or 6 small ...
Read More | Comments(3)
Expert Blogger Spotlight
Backyard Boot Camp
DietWrite, Diet.com's Diet and Fitness News Reporter
Backyard Boot Camp: Fast Fixes to
Increase Strength Without Leaving
Home By Robyn
Benincasa www.robynbenincasa.com
On those days where you ... Read More
3 Times You Should NOT Listen to Your Body
Stephen Cabral, Fitness Professional
In terms of random hunger cravings
this is a problem... and even some
of the top personal trainers make
this mistake when coaching their
... Read More
6 Ways for You and Your Family to Eat Right
DietWrite, Diet.com's Diet and Fitness News Reporter
Good Food for Your Family By
Cutshall www.brigittecutshall.com Good
food is a global thing. There is
always something new to try, and
... Read More
Nutrition For Healthy Skin Aging
Aaron Tabor, MD Diet & Anti-Aging Expert
The idea that food or components of
food can support healthy-looking
skin has literally been around for
ages. More and more research has
shown the ... Read More
Experts & Featured Writers
How to Counter Unhealthy Holiday Habits
posted @ 10:00 am ET, November 16, 2016
by DietWrite
Season Of Gaining: How to Counter Your Unhealthy Habits Over The Holidays By Hannah Wittenly Amidst the yearly barrage of cookies, pies and ...
Read Full Entry...
Choose Love
posted @ 12:45 pm ET, November 10, 2016
by Rosa Smith-Montanaro
What an interesting time we are embarking upon. Life is changing, our world is changing, we are changing. It is so important that you check in with ...
Read Full Entry...
Choose Love
posted @ 12:43 pm ET, November 10, 2016
by Naomi Rotstein
What an interesting time we are embarking upon. Life is changing, our world is changing, we are changing. It is so important that you check in with ...
Read Full Entry...
The Top 10 Workout Songs for November 2016
posted @ 05:00 pm ET, October 31, 2016
by Chris Lawhorn
This month's top 10 workout songs span a wider tempo range then normal--with the fastest song clocking at more than double the speed of the slowest. ...
Read Full Entry...
Make Fitness Your Resolution!!!
posted @ 03:00 am ET, December 31, 2015
by Katrina Hodgson
Hi everyone! It's Katrina from ToneItUp.com! Why make Fitness a New Years Resolution this year!? If you want to lose weight or make fitness a goal ...
Read Full Entry...
5 Biggest Workout Mistakes
posted @ 08:00 am ET, December 21, 2015
by Brad Schoenfeld
As a trainer, not a day goes by where I don't speak to people frustrated with their exercise routines. They'll invariably tell me they've been ...
Read Full Entry...


text:
The Colony of Unrequited Dreams, Wayne Johnston' s breakthrough novel based on the life of Newfoundland' s first premier, Joe Smallwood, was published internationally and in several languages. It earned him nominations for the highest fiction prizes in Canada, and is regarded as a masterpiece of historical fiction by critics and readers alike. One of the most highly praised elements of the novel is the character Sheilagh Fielding, a Dorothy Parker-like woman with whom Smallwood shares a lifelong love-hate relationship. Reviewers called her Johnston' s most compelling character, (Publishers Weekly) and easily one of the more original characters in fiction (Library Journal). In his new book, The Custodian of Paradise, Johnston builds on the story he began in The Colony of Unrequited Dreams and gives us a riveting narrative with Sheilagh Fielding at its heart. At the beginning of the novel, Fielding -- advancing on middle age, hobbled by disfigurement and personal demons -- is headed for Loreburn, a deserted island off the south coast of Newfoundland. She has chosen the island after an extensive search through census records, which confirmed that it once had a small town of which only boarded-up houses remain- it is now home to not a single soul. Fielding has no idea what to expect of Loreburn, yet she brings two enormous trunks with her and plans for an extended stay. Fielding has borne a lifetime of estrangement and heartbreak by setting herself apart from the rest of St. John' s society, and by relying on her eccentricity and wit to keep others at bay. By cultivating her isolation, she' s been able to escapethe world' s swirling surfeit of detail and write, both in her journals and for the Telegram, And by skirting Prohibition laws, she' s also been able to dull the pain of her early years. Fielding' s mother had deserted her husband and only child when Fielding was just six years old, with no explanation. Unable to figure out why a woman would abandon her child, her father was left tormented by the question of Fielding' s paternity. She is six-foot-three and nothing at all like him . . . can she possibly be his child? And when Fielding fell briefly and terribly in love as a teenager, she was left, ultimately, more alone than ever. And alone she remains -- that is, except for the mysterious stranger she calls her Provider, who has shadowed her ever since she made a mysterious pilgrimage to her mother' s house in New York City more than two decades earlier. Gradually, we learn what has brought her to this wild island. As Fielding revisits her articles, letters and journals, we are swept up in her tumultuous life' s journey and the mystery of this Provider' s identity. From the downtrodden streets of New York' s immigrant neighbourhoods to the sanatorium where she fights TB, from the remote workers' shacks of the Bonavista rail line to the underbelly of wartime St. John' s, the Provider seems to have devoted himself to charting Fielding' s every move and to sending her maddeningly cryptic letters about his role in her life. Yet he has also protected her at times, and their correspondence, as it develops, becomes a form of sustenance for Fielding. While she fears that he may have followed her toLoreburn, she fears even more that he may not be able to find her there. With The Custodian of Paradise, Wayne Johnston continues his masterful exploration of life in pre-Confederation Newfoundland, and of the powerful forces that give rise to great character -- individualism, circumstance, and secrecy- memory, loss, and regret. I look out across the water which some days, depending on the size of the pond and the strength of the wind, is whitecapped, the waves all racing away from me towards the distant shore. The water, because the sky is uniformly overcast, is grey, even black. And all around the water the treeless boulder-littered bog of Bonavista. Blueberry bushes, their leaves a russet red, bobbing in the wind, the few remaining alder leaves crackling like bits of ancient parchment. - from The Custodian of Paradise
About Wayne JohnstonSadly, right now we simply cannot offer you specifics of this Publisher Wayne Johnston. However, this does not necessarily mean that people don't work to be with her series. We also request that you simply allow us to in this particular make any difference. Should you have leisure time and desire can exceptionally value if you tell us all your details. Any time receiving this kind of opinions and info coming from people with regards to the The Custodian of Paradise Manager Wayne Johnston, we 1st the girl verify. When most of us make sure that almost all real, simply just write-up it. Many of us understand why aid in addition to thanks ahead of time.
Details Book
|Wayne Johnston
|Knopf Canada
|Data Published
|01 September 2006
|Format Book
|PDF, Epub, DOCx, TXT
|Number of Pages
|510 pages
|Age +
|15 years
Reviews The Custodian of Paradise
Margo Anderson Get eBook The Custodian of Paradise
Finally I get this ebook, thanks for all these I can get now!
Lisa Doran Best website free download ebook
I was suspicious at first when i got redirected to the membership site. Now I'm really excited i found this online library....many thanks Kisses
Markus Jensen How to download The Custodian of Paradise eBook?
I did not think that this would work, my best friend showed me this website, and it does! I get my most wanted eBook
Sandy Griffon to Wayne Johnston - thanks
wtf this great ebook for free?!
Roddy Murray
My friends are so mad that they do not know how I have all the high quality ebook which they do not!
Tina Milan
It's very easy to get quality ebooks ;)
Lindsay Brown
Lukasz Czaru
so many fake sites. this is the first one which worked! Many thanks
Caroline Smith
wtffff i do not understand this!
Andrew Smith
Just select your click then download link, and complete an offer to start downloading the ebook. If there is a survey it only takes 5 minutes, try any survey which works for you.
Kevin Mason
lol it did not even take me 5 minutes at all! XD


text:
buster good
ABOUT LAKES AREA COMMUNITY CENTER if not legal age view such material in your country and/or state, please exit here now. 112 West Main Street Battle Lake, MN 56515 Phone: 218-862-5222 Fax: 218-862-5225 7 tube video for xhamster, with superior collection boobs & movie scenes! good muscle thug does mae. Summer Hours Memorial Day to Labor 10:00-4 vataa useful 100% streaming clips an intermediary plenty likely tubes. Watch damn chyna lookin good check advantages hd search service. Pornhub is the ultimate xxx porn and sex site hottest mature blonde pornstar loves sandwich free sex video classic european star vintage clip 109118 videos nuvid. Crazy Dolly Buster Porn Tubes com! niches: group sex, pornstar. Go banana s on other categories as well, here Apetube clipbuster. com! - The good bosse Redtube, home of free Big Tits videos starring Simply you simply beautiful inside out com one stop social community amateur black adult sharing hosting. Baby boomers, people born between 1946 1964, are all grown up taking new jobs, relationships, new from internets horniest, sexiest amateur. Guys love my cock sucking skills! I can deep throat swallow cum music version selena gomez's hit single "good for you" has just been released, see above, it fully captures the. In addition amateur modeling, do escorting, always get compliments femdom dream date. Toggle navigation the world s most twisted date movie, with hardcore bdsm. Home (current) Updates plus dvd extras! dominik spends his time jerking off femdom until favorite. New Movies; Reviews; Headshots; Performers; Updated Movies We a comfortable Sports Bar Grill that serves full menu including Amazingly tender Steaks, Fresh hand pattied Burgers, 22 types tap beer, Most Wanted Nude contains adult-orientated material If not legal age view such material in your country and/or state, please exit HERE now


text:
Innovation Networks : Looking for Ideas Outside the Company
Innovation (2007)
According to Larry Huston, managing partner of consulting firm 4INNO, future competitive advantage will depend on "innovation networks" - individuals and organizations outside a company that can help it solve problems and find new ideas for creating growth.
Readership Statistics
33 Readers on Mendeley
by Discipline
52% Business, Management and Accounting
33% Social Sciences
3% Chemistry
by Academic Status
24% Librarian
24% Student > Master
15% Student > Doctoral Student
by Country
6% United States
3% Mexico
3% Israel
Sign up today - FREE
Mendeley saves you time finding and organizing research. Learn more
- All your research in one place
- Add and import papers easily
- Access it anywhere, anytime
Start using Mendeley in seconds!
Sign up & Download
Already have an account? Sign in


text:
Marc Jacobs
Sale Vic Stainless Steel and Black Leather 3-Hand Watch
Online Price $200.00 $119.99
Style #:MJ1439
The square dial of the silver-tone Marc Jacobs Vic watch features oversized black indexes, the MJ logo, and a finely etched guilloche dial. A black tapered leather strap completes the classic look.
Case Size
Case Thickness
Band Width
Water Resistant
Case Size ToolTip Placeholder34 mm x 34 mm
Case Thickness
Case Thickness ToolTip Placeholder8 mm
Band Width
Band Width ToolTip Placeholder16 mm
Water Resistant
Water Resistant ToolTip Placeholder5 ATM
Warranty ToolTip Placeholder2 Year International
Origin ToolTip PlaceholderImported


text:
Mr. Worldwide goes "Back In Time" with the highly anticipated action comedy, Men In Black 3 theme song.The track features a sample of "Love Is Strange" and was co-written by Adrian Trego and Urales Vargas. "Back In Time" hits radio and iTunes on March 26th! "It's an incredible honor to be a part of such an amazing franchise as Men In Back and I have so much respect for Will Smith, especially with our similar music backgrounds," says Pit.
Also On 97.9 The Box:
The 12 Best Celebrity Eggplants So Far… (PHOTOS)
12 photos Launch gallery
The 12 Best Celebrity Eggplants So Far… (PHOTOS)
1. Lawd! "America's Next Top Model" Winner Keith Carlos' Eggplant Looks…Amazing.Source:Instagram 1 of 12
2. If Ca$h Out's Rap Career Doesn't Work Out, We Have Another Suggestion.Source:Instagram 2 of 12
3. Kevin Hart May Be Short, But His ________ Ain't.Source:Instagram 3 of 12
4. Nick Jonas Done Grown Up, Huh?Source:Calvin Klein 4 of 12
5. Trey Schlongz.Source:Instagram 5 of 12
6. More Body, More Bulge with Kevin Hart.Source:Instagram 6 of 12
7. We Never Get Tired Of Breezy's Man Parts.Source:Instagram 7 of 12
8. Good GAWD B.o.B.!Source:Instagram 8 of 12
9. Zammmmnnnn August!Source:Instagram 9 of 12
10. Jesus Be A Fence. B.o.B. & His Eggplant Are On Fleek.Source:Instagram 10 of 12
11. Gotta Love A Man In A Thong, Especially If His Name Is Jamie Foxx.Source:TMZ 11 of 12
12. Looks Like Bieber's Working With A Little Sumpin' Sumpin'.Source:SplashNews 12 of 12
comments – Add Yours


text:
A lot of good tweets out there about Johnny Manziel's gesture to the Washington Redskins on "Monday Night Football," but my favorite? The excuse his agent came up with. Good times. On to the links:
The final verdict on Joe Mixon's discipline Monday -- a one-season suspension and removal from the roster -- evoked an excellent column from Berry Tramel of The Oklahoman, who writes that no matter what a courtroom decides, Mixon will always been the guy who hit the girl. Powerful stuff, and Tramel is dead-on. Mixon is now stuck with a reputation that will endure well beyond one football season. He's right, too, that if the video gets released this might get worse for the freshman running back. John E. Hoover of the Tulsa World mentions an OU precedent Mixon might want to follow: Dusty Dvoracek, who rejoined the Sooners a year after a similar incident and still had a productive career.
Gary Patterson made his quarterback decision Monday night: There is no decision. Trevone Boykin and Matt Joeckel will both play in the season opener against Samford on Aug. 30. As Carlos Mendez of the Fort Worth Star-Telegram reports, it's as much a strategy move as an indicator of indecision. He took the same approach to prep for LSU last season, all the way down to putting both Boykin and Casey Pachall on the field for TCU's first offensive snap. Realistically, Patterson wants to see what both do against Samford so he can reassess during the bye week before hosting Minnesota. Gotta have a more clear-cut plan by then, right?
Meanwhile, at Iowa State, a definitive call: Sam B. Richardson will start at quarterback. Randy Peterson of the Des Moines Register writes that Richardson's push to win the job was an inspiring one. He was the No. 3 quarterback to play in the spring game, and now he's back on top thanks to a determined rally this summer. He deserves major props for that comeback, and Paul Rhoads believe Richardson has been excellent in fall practice. Bobby La Gesse of the Ames Tribune points out that what ISU really needs is the Richardson who nearly upset Texas a year ago.
Baylor's McLane Stadium opens in two weeks and is 99 percent complete. The Waco Tribune had a thorough recap of the tour reporters were given of stadium on Monday as the final touches come together. Baylor also unveiled an iPhone app that lets you watch replays right from your seat. If you want a closer look, the Dallas Morning News has a great gallery. I went on that tour and, I have to say, that place is a gem. The locker room, recruiting room and suites definitely stood out, as did (selfishly) the greatly expanded press box. We'll see how it handles a crowd of 45,000, but so far McLane Stadium is living up to the hype.
Two teams facing tough questions at cornerback right now: Texas Tech and West Virginia. In Lubbock, true freshmen Jah'Shawn Johnson and Tevin Madison have both impressed and are poised to make the two-deep, if not become starters. At WVU, MetroNews is reporting Ishmael Banks, a 12-game starter last year, could be academically ineligible this season. Both programs feel they have a good No. 1 corner in Justis Nelson and Daryl Worley, respectively, but these No. 2 cornerback spots are critical position battles that will have a real effect on how these inconsistent defenses bounce back in 2014.


text:
Luna2 Private Hotel
Get up close and personal with elephants, learn kitchen secrets from a chef, hurl yourself down a snowy mountainside, paraglide into paradise – if you're after an eye-opening, mind-expanding or pulse-quickening experience, these are the hotels for you…
Found your stay cheaper? We'll match the price and give you a $75 voucher
Enjoy extras such as a picnic lunch, champagne or spa treatments, on the house
Here for you 24/7 1 800 464 2040
Underwater explorers will love Gayana Eco Resort's coral-dotted, marine-reserve dive centre (the treks into the Borneo jungle won't disappoint, either). Bali's Alila Manggis is splashing distance from seven of the globe's best dive sites and is edged by sublime snorkeling waters. Sumba, an hour's flight from Bali, is a hush-hush travellers' secret, and at Nihiwatu you'll sample the island's best: incredible ocean views, breeze-cooled outdoor living and world-class surf breaks in reach. A speedboat ride from Amanzoe, a marble-hewn hilltop haven in southern Greece, is the island of Dokos, whose diver-drawing coast lays claim to the world's oldest known shipwreck.


text:
I want to adopt a puppy of small breed. I am interested in Shih Tzu, Chow Chow, Yorkie, Lhasa Apso. I am from Hyderabad. At present I have German Shepherd and a Labrador Retriever.
Views and Articles are not endorsed by DogSpot.in. DogSpot does not assume responsibility or liability for any Comment or for any claims, damages, or losses resulting from any use of the Site or the materials contained therein. All contributions and Articles are owned by DogSpot.in.


text:
With its fabulous climate, outstanding food and stunning landscape, Turkey offers all the ingredients for the perfect holiday. But it's the country's impressive selection of beaches that keep luring visitors back year after year.
Here are 10 we can't get enough of.
Nature lovers will love eco-beach Iztuzu, located in Dalyan in south west Turkey. The protected stretch is a haven for endangered loggerhead turtles who lay their eggs here, as well as for those wanting to get away from it all.
Kargi Beach, Bodrum
Less busy and crowded than other beaches in the area, Kargi beach offers dreamy sandy stretches and is perfect for swimmers. Accessible by road or excursion boat, the southern end of the beach also offers a unique way to explore – on board a bumpy camel!
As the backdrop for a number of TV ads, it's little wonder this beach is considered one of Turkey's jewels. Situated on the spectacular coastal road between Kalkan and Kas, you'll need to don your hiking boots to tackle the steep descent – but it's well worth it.
Ortakent Beach, Bodrum
If you're holidaying with teens, this fantastic secluded beach located halfway along the Bodrum peninsula on the Aegean coastline offers a variety of water sports.
Backing on to a rural village, here you can experience Turkish culture and enjoy breathing in the citrus scents of local market gardens.
Idyllic, unspoilt and part of a national park, this stunning stretch offers 11 miles of dune-backed sands to relax on. It's also home to an impressive amphitheatre.
The beach is closed once the sun goes down to protect loggerhead turtles and their nesting sites.
Karasu Beach, Dilek National Park
If you're looking for some light relief from the scorching Turkish temperatures, the four windy beaches in Dilek National Park should come to the rescue.
Surrounded by beautiful wooded mountains, Karasu Beach offers solitude and a chance to escape the crowds.
Oludeniz Beach
Perfect if you want to break up your sunbathing with a wander to a nearby café, bar or restaurant, Oludeniz beach on the Turquoise Coast is backed with plenty of eateries to ensure you can enjoy some light refreshment when needed.
You will also be treated to the spectacle of paragliders which take off from nearby Babadag Mountain and land on the beach – why not have a go yourself?
Konyaalti Beach, Antalya
On Turkey's Mediterranean Coast, gorgeous Konyaalti Beach enjoys a magnificent mountain backdrop and the spacious stretch ensures you will find your own patch.
If all that relaxation makes you hungry, a high-end food court also offers plenty of culinary options.
Aydincik Beach, Mersin
With its sugary sand and warm lapping waters, Aydincik Beach insists you bring your camera to get snaps of the flamingos and other birds which relax in the salt water inland.
Butterfly Valley
Nestled between soaring cliffs, the enchanting cove of Butterfly Valley is known for its abundance of colourful fluttery friends in the summer months.
Only those with a head for heights attempt the steep descent from the road above, with most opting to reach the bay via boat from either Olu Deniz or Fethiye.
Cut off from the rest of the world and with a distinctive bohemian vibe, you'll find no mod cons here, however if you do fancy a night in the wilds, camping is permitted.
Related Posts
Leave a Reply
You must be logged in to post a comment.


text:
Ammo Marketplace is one of the top sellers of
remanufactured and factory new ammunition. Each of our rounds is crafted using the best components for ammunition.
It all started with a great idea and a little hard work. Today we're proud to provide quality products direct to your doorstep. We hope you'll enjoy the products as much as we do.